{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T06:16:50Z","timestamp":1725689810677},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642073410"},{"type":"electronic","value":"9783540450580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-45058-0_15","type":"book-chapter","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T11:51:48Z","timestamp":1340797908000},"page":"239-255","source":"Crossref","is-referenced-by-count":8,"title":["Hybrid Motion Planning: Coordinating Two Discs Moving among Polygonal Obstacles in the Plane"],"prefix":"10.1007","author":[{"given":"Shai","family":"Hirsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Halperin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","first-page":"155","volume-title":"Proc. Int. Workshop on Alg. Found, of Rob.","author":"N. Amato","year":"1998","unstructured":"N. Amato, O. Bayazit, L. Dale, C. Jones, and D. Vallejo. OBPRM: An obstacle-based PRM for 3D workspaces. In Proc. Int. Workshop on Alg. Found, of Rob., pages 155\u2013168, 1998."},{"key":"15_CR2","first-page":"1548","volume-title":"Proc. IEEE Conf. on Rob. and Auto.","author":"J. Banon","year":"1990","unstructured":"J. Banon. Implementation and extension of the ladder algorithm. In Proc. IEEE Conf. on Rob. and Auto., pages 1548\u20131553, 1990."},{"issue":"6","key":"15_CR3","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1177\/027836499701600604","volume":"16","author":"J. Barraquand","year":"1997","unstructured":"J. Barraquand, L. E. Kavraki, J.-C. Latombe, T.-Y. Li, R. Motwani, and P. Raghavan. A random sampling scheme for path planning. Internat. J. Robot. Res., 16 (6): 759\u2013774, 1997.","journal-title":"Internat. J. Robot. Res."},{"key":"15_CR4","first-page":"1765","volume-title":"Proc. IEEE Int. Conf. on Rob. and Auto.","author":"J. B\u00e4sch","year":"2001","unstructured":"J. B\u00e4sch, L. Guibas, D. Hsu, and A. Nguyen. Disconnection proofs for motion planning. In Proc. IEEE Int. Conf. on Rob. and Auto., pages 1765\u20131772, 2001."},{"key":"15_CR5","first-page":"1018","volume-title":"Proc. IEEE Int. Conf. on Rob. and Auto.","author":"V. Boor","year":"1999","unstructured":"V. Boor, M. Overmars, and A. van der Stappen. The Gaussian sampling strategy for probabilistic roadmap planners. In Proc. IEEE Int. Conf. on Rob. and Auto., pages 1018\u20131023, 1999."},{"key":"15_CR6","volume-title":"The Complexity of Robot Motion Planning. ACM - MIT Press Doctoral Dissertation Award Series","author":"J. Canny","year":"1987","unstructured":"J. Canny. The Complexity of Robot Motion Planning. ACM - MIT Press Doctoral Dissertation Award Series. MIT Press, Cambridge, MA, 1987."},{"key":"15_CR7","unstructured":"CGAL. The Computational Geometry Algorithms Library, www.cgal.org."},{"key":"15_CR8","volume-title":"Proc. IEEE Int. Conf. on Rob. and Auto.","author":"L. Dale","year":"2001","unstructured":"L. Dale and N. Amato. Probabilistic roadmaps - putting it all together. In Proc. IEEE Int. Conf. on Rob. and Auto., 2001."},{"key":"15_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition, 2000.","edition":"2nd edition"},{"key":"15_CR10","volume-title":"Master\u2019s thesis, Dept. Comput. Sei., Tel-Aviv Univ","author":"E. Flato","year":"2000","unstructured":"E. Flato. Robust and efficient construction of planar Minkowski sums. Master\u2019s thesis, Dept. Comput. Sei., Tel-Aviv Univ., 2000."},{"key":"15_CR11","first-page":"154","volume-title":"The ACM Journal of Exper. Alg","author":"E. Flato","year":"2000","unstructured":"E. Flato, D. Halperin, I. Hanniel, O. Nechushtan, and E. Ezra. The design and implementation of planar maps in CGAL. The ACM Journal of Exper. Alg., 5, 2000. Also in LNCS Vol. 1668 (WAE \u201889), Springer, pp. 154\u2013168.","edition":"5"},{"key":"15_CR12","unstructured":"R. Geraerts and M. Overmars. A comparative study of probabilistic roadmap planners. These proceedings."},{"issue":"3","key":"15_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1177\/027836402320556412","volume":"21","author":"D. Halperin","year":"2002","unstructured":"D. Halperin. Robust geometric computing in motion. International Journal of Robotics Research, 21 (3): 219\u2013232, 2002.","journal-title":"International Journal of Robotics Research"},{"key":"15_CR14","volume-title":"Proc. 4th Workshop on Alg. Eng.","author":"I. Hanniel","year":"2000","unstructured":"I. Hanniel and D. Halperin. Two-dimensional arrangements in cgal and adaptive point location for parametric curves. In Proc. 4th Workshop on Alg. Eng., 2000."},{"key":"15_CR15","volume-title":"Tel-Aviv University","author":"S. Hirsch","year":"2002","unstructured":"S. Hirsch and E. Leiserowitz. Exact construction of Minkowski sums of polygons and a disc with application to motion planning. Technical Report ECG-TR- 181205\u201301, Tel-Aviv University, 2002."},{"key":"15_CR16","volume-title":"Proc. Int. Workshop on Alg. Found. Rob","author":"D. Hsu","year":"1998","unstructured":"D. Hsu, L. E. Kavraki, J.-C. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners. In Proc. Int. Workshop on Alg. Found. Rob., Wellesley, MA, 1998. A. K. Peters."},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"L. E. Kavraki","year":"1996","unstructured":"L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. Overmars. Probabilistic roadmaps for path planning in high dimensional configuration spaces. IEEE Trans. Robot. Autom., 12: 566\u2013580, 1996.","journal-title":"IEEE Trans. Robot. Autom."},{"key":"15_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"J.-C. Latombe","year":"1991","unstructured":"J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991."},{"key":"15_CR19","unstructured":"S. LaValle and M. Branicky. On the relationship between classical grid search and probabilistic roadmaps. These proceedings."},{"key":"15_CR20","volume-title":"Cambridge University Press","author":"K. Mehlhorn","year":"1999","unstructured":"K. Mehlhorn and S. N\u00e4her. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999."},{"key":"15_CR21","first-page":"421","volume-title":"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sei.","author":"J. H. Reif","year":"1979","unstructured":"J. H. Reif. Complexity of the mover\u2019s problem and generalizations. In Proc. 20th Annu. IEEE Sympos. Found. Comput. Sei., pages 421\u2013427, 1979."},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/0196-8858(83)90014-3","volume":"4","author":"J. T. Schwartz","year":"1983","unstructured":"J. T. Schwartz and M. Sharir. On the \u201cpiano movers\u201d problem II: General techniques for computing topological properties of real algebraic manifolds. Adv. Appl. Math., 4: 298\u2013351, 1983.","journal-title":"Adv. Appl. Math."},{"key":"15_CR23","first-page":"733","volume-title":"Handbook of Discrete and Comput. Geom., chapter 40","author":"M. Sharir","year":"1997","unstructured":"M. Sharir. Algorithmic motion planning. In J. E. Goodman and J. O\u2019Rourke, editors, Handbook of Discrete and Comput. Geom., chapter 40, pages 733\u2013754. CRC Press LLC, Boca Raton, FL, 1997."},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF01530889","volume":"3","author":"M. Sharir","year":"1991","unstructured":"M. Sharir and S. Sifrony. Coordinated motion planning for two independent robots. Ann. Math. Artif. Intell., 3: 107\u2013130, 1991.","journal-title":"Ann. Math. Artif. Intell."},{"key":"15_CR25","first-page":"283","volume-title":"Proc. 18th Annu. ACM Sympos. Comput. Geom.","author":"H. Shaul","year":"2002","unstructured":"H. Shaul and D. Halperin. Improved construction of vertical decompositions of three dimensional arrangements. In Proc. 18th Annu. ACM Sympos. Comput. Geom., pages 283\u2013292, 2002."},{"key":"15_CR26","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0921-8890(97)00033-X","volume":"23","author":"P. Svestka","year":"1998","unstructured":"P. Svestka and M. Overmars. Coordinated path planning for multiple robots. Robotics and Autonomous Systems, 23: 125\u2013152, 1998.","journal-title":"Robotics and Autonomous Systems"},{"key":"15_CR27","first-page":"884","volume-title":"Proc. 10th European Symposium on Algorithms, volume 2461 of Lecture Notes in Computer Science","author":"R. Wein","year":"2002","unstructured":"R. Wein. High level filtering for arrangements of conic arcs. In Proc. 10th European Symposium on Algorithms, volume 2461 of Lecture Notes in Computer Science, pages 884\u2013895. Springer-Verlag, Rome, 2002."}],"container-title":["Springer Tracts in Advanced Robotics","Algorithmic Foundations of Robotics V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45058-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T13:19:32Z","timestamp":1556889572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45058-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783642073410","9783540450580"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45058-0_15","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"type":"print","value":"1610-7438"},{"type":"electronic","value":"1610-742X"}],"subject":[],"published":{"date-parts":[[2004]]}}}