425 citations · 982 across the 23 of their papers we have counts for
18 papers · 1 filter
The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems
Sumedh Pendurkar, Taoan Huang, Sven Koenig +1
The A* algorithm is commonly used to solve NP-hard combinatorial optimization problems. When provided with a completely informed heuristic function, A* solves many NP-hard minimum-…
Automatic Algorithm Selection In Multi-agent Pathfinding
Devon Sigurdson, Vadim Bulitko, Sven Koenig +2
In a multi-agent pathfinding (MAPF) problem, agents need to navigate from their start to their goal locations without colliding into each other. There are various MAPF algorithms,…
Position Paper: From Multi-Agent Pathfinding to Pipe Routing
Gleb Belov, Liron Cohen, Maria Garcia de la Banda +3
The 2D Multi-Agent Path Finding (MAPF) problem aims at finding collision-free paths for a number of agents, from a set of start locations to a set of goal positions in a known 2D e…
Searching with Consistent Prioritization for Multi-Agent Path Finding
Hang Ma, Daniel Harabor, Peter J. Stuckey +2
We study prioritized planning for Multi-Agent Path Finding (MAPF). Existing prioritized MAPF algorithms depend on rule-of-thumb heuristics and random assignment to determine a fixe…
Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery
Hang Ma, Wolfgang Hönig, T. K. Satish Kumar +2
The Multi-Agent Pickup and Delivery (MAPD) problem models applications where a large number of agents attend to a stream of incoming pickup-and-delivery tasks. Token Passing (TP) i…
Multi-Agent Path Finding with Deadlines
Hang Ma, Glenn Wagner, Ariel Felner +3
We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The objective is to maximize the number of agents that can reach their given goal vertices from their given start ve…
Multi-Agent Path Finding with Deadlines: Preliminary Results
Hang Ma, Glenn Wagner, Ariel Felner +3
We formalize the problem of multi-agent path finding with deadlines (MAPF-DL). The objective is to maximize the number of agents that can reach their given goal vertices from their…
Overview: A Hierarchical Framework for Plan Generation and Execution in Multi-Robot Systems
Hang Ma, Wolfgang Hönig, Liron Cohen +5
The authors present an overview of a hierarchical framework for coordinating task- and motion-level operations in multirobot systems. Their framework is based on the idea of using…
AI Buzzwords Explained: Multi-Agent Path Finding (MAPF)
Hang Ma, Sven Koenig
Explanation of the hot topic "multi-agent path finding".
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments
Hang Ma, Jingxing Yang, Liron Cohen +2
Multi-agent path finding (MAPF) is a well-studied problem in artificial intelligence, where one needs to find collision-free paths for agents with given start and goal locations. I…
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks
Hang Ma, Jiaoyang Li, T. K. Satish Kumar +1
The multi-agent path-finding (MAPF) problem has recently received a lot of attention. However, it does not capture important characteristics of many real-world domains, such as aut…
Path Planning with Kinematic Constraints for Robot Groups
Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen +3
Path planning for multiple robots is well studied in the AI and robotics communities. For a given discretized environment, robots need to find collision-free paths to a set of spec…
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios
Hang Ma, Sven Koenig, Nora Ayanian +7
Multi-agent path finding (MAPF) is well-studied in artificial intelligence, robotics, theoretical computer science and operations research. We discuss issues that arise when genera…
Ethical Considerations in Artificial Intelligence Courses
Emanuelle Burton, Judy Goldsmith, Sven Koenig +3
The recent surge in interest in ethics in artificial intelligence may leave many educators wondering how to address moral, ethical, and philosophical issues in their AI courses. As…
Optimal Target Assignment and Path Finding for Teams of Agents
Hang Ma, Sven Koenig
We study the TAPF (combined target-assignment and path-finding) problem for teams of agents in known terrain, which generalizes both the anonymous and non-anonymous multi-agent pat…
Multi-Agent Path Finding with Delay Probabilities
Hang Ma, T. K. Satish Kumar, Sven Koenig
Several recently developed Multi-Agent Path Finding (MAPF) solvers scale to large MAPF instances by searching for MAPF plans on 2 levels: The high-level search resolves collisions…
BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm
William Yeoh, Ariel Felner, Sven Koenig
Distributed constraint optimization (DCOP) problems are a popular way of formulating and solving agent-coordination problems. A DCOP problem is a problem where several agents coord…
Existence and Finiteness Conditions for Risk-Sensitive Planning: Results and Conjectures
Yaxin Liu, Sven Koenig
Decision-theoretic planning with risk-sensitive planning objectives is important for building autonomous agents or decision-support systems for real-world applications. However, th…