{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T21:10:23Z","timestamp":1737321023093,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433996"},{"type":"electronic","value":"9783540459934"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45993-6_12","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T20:10:22Z","timestamp":1184962222000},"page":"195-215","source":"Crossref","is-referenced-by-count":4,"title":["Multiple-Robot Motion Planning = Parallel Processing + Geometry"],"prefix":"10.1007","author":[{"given":"Susan","family":"Hert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brad","family":"Richards","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,23]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"R. Alani, F. Robert, F. Ingrand, and S. Suzuki. Multi-robot cooperation through incremental planmerging. In Proceedings 1995 IEEE International Conference on Robotics and Automation, pages 2573\u20132578, 1995.","DOI":"10.1109\/ROBOT.1995.525645"},{"key":"12_CR2","unstructured":"E. M. Arkin, S. P. Fekete, and J. S. B. Mitchell. Approximation algorithms for lawn mowing and milling. Technical report, Mathematisches Institut, Universit\u00e4t zu K\u00f6ln, 1997."},{"key":"12_CR3","unstructured":"H. Bast and S. Hert. The area partitioning problem. In Proceedings of the 12th Annual Canadian Conference on Computational Geometry, pages 163\u2013172, 2000."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/PL00009460","volume":"22","author":"K. F. B\u00f6hringer","year":"1999","unstructured":"K. F. B\u00f6hringer, B. R. Donald, and D. Halperin. On the area bisectors of a polygon. Discrete Computational Geometery, 22:269\u2013285, 1999.","journal-title":"Discrete Computational Geometery"},{"key":"12_CR5","unstructured":"P. Bose, J. Czyzowicz, E. Kranakis, D. Krizanc, and D. Lessard. Near-optimal partitioning of rectangles and prisms. In Proceedings 11th Canadian Conference on Computational Geometry, pages 162\u2013165, 1999."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"S. Buckley. Fast motion planning for multiple moving robots. In Proceedings 1989 IEEE International Conference on Robotics and Automation, pages 322\u2013326, May 1989.","DOI":"10.1109\/ROBOT.1989.100008"},{"key":"12_CR7","unstructured":"M. D\u00edaz and J. O\u2019Rourke. Ham-sandwich sectioning of polygons. In Proceedings 2nd Canadian Conference on Computational Geometry, pages 282\u2013286, 1991."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/BF01840371","volume":"2","author":"M. Erdmann","year":"1987","unstructured":"M. Erdmann and T. Lozano-P\u00e9rez. On multiple moving objects. Algorithmica, 2:477\u2013521, 1987.","journal-title":"Algorithmica"},{"key":"12_CR9","first-page":"235","volume-title":"Computational Geometry","author":"D. H. Greene","year":"1983","unstructured":"D. H. Greene. The decomposition of polygons into convex parts. In F. P. Preparata, editor, Computational Geometry, volume 1 of Advances in Computing Research, pages 235\u2013259. JAI Press, London, England, 1983."},{"key":"12_CR10","unstructured":"R. Gu\u00e0rdia and F. Hurtado. On the equipartitions of convex bodies and convex polygons. In Proceedings 16th European Workshop on Computational Geometry, pages 47\u201350, 2000."},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1142\/S0218195998000230","volume":"8","author":"S. Hert","year":"1998","unstructured":"S. Hert and V. Lumelsky. Polygon area decomposition for multiple-robot workspace division. International Journal of Computational Geometry and Applications, 8(4):437\u2013466, 1998.","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF00141150","volume":"3","author":"S. Hert","year":"1996","unstructured":"S. Hert, S. Tiwari, and V. Lumelsky. A terrain-covering algorithm for an AUV. Journal of Autonomous Robots, 3:91\u2013119, 1996.","journal-title":"Journal of Autonomous Robots"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"S. Hertel and K. Mehlhorn. Fast triangulation of simple polygons. In Proceedings of Conference on Foundations of Computation Theory, pages 207\u2013218, New York, 1983. Springer-Verlag.","DOI":"10.1007\/3-540-12689-9_105"},{"issue":"8","key":"12_CR14","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/135226.135232","volume":"35","author":"S. F. Hummel","year":"1992","unstructured":"S. F. Hummel, E. Schonberg, and E. L. Flynn. Factoring: A method for scheduling parallel loops. Communications of the ACM, 35(8):90\u2013101, 1992.","journal-title":"Communications of the ACM"},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1177\/027836498600500304","volume":"5","author":"K. Kant","year":"1986","unstructured":"K. Kant and S. W. Zucker. Toward efficient trajectory planning: the path-velocity decomposition. International Journal of Robotics Research, 5(3):72\u201389, 1986.","journal-title":"International Journal of Robotics Research"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1137\/0214056","volume":"14","author":"J. M. Keil","year":"1985","unstructured":"J. M. Keil. Decomposing a polygon into simpler components. SIAM Journal on Computing, 14:799\u2013817, 1985.","journal-title":"SIAM Journal on Computing"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"S. LaValle and S. Hutchinson. Optimal motion planning for multiple robots having independen t goals. In Proceedings IEEE International Conference on Robotics and Automation, pages 2847\u20132852, April 1996.","DOI":"10.1109\/ROBOT.1996.506594"},{"key":"12_CR18","unstructured":"S. Leroy, J.-P. Laumond, and T. Sim\u00e9on. Multiple path coordination for mobile robots: a geometric algor ithm. In Dean Thomas, editor, Proceedings of the 16th International Joint Conference on Artif icial Intelligence (IJCAI-99-Vol2), pages 1118\u20131123. Morgan Kaufmann Publishers, 1999."},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/BF02577870","volume":"22","author":"J. Liu","year":"1994","unstructured":"J. Liu, V. A. Saletore, and T. G. Lewis. Safe self-scheduling: A parallel loop schedule scheme for shared-memory multiprocessors. International Journal of Parallel Programming, 22:589\u2013616, 1994.","journal-title":"International Journal of Parallel Programming"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"P. A. O\u2019Donnell and T. Lozano-P\u00e9rez. Deadlock-free and collision-free coordination of two robot manipulators. In Proceedings 1989 IEEE International Conference on Robotics and Automation, pages 484\u2013489, May 1989.","DOI":"10.1109\/ROBOT.1989.100033"},{"issue":"6","key":"12_CR21","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1109\/JRA.1987.1087133","volume":"3","author":"B. J. Oommen","year":"1987","unstructured":"B. J. Oommen, S. S. Iyengar, N. S. V. Rao, and R.L Kashyap. Robot navigation in unknown terrains using learned visibility graphs. Part I: The disjoint convex obstacle case. IEEE Journal of Robotics and Automation, RA-3(6):672\u2013681, 1987.","journal-title":"IEEE Journal of Robotics and Automation"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"D. Parsons and J. Canny. A motion planner for multiple mobile robots. In Proceedings 1990 IEEE International Conference on Robotics and Automation, pages 8\u201313, May 1990.","DOI":"10.1109\/ROBOT.1990.125937"},{"issue":"12","key":"12_CR23","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1109\/TC.1987.5009495","volume":"36","author":"C. Polychronopoulous","year":"1987","unstructured":"C. Polychronopoulous and D. J. Kuck. Guided self-scheduling: A practical scheduling scheme for parallel supercomputers. IEEE Transactions on Computers, 36(12):1425\u20131439, 1987.","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"12_CR24","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1109\/56.812","volume":"4","author":"N. S. V. Rao","year":"1988","unstructured":"N. S. V. Rao, S. S. Iyengar, B. J. Oommen, and R. L. Kashyap. On terrain model acquisition by a point robot amidst polyhedral obs tacles. International Journal of Robotics and Automation, 4(4):450\u2013455, 1988.","journal-title":"International Journal of Robotics and Automation"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"N. S. V. Rao, V. Protopopescu, and N Manickam. Cooperative terrain model acquisition by a team of two or three point-robots. In Proceedings 1996 International Conference on Robotics and Automation, volume 2, pages 1427\u20131433, 1996.","DOI":"10.1109\/ROBOT.1996.506906"},{"key":"12_CR26","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0020-0190(92)90042-T","volume":"41","author":"T. C. Shermer","year":"1992","unstructured":"T. C. Shermer. A linear time algorithm for bisecting a polygon. Information Processing Letters, 41:135\u2013140, 1992.","journal-title":"Information Processing Letters"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"T. Sim\u00e9on, S. Leroy, and J. P. Laumond. A collision checker for car-like robots coordination. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA-98), pages 46\u201351, May 16\u201320 1998.","DOI":"10.1109\/ROBOT.1998.676252"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"J. M. Smith, C. Y. Choo, and N. M. Nasrabadi. Terrain acquisition algorithm for an autonomous mobile robot with finite-range sensors. In Proceedings of SPIE Applications of Arti.cial Intelligence IX, volume 1468, pages 493\u2013501, Orlando, FL, 1991.","DOI":"10.1117\/12.45492"},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0020-0190(91)90209-Z","volume":"38","author":"I. Stojmenovi\u0107","year":"1991","unstructured":"I. Stojmenovi\u0107. Bisections and ham-sandwich cuts of convex polygons and polyhedra. Information Processing Letters, 38:15\u201321, 1991.","journal-title":"Information Processing Letters"},{"key":"12_CR30","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/357346.357348","volume":"3","author":"S. B. Tor","year":"1984","unstructured":"S. B. Tor and A. E. Middleditch. Convex decomposition of simple polygons. ACM Transactions on Graphics, 3:244\u2013265, 1984.","journal-title":"ACM Transactions on Graphics"},{"key":"12_CR31","unstructured":"C. W. Warren. Multiple robot path coordination using arti.cial potential fields. In Proceedings 1990 International Conference on Robotics and Automation, pages 500\u2013505, May 1990."}],"container-title":["Lecture Notes in Computer Science","Sensor Based Intelligent Robots"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45993-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T20:54:42Z","timestamp":1737320082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45993-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433996","9783540459934"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-45993-6_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}