## Coordinating Multiple Robots with Kinodynamic Constraints along Specified Paths (2005)

### Cached

### Download Links

- [www.cs.rpi.edu]
- [www.cs.rpi.edu]
- [ijr.sagepub.com]
- DBLP

### Other Repositories/Bibliography

Citations: | 53 - 9 self |

### BibTeX

@MISC{Peng05coordinatingmultiple,

author = {Jufeng Peng and Srinivas Akella},

title = {Coordinating Multiple Robots with Kinodynamic Constraints along Specified Paths},

year = {2005}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper focuses on the collision-free coordination of multiple robots with kinodynamic constraints along specified paths. We present an approach to generate continuous velocity profiles for multiple robots; these velocity profiles satisfy the dynamics constraints, avoid collisions, and minimize the completion time. The approach, which combines techniques from optimal control and mathematical programming, consists of identifying collision segments along each robot's path, and then optimizing the robots' velocities along the collision and collision-free segments. First, for each path segment for each robot, the minimum and maximum possible traversal times that satisfy the dynamics constraints are computed by solving the corresponding two-point boundary value problems. The collision avoidance constraints for pairs of robots can then be combined to formulate a mixed integer nonlinear programming (MINLP) problem. Since this nonconvex MINLP model is difficult to solve, we describe two related mixed integer linear programming (MILP) formulations, which provide schedules that give lower and upper bounds on the optimum; the upper bound schedule is designed to provide continuous velocity trajectories that are feasible. The approach is illustrated with coordination of multiple robots, modeled as double integrators subject to velocity and acceleration constraints. An application to coordination of nonholonomic car-like robots is described, along with implementation results for 12 robots.

### Citations

2123 |
Robot motion planning
- Latombe
- 1990
(Show Context)
Citation Context ...le Robot Coordination: Motion planning for multiple robots requires moving each robot from its initial to its goal configuration, while avoiding collisions with static obstacles or with other robots (=-=[24]-=-). This problem is highly underconstrained, and Hopcroft, Schwartz, and Sharir [16] showed that even a simplified two-dimensional case of the problem is PSPACE-hard. Recent efforts have focused on red... |

1074 |
Integer and combinatorial optimization
- Nemhauser, Wolsey
- 1988
(Show Context)
Citation Context ...) (when Ai exits segment k before Aj enters segment h) or tik ≥ tj(h+1) (when Aj exits segment h before Ai enters segment k). These disjunctive constraints are converted to standard conjunctive form (=-=[28]-=-) by introducing δijkh, a binary variable that is 1 if robot Ai goes first along its kth segment and 0 if robot Aj goes first along its hth segment, and M, a sufficiently large positive number. The re... |

500 |
Scheduling: Theory, Algorithms and Systems
- Pinedo
- 2001
(Show Context)
Citation Context ...al operations, is a robot’s motion along its path. Each operation is the motion along a segment. Each machine is a collision zone or a collision-free zone. The job shop scheduling problem is NP-hard (=-=[31]-=-), and by reduction, the instantaneous model for robot coordination is NP-hard. 5 Continuous Velocity Model We now consider generating a schedule with continuous velocity profiles for the robots that ... |

448 | Randomized kinodynamic planning
- LaValle, Kuffner
(Show Context)
Citation Context ...mics constraints moving along a given path among moving obstacles. Recent work has focused on randomized kinodynamic planning, including the use of rapidly exploring random trees (Lavalle and Kuffner =-=[27]-=-) and probabilistic roadmaps (Hsu et al. [17]). Air Traffic Control: Conflict resolution among multiple aircraft in a shared airspace is closely related to multiple robot coordination. Tomlin, Pappas,... |

364 | Snopt: An sqp algorithm for large-scale constrainted optimization - Gill, Murray, et al. - 2002 |

356 |
AMPL - A Modeling Language For Mathematical Programming boyd & fraser publishing company
- Fourer, Gay, et al.
- 1993
(Show Context)
Citation Context ...e PQP collision detection package (Larsen et al. [23]) by sampling uniformly along each robot’s path. We generate the MILP formulations from the computed collision zones and solve them using the AMPL =-=[13]-=- and CPLEX [18] optimization packages. Since the setpoint formulation with its tighter constraints is usually solved much more quickly than the improved instantaneous formulation, we use the setpoint ... |

212 | Conflict resolution for air traffic management: a study in multi-agent hybrid systems
- TOMLIN, PAPPAS, et al.
- 1998
(Show Context)
Citation Context ...ilistic roadmaps (Hsu et al. [17]). Air Traffic Control: Conflict resolution among multiple aircraft in a shared airspace is closely related to multiple robot coordination. Tomlin, Pappas, and Sastry =-=[42]-=- synthesized provably safe conflict resolution maneuvers for two aircraft using speed and heading changes. Kosecka et al. [21] used potential field planners to generate conflict resolution maneuvers. ... |

203 | Randomized Kinodynamic Motion Planning with Moving Obstacles, Int
- Hsu, Kindel, et al.
- 2002
(Show Context)
Citation Context ...ong moving obstacles. Recent work has focused on randomized kinodynamic planning, including the use of rapidly exploring random trees (Lavalle and Kuffner [27]) and probabilistic roadmaps (Hsu et al. =-=[17]-=-). Air Traffic Control: Conflict resolution among multiple aircraft in a shared airspace is closely related to multiple robot coordination. Tomlin, Pappas, and Sastry [42] synthesized provably safe co... |

178 | On Multiple Moving Objects
- Erdmann, Lozano-Perez
- 1986
(Show Context)
Citation Context ...obots have specified trajectories. This is the problem of planning a path and velocity for a single robot among moving obstacles (Reif and Sharir [32], Kant and Zucker [19]). Erdmann and Lozano-Perez =-=[12]-=- obtain a heuristic solution for planning the motions of multiple robots by assigning priorities to robots and sequentially searching for collision-free paths for the robots in the configuration-time ... |

166 |
Numerical Potential Field techniques for Robot Path Planning
- Barraquand, Langlois, et al.
- 1992
(Show Context)
Citation Context ...ion space by grouping robots (Aronov et al. [3]) or using probabilistic approaches. A potential field randomized path planner was applied to multiple robot planning (Barraquand, Langlois, and Latombe =-=[4]-=-), and probabilistic roadmap planner have been developed for multiple car-like robots (Svestka and Overmars [43]) and multiple manipulators (Sanchez and Latombe [35]). A slightly more constrained vers... |

157 | Practical methods for optimal control using nonlinear programming - BETTS - 2001 |

139 |
Toward efficient Trajectory Planning: The path-velocity decomposition, Int
- Kant, Zucker
(Show Context)
Citation Context ...tained when all but one of the robots have specified trajectories. This is the problem of planning a path and velocity for a single robot among moving obstacles (Reif and Sharir [32], Kant and Zucker =-=[19]-=-). Erdmann and Lozano-Perez [12] obtain a heuristic solution for planning the motions of multiple robots by assigning priorities to robots and sequentially searching for collision-free paths for the r... |

130 |
Time-optimal control of robotic manipulators along specified paths,” The Int
- Bobrow, Dubowsky, et al.
- 1985
(Show Context)
Citation Context ...y addressed either the collision-free path coordination problem of several robots without considering dynamics constraints ([29],[26],[41]), or the search for time-optimal motions for a single robot (=-=[7]-=-,[39]), the contribution of this paper is an approach to generate continuous velocity profiles that avoids2 Peng and Akella collisions between multiple robots and that also minimize the task completio... |

126 | Motion Planning in Dynamic Environments Using Velocity Obstacles - Fiorini, Shiller - 1998 |

117 | Motion planning in the presence of moving obstacles
- Reif, Sharir
- 1985
(Show Context)
Citation Context ...n of the problem is obtained when all but one of the robots have specified trajectories. This is the problem of planning a path and velocity for a single robot among moving obstacles (Reif and Sharir =-=[32]-=-, Kant and Zucker [19]). Erdmann and Lozano-Perez [12] obtain a heuristic solution for planning the motions of multiple robots by assigning priorities to robots and sequentially searching for collisio... |

103 |
On the complexity of motion planning for multiple independent objects: PSPACE-hardness of the warehousemans problem
- Hopcroft, Schwartz, et al.
- 1984
(Show Context)
Citation Context ...ot from its initial to its goal configuration, while avoiding collisions with static obstacles or with other robots ([24]). This problem is highly underconstrained, and Hopcroft, Schwartz, and Sharir =-=[16]-=- showed that even a simplified two-dimensional case of the problem is PSPACE-hard. Recent efforts have focused on reducing the dimension of the configuration space by grouping robots (Aronov et al. [3... |

98 |
Minimum-time control of robotic manipulators with geometric path constraints
- Shin, McKay
- 1985
(Show Context)
Citation Context ...dressed either the collision-free path coordination problem of several robots without considering dynamics constraints ([29],[26],[41]), or the search for time-optimal motions for a single robot ([7],=-=[39]-=-), the contribution of this paper is an approach to generate continuous velocity profiles that avoids2 Peng and Akella collisions between multiple robots and that also minimize the task completion tim... |

92 | Kinodynamic motion planning
- Donald, Xavier, et al.
- 1993
(Show Context)
Citation Context ...ts. Implementation results for coordination of 12 robots are described. 1 Introduction Coordinating multiple robots with kinodynamic constraints, i.e. simultaneous kinematic and dynamics constraints (=-=[11]-=-), in a shared workspace without collisions has applications in manufacturing cells ([33]), AGV coordination in harbors and airports ([2]), and air traffic control ([5]). The general problem requires ... |

88 |
Robot Motion Planning and Control
- Laumond
- 1998
(Show Context)
Citation Context ...e easily added to the MILP formulations. Car-like robots: Our approach can be applied to car-like nonholonomic robots with continuous curvature paths. Paths that satisfy the nonholonomic constraints (=-=[25]-=-) typically require the robot to stop whenever there is a discontinuity in curvature (to change the steering direction) or there is a cusp point (to reverse the robot direction of motion). Therefore w... |

83 | Optimal Motion Planning for Multiple Robots Having Independent Goals
- LaValle, Hutchinson
- 1998
(Show Context)
Citation Context ...h kinodynamic constraints along specified paths. While prior work mostly addressed either the collision-free path coordination problem of several robots without considering dynamics constraints ([29],=-=[26]-=-,[41]), or the search for time-optimal motions for a single robot ([7],[39]), the contribution of this paper is an approach to generate continuous velocity profiles that avoids2 Peng and Akella collis... |

74 | A provably good approximation algorithm for optimal-time trajectory planning - Donald, Xavier - 1989 |

70 |
Global time-optimal motions of robotic manipulators in the presence of obstacles
- Shiller, Dubowsky
- 1988
(Show Context)
Citation Context ...tory planning directly in the 2n-dimensional state space that considers both kinematic and dynamic constraints is called kinodynamic planning. Sahar and Hollerbach [34] and later Shiller and Dubowsky =-=[38]-=- developed algorithms for global near minimum-time trajectory generation (path and velocity) for a manipulator with dynamics and actuator constraints using grid-based search spaces. Donald et al. [11]... |

67 |
Deadlock-free and collision-free coordination of two robot manipulators
- O’Donnell, Lozano-Perez
- 1989
(Show Context)
Citation Context ...g with kinodynamic constraints along specified paths. While prior work mostly addressed either the collision-free path coordination problem of several robots without considering dynamics constraints (=-=[29]-=-,[26],[41]), or the search for time-optimal motions for a single robot ([7],[39]), the contribution of this paper is an approach to generate continuous velocity profiles that avoids2 Peng and Akella c... |

67 | On Delaying Collision Checking in PRM Planning : Application to Multi-Robot Coordination, Int
- Sánchez, Latombe
- 2002
(Show Context)
Citation Context ... (Barraquand, Langlois, and Latombe [4]), and probabilistic roadmap planner have been developed for multiple car-like robots (Svestka and Overmars [43]) and multiple manipulators (Sanchez and Latombe =-=[35]-=-). A slightly more constrained version of the problem is obtained when all but one of the robots have specified trajectories. This is the problem of planning a path and velocity for a single robot amo... |

67 | Mixed integer programming for multi-vehicle path planning
- Schouwenaars, Moor, et al.
- 2001
(Show Context)
Citation Context ...chi and Pallottino [5] modeled aircraft with constant velocity and curvature bounds and generated minimum total time collision-free paths using given waypoints for three aircraft. Schouwenaars et al. =-=[37]-=- used a discretized system model to develop an MILP formulation for fuel-optimal path planning of multiple vehicles, including moving obstacles. Pallottino, Feron, and Bicchi [30] generate conflict-fr... |

61 |
Coordinated Motion Planning for Multiple Car-Like Robots Using Probabilistic Roadmaps
- Svestka, Overmars
- 1995
(Show Context)
Citation Context ...d path planner was applied to multiple robot planning (Barraquand, Langlois, and Latombe [4]), and probabilistic roadmap planner have been developed for multiple car-like robots (Svestka and Overmars =-=[43]-=-) and multiple manipulators (Sanchez and Latombe [35]). A slightly more constrained version of the problem is obtained when all but one of the robots have specified trajectories. This is the problem o... |

56 | Path Coordination for Multiple Mobile Robots: A ResolutionComplete Algorithm
- Siméon, Leroy, et al.
- 2002
(Show Context)
Citation Context ...odynamic constraints along specified paths. While prior work mostly addressed either the collision-free path coordination problem of several robots without considering dynamics constraints ([29],[26],=-=[41]-=-), or the search for time-optimal motions for a single robot ([7],[39]), the contribution of this paper is an approach to generate continuous velocity profiles that avoids2 Peng and Akella collisions ... |

52 | Fast Motion Planning for Multiple Moving Robots - Buckley - 1989 |

48 | An exact algorithm for kinodynamic planning in the plane - Canny, Rege, et al. - 1991 |

45 |
On optimal cooperative conflict resolution for air traffic management systems
- Bicci, Pallottino
- 2000
(Show Context)
Citation Context ...atic and dynamics constraints ([11]), in a shared workspace without collisions has applications in manufacturing cells ([33]), AGV coordination in harbors and airports ([2]), and air traffic control (=-=[5]-=-). The general problem requires finding the trajectory (path and velocity profile) of each robot such that the specified objective, such as the task completion time, total time, or energy consumption,... |

44 | F.: Multi robot cooperation in the martha project
- Alami, Fleury, et al.
- 1997
(Show Context)
Citation Context ...raints, i.e. simultaneous kinematic and dynamics constraints ([11]), in a shared workspace without collisions has applications in manufacturing cells ([33]), AGV coordination in harbors and airports (=-=[2]-=-), and air traffic control ([5]). The general problem requires finding the trajectory (path and velocity profile) of each robot such that the specified objective, such as the task completion time, tot... |

43 | Planning of minimum-time trajectories for robot-arms
- Sahar, Hollerbach
- 1985
(Show Context)
Citation Context ...oving along a specified path. Trajectory planning directly in the 2n-dimensional state space that considers both kinematic and dynamic constraints is called kinodynamic planning. Sahar and Hollerbach =-=[34]-=- and later Shiller and Dubowsky [38] developed algorithms for global near minimum-time trajectory generation (path and velocity) for a manipulator with dynamics and actuator constraints using grid-bas... |

43 | Dynamic scaling of manipulator trajectories - Hollerbach - 1984 |

40 | Trajectory planning in a dynamic workspace: a ‘state-time space’ approach. Advanced Robotics 13(1): 75–94
- Fraichard
- 1999
(Show Context)
Citation Context ... spaces. Donald et al. [11] developed a polynomial time approximation algorithm to generate near time-optimal trajectories for a single robot that satisfy kinematic and dynamic constraints. Fraichard =-=[14]-=- describes a trajectory planner for a car-like robot with dynamics constraints moving along a given path among moving obstacles. Recent work has focused on randomized kinodynamic planning, including t... |

39 | A hierarchical strategy for path planning among moving obstacles - Fujimura, Samet - 1989 |

34 |
Conflict resolution problems for air traffic management systems solved with mixed integer programming
- Pallottino, Feron, et al.
- 2002
(Show Context)
Citation Context ... Schouwenaars et al. [37] used a discretized system model to develop an MILP formulation for fuel-optimal path planning of multiple vehicles, including moving obstacles. Pallottino, Feron, and Bicchi =-=[30]-=- generate conflict-free paths to minimize the total flight time for the cases when either instantaneous velocity changes or heading angle changes are allowed. 3 Problem Overview Given a set of n robot... |

32 | Coordinating the motions of multiple robots with specified trajectories
- Akella, Hutchinson
(Show Context)
Citation Context ...robot is specified. Previous work on trajectory coordination focused almost exclusively on dual robot systems (Shin and Zheng [40], Bien and Lee [6], Chang, Chung, and Lee [9]). Akella and Hutchinson =-=[1]-=- recently developed an MILP formulation for the trajectory coordination of large numbers of robots by changing robot start times. Our work extends these problem classes by additionally considering dyn... |

32 | Smooth motion planning for car-like vehicles
- Lamiraux, Laumond
- 2001
(Show Context)
Citation Context ... for a forward moving robot (Scheuer and Fraichard [36]) so that the robot does not have to stop at curvature discontinuities. When the class of continuous curvature paths includes cusp points ([15], =-=[22]-=-), we add the constraint that the robot velocity must be zero at every such point. Aircraft: To apply this approach to aircraft, we can use a simplified planar aircraft model ([5]). Since the path is ... |

29 | Motion planning in dynamic environments using the relative velocityparadigm - Fiorini, Shiller - 1993 |

29 | Time Optimal Trajectory Planning in Dynamic Environments - Fiorini, Shiller - 1996 |

28 | Resolution of conflicts involving many aircraft via semidefinite programming - Frazzoli, Mao, et al. - 2001 |

28 | Improving the efficiency of time-optimal path-following algorithms - Slotine, Yang - 1989 |

27 | A concept for manipulator trajectory planning - Pfeiffer, Johanni - 1987 |

25 | From Reeds and Shepp’s to continuous-curvature paths
- Fraichard, Scheuer, et al.
- 1999
(Show Context)
Citation Context ... paths for a forward moving robot (Scheuer and Fraichard [36]) so that the robot does not have to stop at curvature discontinuities. When the class of continuous curvature paths includes cusp points (=-=[15]-=-, [22]), we add the constraint that the robot velocity must be zero at every such point. Aircraft: To apply this approach to aircraft, we can use a simplified planar aircraft model ([5]). Since the pa... |

24 | Non-uniform discretization approximations for kinodynamic motion planning - Reif, Wang - 1997 |

23 | Computation of path constrained time optimal motions with dynamic singularities,” Journal of dynamic systems, measurement, and control - Shiller, Lu - 1992 |

22 | Time-optimal trajectories for a robotic manipulator: A provably good approximation algorithm - Heinzinger, Jacobs, et al. - 1990 |

22 | The near-minimum-time control of open-loop articulated kinematic chains. ASME - Kahn, Roth |

22 | Motion planning in dynamic environments: Obstacles moving along arbitrary trajectories - Shiller, Large, et al. - 2001 |

22 | User’s guide for dircol (version 2.1): A direct collocation method for the numerical solution of optimal control problems. Technical report, Fachgebiet Simulation und Systemoptimierung, Technische Universit Darmstadt - Stryk - 1999 |