Abstract
We present linear-time algorithms for a pair of robots to travel inside a simple polygon on paths of total minimum length while maintaining visibility with one another. We show that the optimal paths for this mutually visible constraint are almost always each agent’s shortest path. The this may not happen only on a sub-case of when the line of visibility of the source points crosses the line of visibility of the target points. We also show that the travel schedule is computable, but that it also suffers from a pathological case.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bailey, T.: Constrained initialisation for bearing-only SLAM. In: IEEE International Conference on Robotics and Automation, Taipei, Taiwan, September 14-19, vol. 2, pp. 1966–1971 (2003)
Bespamyatnikh, S.: Computing homotopic shortest paths in the plane. Journal of Algorithms 49(2), 284–303 (2003)
Chazelle, B.: A theorem on polygon cutting with applications. In: 23th Annu. IEEE Sympos. Found. Comput. Sci., pp. 339–349 (1982)
Efrat, S., Kobourov, S.G., Lubiw, A.: Computing homotopic shortest paths efficiently. In: Proceedings of the 10th Annual European Symposium on Algorithms, September 17-21, pp. 411–423 (2002)
Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 209–233 (1987)
Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. Computational Geometry: Theory and Applications 4(2), 63–97 (1994)
Howard, A.: Multi-robot mapping using manifold representations. In: Proceedings of the 2004 IEEE International Conference on Robotics and Automation, New Orleans, LA, April 2004, vol. 4, pp. 4198–4203 (2004)
Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.-R. (ed.) Handbook of Computational Geometry, Amsterdam, pp. 633–701. Elsevier, North-Holland (2000)
Nettleton, E., Thrun, S., Durrant-Whyte, H., Sukkarieh, S.: Decentralised SLAM with low-bandwidth communication for teams of vehicles. In: Intl. Conf. on Field and Service FSR 2003, Lake Yamanaka, Japan (July 2003)
Rosencrantz, M., Gordon, G., Thrun, S.: Decentralized sensor fusion with distributed particle filters. In: Proceedings of Conf. Uncertainty in Artificial Intelligence, Acapulco, Mexico (2003)
Sullivan, J., Waydo, S., Campbell, M.: Using stream functions for complex behavior and path generation. In: AIAA Guidance, Navigation, and Control Conference, Austin, Texas, August 11-14. American Institute of Aeronautics and Astronautics (2003), AIAA-2003-5800
Williams, S., Dissanayake, G., Durrant-Whyte, H.F.: An efficient approach to the simultaneous localisation and mapping problem. In: Proceedings of the IEEE International Conference on Robotics and Automation, Washington, DC, May 2002, vol. 1, pp. 406–411 (2002)
Williams, S.B., Dissanayake, G., Durrant-Whyte, H.: Towards multi-vehicle simultaneous localisation and mapping. In: IEEE International Conference on Robotics and Automation, Washington DC, May 2002, vol. 3, pp. 2743–2274 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fenwick, J., Estivill-Castro, V. (2005). Optimal Paths for Mutually Visible Agents. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_87
Download citation
DOI: https://doi.org/10.1007/11602613_87
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)