Graph-based multi-robot path finding and planning
H Ma - Current Robotics Reports, 2022 - Springer
Abstract Purpose of Review Planning collision-free paths for multiple robots is important for
real-world multi-robot systems and has been studied as an optimization problem on graphs …
real-world multi-robot systems and has been studied as an optimization problem on graphs …
Optimal and bounded-suboptimal multi-agent motion planning
Abstract Multi-Agent Motion Planning (MAMP) is the task of finding conflict-free
kinodynamically feasible plans for agents from start to goal states. While MAMP is of …
kinodynamically feasible plans for agents from start to goal states. While MAMP is of …
A comparison of trajectory planning and control frameworks for cooperative autonomous driving
This work considers the cooperative trajectory-planning problem along a double lane
change scenario for autonomous driving. In this paper, we develop two frameworks to solve …
change scenario for autonomous driving. In this paper, we develop two frameworks to solve …
Online task assignment and coordination in multi-robot fleets
We propose a loosely-coupled framework for integrated task assignment, motion planning,
coordination and control of heterogeneous fleets of robots subject to non-cooperative tasks …
coordination and control of heterogeneous fleets of robots subject to non-cooperative tasks …
Target assignment and path planning for navigation tasks with teams of agents
H Ma - 2020 - search.proquest.com
In many real-world applications of multi-agent systems, teams of agents must assign targets
among themselves and plan paths to the targets. The agents must avoid collisions with each …
among themselves and plan paths to the targets. The agents must avoid collisions with each …
Combining multi-robot motion planning and goal allocation using roadmaps
This paper addresses the problem of automating fleets of robots with non-holonomic
dynamics. Previously studied methods either specialize in facets of this problem, that is, one …
dynamics. Previously studied methods either specialize in facets of this problem, that is, one …
[PDF][PDF] Efficient bounded-suboptimal multi-agent path finding and motion planning via improvements to focal search
L Cohen - 2020 - idm-lab.org
Cooperative autonomous agents navigating in different environments without colliding with
obstacles or with each other can be useful in real-world application domains such as …
obstacles or with each other can be useful in real-world application domains such as …
A network-flow reduction for the multi-robot goal allocation and motion planning problem
This paper deals with the problem of allocating goals to multiple robots with complex
dynamics while computing obstacle-free motions to reach those goals. The spectrum of …
dynamics while computing obstacle-free motions to reach those goals. The spectrum of …
A Collision-Free Simulation Framework for ASCs in Automated Container Terminals
Z Sun, Z Qi - 2022 Winter Simulation Conference (WSC), 2022 - ieeexplore.ieee.org
To address the collision avoidance problem of automated stacking cranes (ASCs) in the
automated container terminal, this paper provides a collision-free simulation framework for …
automated container terminal, this paper provides a collision-free simulation framework for …
A comparison of trajectory planning and control frameworks for cooperative autonomous driving
This work considers the cooperative trajectory-planning problem along a double lane
change scenario for autonomous driving. In this paper we develop two frameworks to solve …
change scenario for autonomous driving. In this paper we develop two frameworks to solve …