Filters








419 Hits in 4.6 sec

Frontmatter

Simon M. Lucas, Michael Mateas, Mike Preuss, Pieter Spronck, Julian Togelius, Michael Wagner
2013 Dagstuhl Publications  
For simplicity, we will consider primarily the objective of maximising playing strength, and consider games where this is a challenging task, which results in interesting gameplay.  ...  game decisions (for example as state-action graphs).  ...  as foreseen by a range of leading researchers in AI for search and abstraction in games.  ... 
doi:10.4230/dfu.vol6.12191.i dblp:conf/dagstuhl/X13b fatcat:i4isdb5w4fastcbnczbtsdulkm

An Extension of BIM Using AI: a Multi Working-Machines Pathfinding Solution

Yusheng Xiang, Kailun Liu, Tianqing Su, Jun Li, Shirui Ouyang, Samuel S. Mao, Marcus Geimer
2021 IEEE Access  
Using the logistic information from BIM, such as unloading and loading point, we added a pathfinding solution for multi machines to improve the whole construction fleet's productivity.  ...  INDEX TERMS Smart working site, multi agents pathfinding, conflict based searching, building information model, construction site productivity, Huoshenshan hospital project, path planning.  ...  However, for commercial use and to do research based on this project, contact the authors, since they have applied for the patents.  ... 
doi:10.1109/access.2021.3110937 fatcat:vipe2mzxf5b6tdwwra3yjgnn6u

Smart Routing: A Novel Application of Collaborative Path-Finding to Smart Parking Systems

Callum Rhodes, William Blewitt, Craig Sharp, Gary Ushaw, Graham Morgan
2014 2014 IEEE 16th Conference on Business Informatics  
We simulate a smart parking system for an urban environment, and show that a novel approach to collaboratively planning paths for multiple agents can lead to reduced traffic congestion on routes toward  ...  We simulate a smart parking system for an urban environment, and show that a novel approach to collaboratively planning paths for multiple agents can lead to reduced traffic congestion on routes toward  ...  Future work in this area shall explore the application of the prototype engineering solution to large road network segments, drawn from cities noted for their traffic flow issues.  ... 
doi:10.1109/cbi.2014.22 dblp:conf/wecwis/RhodesBSUM14 fatcat:iws6eoqn7be3rft5bd5tpufyvm

Enhanced Partial Expansion A*

M. Goldenberg, A. Felner, R. Stern, G. Sharon, N. Sturtevant, R. C. Holte, J. Schaeffer
2014 The Journal of Artificial Intelligence Research  
Experimental studies show significant improvements in run-time and memory performance for several standard benchmark applications.  ...  When solving instances of problem domains that feature a large branching factor, A* may generate a large number of nodes whose cost is greater than the cost of the optimal solution.  ...  Acknowledgements are due to Kobi Shmerkovich, Tal Beja, Idan Morad and Shaked Zimmermann for performing some of the experiments for this paper.  ... 
doi:10.1613/jair.4171 fatcat:c2rgdwtxfzf7ddigd6if6kctna

Integer Programming for Multi-Robot Planning: A Column Generation Approach [article]

Naveed Haghani, Jiaoyang Li, Sven Koenig, Gautam Kunapuli, Claudio Contardo, Julian Yarkony
2020 arXiv   pre-print
Since the set of robot routes is not enumerable, we attack optimization using column generation where pricing is a resource-constrained shortest-path problem.  ...  We formulate the problem as a weighted set packing problem where elements are defined as being the space-time positions a robot can occupy and the items that can be picked up and delivered.  ...  Routing problems for a fleet of robots in a warehouse are often treated as Multi-Agent Pathfinding problems (MAPF) (Stern et al. 2019) .  ... 
arXiv:2006.04856v1 fatcat:xrbq7l2w2bdubdcwiqlwzsvb3u

Graph Abstraction in Real-time Heuristic Search

V. Bulitko, N. Sturtevant, J. Lu, T. Yau
2007 The Journal of Artificial Intelligence Research  
Such agents plan only a few actions at a time in a local search space and avoid getting trapped in local minima by improving their heuristic function over time.  ...  We then analyze the impact of abstraction in an extensive empirical study in real-time pathfinding.  ...  This research has been enabled by the use of WestGrid computing resources, which are funded in part by the Canada Foundation for Innovation, Alberta Innovation and Science, BC Advanced Education, and the  ... 
doi:10.1613/jair.2293 fatcat:yyh2eiw325avpoclrm54kt2ugq

Reference S14. A management guide for invasive plants in southern forests

Edward D. Entsminger
2017 Figshare  
Found at ISBN: 9780160936326 and http://dx.doi.org/10.5061/dryad.960dh; also available at http://www.srs.fs.fed.us/pubs/gtr/gtr_srs131.pdf (5.23 MB PDF).  ...  A management guide for invasive plants in southern forests. Asheville, North Carolina: U.S. Department of Agriculture Forest Service, Southern Research Station. U.S.  ...  Hand clippers are useful for cutting back climbing vines and small multi-stemmed woody plants up to 1 inch in diameter. Cut as closely to the ground as possible.  ... 
doi:10.6084/m9.figshare.4798012.v1 fatcat:qupljodgjvdohhlnhrskxlwpya

Competing Ideas of Social Justice and Space: Locating Critiques of Housing Renewal in Theory and in Practice

Ed Ferrari
2012 International Journal of Housing Policy  
Soja's formulation of spatial justice is advanced as an appropriate balance between spatial and socio-historic contexts for the justice question.  ...  Some practical implications for the design of urban restructuring policies are offered.  ...  , for example by cutting across individual property rights and the needs of local communities.  ... 
doi:10.1080/14616718.2012.709668 fatcat:ril3ko6hxnek5fpddl2pfhdune

Bismuth: economic geology and value chains

Eimear Deady, Charlie Moon, Kathryn Moore, Kathryn M. Goodenough, Robin K. Shail
2022 Ore Geology Reviews  
Demand for Bi is increasing, mostly as a substitute for Pb and for use in chemicals. Bismuth is mainly chalcophile in behaviour, although it has some lithophile characteristics.  ...  Bismuth can substitute for Pb in galena and Bi-rich galena is a major Bi ore.  ...  Acknowledgements The authors would like to thank Gus Gunn (BGS) for a thorough and constructive internal review and the reviewer Haoyang Zhou (University of Oslo) whose constructive criticism strengthened  ... 
doi:10.1016/j.oregeorev.2022.104722 fatcat:drphq7kblvenpi4rl2g7twflwm

Approximately Orchestrated Routing and Transportation Analyzer: Large-scale traffic simulation for autonomous vehicles

Dustin Carlino, Mike Depinet, Piyush Khandelwal, Peter Stone
2012 2012 15th International IEEE Conference on Intelligent Transportation Systems  
This thesis describes a new open source 1 , agent-based simulator: the Approximately Orchestrated Routing and Transportation Analyzer, or AORTA.  ...  The second, externality pricing, learns the travel time of a variety of different routes and defines a localized notion of cost imposed on other drivers by following the route.  ...  MATSim MATSim [2] , the Multi-Agent Transport Simulation, is another major traffic simulator.  ... 
doi:10.1109/itsc.2012.6338701 dblp:conf/itsc/CarlinoDKS12 fatcat:5jh6m7rsefh6rp4x3ccuqpq42i

Commercial Scenarios for the Web: Opportunities and Challenges

Donna L. Hoffman, Thomas P. Novak, Patrali Chatterjee
2006 Journal of Computer-Mediated Communication  
Therefore, in this paper we propose a structural framework for  ...  The potential of the World Wide Web on the Internet as a commercial medium and market has been widely documented in a variety of media.  ...  Some malls also accept advertising, as with, for example, the Internet Mall. Other examples include the Branch Mall , CyberMart, eMall , and Shopping 2000 .  ... 
doi:10.1111/j.1083-6101.1995.tb00165.x fatcat:vwbpxewffnb6hmhmi6addthcbu

Robust Multi-Agent Path Finding and Executing

Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou
2020 The Journal of Artificial Intelligence Research  
Multi-agent path-finding (MAPF) is the problem of finding a plan for moving a set of agents from their initial locations to their goals without collisions.  ...  We propose sufficient and required conditions for finding a k-robust plan, and show how to convert several MAPF solvers to find such plans. Then, we propose several robust execution policies.  ...  This research was supported by the Israel Ministry of Science, the Czech Ministry of Education, by ISF grants #844/17 to Ariel Felner and #210/17 to Roni Stern, and by the Czech Science Foundation project  ... 
doi:10.1613/jair.1.11734 fatcat:nzldlkursvgyxp2tohk3vfmsge

Local authorities as niche actors: the case of energy governance in the UK

Shane Fudge, Michael Peters, Bridget Woodman
2016 Environmental Innovation and Societal Transitions  
Acknowledgements The authors would like to thank Professor Tim Dixon (School of Construction Management and Engineering, University of Reading and Miles Ten Brink from the University of Manchester for  ...  their helpful insights and feedback on earlier drafts of this paper.  ...  , globalization, rules around trade, costs, prices etc.  ... 
doi:10.1016/j.eist.2015.06.004 fatcat:6buqapyafnhh7m6vci7vzew6be

Multi-Agent Path Finding: A New Boolean Encoding

Roberto Asín Achá, Rodrigo López, Sebastian Hagedorn, Jorge A. Baier
2022 The Journal of Artificial Intelligence Research  
Multi-agent pathfinding (MAPF) is an NP-hard problem. As such, dense maps may be very hard to solve optimally.  ...  We compared against representative solvers of the state-of-the-art, including the search-based algorithm CBS, the ASP-based solver ASP-MAPF, and the branch-and-cut-and-price hybrid solver, BCP.  ...  Introduction Given a graph G and K agents, each of which is associated with a start and a goal vertex of G, multi-agent pathfinding (MAPF) is the problem of finding K non-conflicting paths π 1 , . . .  ... 
doi:10.1613/jair.1.13818 fatcat:2cdbcx7xonbrnfxqi7hfhudqv4

Introduction [chapter]

2013 Mile-High Views  
the subscriptions for the branch of the corporate library in that country.  ...  By September, if pricing is not received from a major publisher, the agent will contact the publisher and ask for the pricing to be expedited in order to get as many firm prices in the system for invoicing  ...  Print bears the burden of increasing distribution costs, with shipping and mailing prices continuing to rise. In sum, print costs are part variable and part fixed.  ... 
doi:10.4324/9781315788920-6 fatcat:us7mnivezffdffnxmhkll5vque
« Previous Showing results 1 — 15 out of 419 results