Advertisement

Feasibility of Motion Planning on Directed Graphs

  • Zhilin Wu
  • Stéphane Grumbach
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5532)

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).

Keywords

Directed Graph Motion Planning Greedy Strategy Component Graph Source Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BJG00]
    Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer Monographs in Mathematics. Springer, Heidelberg (2000)Google Scholar
  2. [FK99]
    Finn, P.W., Kavmkit, L.E.: Computational approaches to drug design. Algorithmica 25, 347–371 (1999)CrossRefGoogle Scholar
  3. [JJ06]
    Jetcheva, J.G., Johnson, D.B.: Routing characteristics of ad hoc networks with unidirectional links. Ad Hoc Networks 4(3), 303–325 (2006)CrossRefGoogle Scholar
  4. [KMS84]
    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)Google Scholar
  5. [LaV06]
    LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)zbMATHGoogle Scholar
  6. [MD02]
    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)Google Scholar
  7. [MPG]
  8. [Per88]
    Perrott, Y.: Track transportation systems. European patent (1988), http://www.freepatentsonline.com/EP0284316.html
  9. [PRST94]
    Papadimitriou, C.H., Raghavan, P., Sudan, M., Tamaki, H.: Motion planning on a graph. In: FOCS 1994, pp. 511–520 (1994)Google Scholar
  10. [SA01]
    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)CrossRefGoogle Scholar
  11. [Wes00]
    West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2000)Google Scholar
  12. [WG08]
    Wu, Z., Grumbach, S.: Feasibility of motion planning on acyclic and strongly connected directed graphs (manuscript, 2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Zhilin Wu
    • 1
  • Stéphane Grumbach
    • 2
  1. 1.CASIA-LIAMA 
  2. 2.INRIA-LIAMA 

Personalised recommendations