Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

AAAI
2010

favoriteEmaildiscussreport

188views Intelligent Agents» more AAAI 2010»

An Optimization Variant of Multi-Robot Path Planning Is Intractable

13 years 4 months ago

An Optimization Variant of Multi-Robot Path Planning Is Intractable

Download ktiml.mff.cuni.cz

An optimization variant of a problem of path planning for multiple robots is addressed in this work. The task is to find spatial-temporal path for each robot of a group of robots such that each robot can reach its destination by navigating through these paths. In the optimization variant of the problem, there is an additional requirement that the makespan of the solution must be as small as possible. A proof of the claim that optimal path planning for multiple robots is -complete is sketched in this short paper.

Pavel Surynek

Real-time Traffic

AAAI 2010 | Intelligent Agents | Multiple Robots | Optimization Variant | Robots |

claim paper

Related Content

» Exploiting Subgraph Structure in MultiRobot Path Planning

» Building efficient partial plans using Markov decision processes

» A realistic model of frequencybased multirobot polyline patrolling

» Decision Making as Optimization in Multirobot Teams

» InformationTheoretic Approach to Efficient Adaptive Path Planning for Mobile Robotic Envir...

» A SamplingBased Motion Planning Approach to Maintain Visibility of Unpredictable Targets

» MRSAM a Quadratically Competitive Multirobot Online Navigation Algorithm

» Learning and planning highdimensional physical trajectories via structured Lagrangians

» Robust Line Planning under Unknown Incentives and Elasticity of Frequencies

Post Info
More Details (n/a)

Added	06 Dec 2010
Updated	06 Dec 2010
Type	Conference
Year	2010
Where	AAAI
Authors	Pavel Surynek

Comments (0)