A framework of Voronoi diagram for planning multiple paths in free space

References

• AurenhammerF. (1991), ‘Voronoi Diagrams – A survey of a fundamental geometric data structure’, ACM Computing Surveys, 23(3), 345–405.
   Google Scholar
• BanerjeeB. 2007. String Tightening as a Self-organising Phenomenon. IEEE Transactions on Neural Networks. 18: 1463–1471.
   PubMedGoogle Scholar
• BanerjeeB. and Chandrasekaran, B. (2004), ‘Perceptual and Action Routines in Diagrammatic Reasoning for Entity Re-identification’, in Proceedings of the 24th Army Science Conference, Orlando, FL.
   Google Scholar
• BanerjeeB. and Chandrasekaran, B. (2006), ‘A Framework for Planning Multiple Paths in Free Space’, in Proceedings of the 25th Army Science Conference, Orlando, FL.
   Google Scholar
• BeardRW, McLainTW, GoodrichM, AndersonEP. 2002. Coordinated Target Assignment and Intercept for Unmanned Air Vehicles. IEEE Transactions on Robotics and Automation. 18: 911–922.
   Google Scholar
• BespamyatnikhS. 2003. Computing Homotopic Shortest Paths in the Plane. Journal of Algorithms. 49: 284–303.
   Google Scholar
• BespamyatnikhSN, KelarevA. 2003. Algorithms for Shortest Paths and d-cycle Problems. Journal of Discrete Algorithms. 1: 1–9.
   Google Scholar
• BuchinK, KnauerC, KriegelK, SchulzA, SeidelR. 2007. On the Number of Cycles in Planar Graphs. Proceedings of the 13th Annual International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science. LinG. Berlin/Heidelberg: Springer. 4598: 97–107.
   Google Scholar
• ByersTH, WatermanMS. 1984. Determining All Optimal and Near-optimal Solutions When Solving Shortest Path Problems by Dynamic Programming. Operations Research. 32: 1381–1384.
   Web of Science ®Google Scholar
• ChandrasekaranB, KurupU, BanerjeeB, JosephsonJR, WinklerR. 2004. An Architecture for Problem Solving with Diagrams. Diagrammatic Representation and Inference, Lecture Notes in Artificial Intelligence 2980. BlackwellA, MarriottK, ShimojimaA. Berlin: Springer-Verlag. 151–165 (Diagrams 2004 – 3rd International Conference on the Theory and Application of Diagrams, University of Cambridge, UK, March 22–24, 2004.).
   Google Scholar
• EppsteinD. 1998. Finding the k Shortest Paths. SIAM Journal on Computing. 28: 652–673.
   Web of Science ®Google Scholar
• ForbusKD, MahoneyJV, DillK. 2002. How Qualitative Spatial Reasoning Can Improve Strategy Game AIs. IEEE Intelligent Systems. 17: 25–30.
   Google Scholar
• FrattaL, MontanariU. 1975. A Vertex Elimination Algorithm for Enumeration of all Simple Paths in a Graph. Networks. 5: 151–177.
   Google Scholar
• GaoS. Jerrum, M., Kaufmann, M., Mehlhorn, K., and Rlling, W. (1988), ‘On Continuous Homotopic One Layer Routing’, in Proceedings of Symposium on Computational Geometry, pp. 392–402.
   Google Scholar
• GoldC, RemmeleP, RoosT. 1999. Fully Dynamic and Kinematic Voronoi Diagrams in GIS. Algorithmica: Special Issue on Cartography and GIS. http://www.voronoi.com/wiki/index.php?title=Publications.
   Google Scholar
• GrnarovA. Kleinrock, L., and Gerla, M. (1979), ‘A New Algorithm for Network Reliability Computation’, in Proceedings of the Computer Networking Symposium, IEEE, pp. 17–20.
   Google Scholar
• HuraGS. 1983. Enumeration of all Simple Paths in a Directed Graph using Petrinets: A Systematic Approach. Microelectronics and Reliability. 23: 157–159.
   Google Scholar
• LeeI, GaheganM. 2002. Interactive Analysis Using Voronoi Diagrams: Algorithms to Support Dynamic Update from a Generic Triangle-based Data Structure. Transactions on GIS. 6: 89–114.
   Google Scholar
• KapoorS, MaheshwariSN, MitchellJSB. 1997. An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. Discrete & Computational Geometry. 18: 377–383.
   Web of Science ®Google Scholar
• KatohN, IbarakiT, MineH. 1982. An Efficient Algorithm for k Shortest Simple Paths. Networks. 12: 411–427.
   Google Scholar
• KhanAA, SinghH. 1980. Petri Net Approach to Enumerate all Simple Paths in a Graph. Electronic Letters. 16: 291–292.
   Google Scholar
• MeshkatSN, SakkasCM. 1987. Voronoi Diagram for Multiply-connected Polygonal Domains II: Implementation and Application. IBM Journal of Research and Development. 31: 373–381.
   Google Scholar
• Ó'DúnlaingC, YapCK. 1985. A ‘Retraction’ Method for Planning the Motion of a Disc. Journal of Algorithms. 6: 104–111.
   Google Scholar
• PapadopoulouE, LeeDT. 2004. The Hausdorff Voronoi Diagram of Polygonal Objects: A Divide and Conquer Approach. International Journal of Computational Geometry and Applications. 14: 421–452.
   Google Scholar
• SrinivasanV, NackmanLR. 1987. Voronoi Diagram for Multiply-connected Polygonal Domains I: Algorithm. IBM Journal of Research and Development. 31: 361–372.
   Web of Science ®Google Scholar
• ThorupM. 1999. Undirected Single-source Shortest Paths with Positive Integer Weights in Linear Time. Journal of the ACM. 46: 362–394.
   Web of Science ®Google Scholar
• ThrunS, BückenA, BurgardW, FoxD, FröhlinghausT, HenningD, HofmannT, KrellM, SchmidtT. 1998. Map Learning and High-speed Navigation in RHINO. Ai-based Mobile Robots: Case Studies of Successful Robot Systems. KortenkampD, BonassoRP, MurphyR. Cambridge, MA: MIT Press.
   Google Scholar
• YenJY. 1971. Finding the k Shortest Loopless Paths in a Network. Management Science. 17: 712–716.
   Web of Science ®Google Scholar