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 space; robotics; autonomous robots; collision avoidance; coordinated motion; motion-planning

Mathematics Subject Classification ID

70B15: Kinematics of mechanisms and robots

68T99: Artificial intelligence

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

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

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