On multiple moving objects

DOI10.1007/BF01840371zbMath0643.68152MaRDI QIDQ1102134

Tomás Lozano-Pérez, Michael Erdmann

Publication date: 1987

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

configuration spaceroboticsautonomous robotscollision avoidancecoordinated motionmotion-planning

Mathematics Subject Classification ID

Kinematics of mechanisms and robots (70B15) Artificial intelligence (68T99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Scalable distributed algorithms for multi-robot near-optimal motion planning, Adaptive consensus algorithms for real‐time operation of multi‐agent systems affected by switching network events, Coordinated motion planning for two independent robots, A light-propagation model for aircraft trajectory planning, Priority inheritance with backtracking for iterative multi-agent path finding, Determination of social laws for multi-agent mobilization, On social laws for artificial agent societies: off-line design, A novel approach for multiple mobile objects path planning: parametrization method and conflict resolution strategy, The complexity of planar compliant motion planning under uncertainty, A globally converging algorithm for reactive robot navigation among moving and deforming obstacles, Path planning for multiple mobile robots under double-warehouse, An Effective Framework for Path Planning Amidst Movable Obstacles, Dynamic-priority-based DMPC with an occupancy grid for mobile systems, Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch, Planning a time-minimal motion among moving obstacles, Visualizing Local Minima in Multi-robot Motion Planning Using Multilevel Morse Theory, On Rearrangement of Items Stored in Stacks, Efficient Large-Scale Multi-Drone Delivery using Transit Networks, Subdimensional expansion for multirobot path planning, Conflict-based search for optimal multi-agent pathfinding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong NP-hardness of moving many discs
• Visibility of disjoint polygons
• Spatial Planning: A Configuration Space Approach
• Reducing Multiple Object Motion Planning to Graph Searching
• On Shortest Paths in Polyhedral Spaces
• Plane-sweep algorithms for intersecting geometric figures