Sciweavers

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

44

TAMC
2009
Springer

favoriteEmaildiscussreport

130views Applied Computing» more TAMC 2009»

Feasibility of Motion Planning on Directed Graphs

14 years 3 months ago

Feasibility of Motion Planning on Directed Graphs

Download liama.ia.ac.cn

Because of irreversibility of movements, motion planning on directed graphs is much more intricate than that on graphs. Recently we showed that the feasibility of motion planning on acyclic and strongly connected directed graphs can be decided in time O(nm) (n, m are respectively the number of vertices and arcs of the directed graph), but left the feasibility of motion planning on (general) directed graphs open. In this paper, we complete the solution by showing that the feasibility of motion planning on directed graphs can be decided in time O(n2 m).

Zhilin Wu, Stéphane Grumbach

Real-time Traffic

Connected Directed Graphs | Directed Graphs | Motion Planning | TAMC 2009 |

claim paper

Related Content

» Planning and fast replanning of safe motions for humanoid robots Application to a kicking ...

» Highdimensional underactuated motion planning via task space control

» Planning for autonomous door opening with a mobile manipulator

» Online planning of timeoptimal jerklimited trajectories

» Utilization of Holonomic Distribution Control for Reactionless Path Planning

» Interactive Manipulation Planning for Animated Characters

» Kinodynamic Motion Planning Amidst Moving Obstacles

» Multiview structure computation without explicitly estimating motion

» Dexterous manipulation planning using probabilistic roadmaps in continuous grasp subspaces

Post Info
More Details (n/a)

Added	27 Jul 2010
Updated	27 Jul 2010
Type	Conference
Year	2009
Where	TAMC
Authors	Zhilin Wu, Stéphane Grumbach

Comments (0)