Abstract
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(n 2 m).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer Monographs in Mathematics. Springer, Heidelberg (2000)
Finn, P.W., Kavmkit, L.E.: Computational approaches to drug design. Algorithmica 25, 347–371 (1999)
Jetcheva, J.G., Johnson, D.B.: Routing characteristics of ad hoc networks with unidirectional links. Ad Hoc Networks 4(3), 303–325 (2006)
Kornhauser, D., Miller, G., Spirakis, P.: Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. In: FOCS 1984, pp. 241–250 (1984)
LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)
Marina, M.K., Das, S.R.: Routing performance in the presence of unidirectional links in multihop wireless networks. In: Proc. of ACM MobiHoc, pp. 12–23 (2002)
Motion planning game, http://www.download-game.com/Motion_Planning_Game.htm
Perrott, Y.: Track transportation systems. European patent (1988), http://www.freepatentsonline.com/EP0284316.html
Papadimitriou, C.H., Raghavan, P., Sudan, M., Tamaki, H.: Motion planning on a graph. In: FOCS 1994, pp. 511–520 (1994)
Song, G., Amato, N.M.: Using motion planning to study protein folding pathways. In: RECOMB 2001: Proceedings of the Fifth Annual International Conference on Computational Biology, pp. 287–296. ACM, New York (2001)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2000)
Wu, Z., Grumbach, S.: Feasibility of motion planning on acyclic and strongly connected directed graphs (manuscript, 2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, Z., Grumbach, S. (2009). Feasibility of Motion Planning on Directed Graphs. In: Chen, J., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2009. Lecture Notes in Computer Science, vol 5532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02017-9_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-02017-9_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02016-2
Online ISBN: 978-3-642-02017-9
eBook Packages: Computer ScienceComputer Science (R0)