{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:05:49Z","timestamp":1725757549688},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642449260"},{"type":"electronic","value":"9783642449277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-44927-7_13","type":"book-chapter","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T01:33:06Z","timestamp":1384824786000},"page":"181-196","source":"Crossref","is-referenced-by-count":6,"title":["A Human-Inspired Collision Avoidance Method for Multi-robot and Mobile Autonomous Robots"],"prefix":"10.1007","author":[{"given":"Fan","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajit","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"13_CR1","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ipl.2005.02.013","volume":"94","author":"S. Das","year":"2005","unstructured":"Das, S., Goswami, P.P., Nandy, S.C.: Smallest k-point enclosing rectangle and square of arbitrary orientation. Information Processing Letters\u00a094(6), 259\u2013266 (2005)","journal-title":"Information Processing Letters"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","volume":"12","author":"A. Aggarwal","year":"1991","unstructured":"Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding k points with minimum diameter and related problems. Journal of Algorithms\u00a012(1), 38\u201356 (1991)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02574012","volume":"11","author":"D. Eppstein","year":"1994","unstructured":"Eppstein, D., Erickson, J.: Iterated nearest neighbors and finding minimal polytopes. Discrete & Computational Geometry\u00a011(1), 321\u2013350 (1994)","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0020-0190(97)00212-3","volume":"65","author":"M. Segal","year":"1998","unstructured":"Segal, M., Kedem, K.: Enclosing k points in the smallest axis parallel rectangle. Information Processing Letters\u00a065(2), 95\u201399 (1998)","journal-title":"Information Processing Letters"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-21931-3_7","volume-title":"Computational Science and Its Applications - ICCSA 2011","author":"P.R.S. Mahapatra","year":"2011","unstructured":"Mahapatra, P.R.S., Karmakar, A., Das, S., Goswami, P.P.: k-enclosing axis-parallel square. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2011, Part III. LNCS, vol.\u00a06784, pp. 84\u201393. Springer, Heidelberg (2011)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-34475-6_45","volume-title":"Neural Information Processing","author":"S. Pang","year":"2012","unstructured":"Pang, S., Liu, F., Kadobayashi, Y., Ban, T., Inoue, D.: Training minimum enclosing balls for cross tasks knowledge transfer. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds.) ICONIP 2012, Part I. LNCS, vol.\u00a07663, pp. 375\u2013382. Springer, Heidelberg (2012)"},{"key":"13_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56082-8","volume-title":"Facility Location: Applications and Theory","author":"Z. Drezner","year":"2002","unstructured":"Drezner, Z., Hamacher, H.W.: Facility Location: Applications and Theory. Springer, Berlin (2002)"},{"issue":"8","key":"13_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0898-1221(95)00029-X","volume":"29","author":"S.C. Nandy","year":"1995","unstructured":"Nandy, S.C., Bhattacharya, B.B.: A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids. Computers & Mathematics with Applications\u00a029(8), 45\u201361 (1995)","journal-title":"Computers & Mathematics with Applications"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.comgeo.2012.09.007","volume":"46","author":"M. De","year":"2013","unstructured":"De, M., Maheshwari, A., Nandy, S.C., Smid, M.H.M.: An in-place min-max priority search tree. Computational Geometry\u00a046(3), 310\u2013327 (2013)","journal-title":"Computational Geometry"},{"key":"13_CR10","unstructured":"Liu, F., Narayanan, A.: Roundabout collision avoidance for multiple robots based on minimum enclosing rectangle (demonstration). In: AAMAS, pp. 1375\u20131376 (May 2013)"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.gaitpost.2012.03.021","volume":"36","author":"A.H. Olivier","year":"2012","unstructured":"Olivier, A.H., Marin, A., Gr\u00e9tual, A., Pettr\u00e9, J.: Minimal predicted distance: A common metric for collision avoidance during pairwise interactions between walkers. Gait & Posture\u00a036(3), 399\u2013404 (2012)","journal-title":"Gait & Posture"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1080\/10255842.2012.713628","volume":"15","author":"A.H. Olivier","year":"2012","unstructured":"Olivier, A.H., Marin, A., Gr\u00e9tual, A., Pettr\u00e9, J.: Minimal predicted distance: A kinematic cue to investigate collision avoidance between walkers. Computer Methods in Biomechanics and Biomedical Engineering\u00a015(1), 240\u2013242 (2012)","journal-title":"Computer Methods in Biomechanics and Biomedical Engineering"},{"key":"13_CR13","unstructured":"Liu, F., Narayanan, A., Bai, Q.: Effective methods for generating collision free paths for multiple robots based on collision type (demonstration). In: AAMAS, pp. 1459\u20131460 (June 2012)"},{"key":"13_CR14","unstructured":"Wikipedia: Autonomous car (May 2013)"},{"key":"13_CR15","unstructured":"Spectrum, I.: How google\u2019s self-driving car works (October 2011)"},{"issue":"2-3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0921-8890(02)00256-7","volume":"41","author":"M. Bennewitz","year":"2002","unstructured":"Bennewitz, M., Burgard, W., Thrun, S.: Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots. Robotics and Autonomous Systems\u00a041(2-3), 89\u201399 (2002)","journal-title":"Robotics and Autonomous Systems"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"van den Berg, J., Snoeyink, J., Lin, M., Manocha, D.: Centralized path planning for multiple robots: Optimal decoupling into sequential plans. In: RSS (July 2009)","DOI":"10.15607\/RSS.2009.V.018"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Sharon, G., Stern, R., Felner, A., Sturtevant, N.: Conflict-based search for optimal multi-agent path finding. In: AAAI, pp. 563\u2013569 (June 2012)","DOI":"10.1609\/aaai.v26i1.8140"},{"issue":"3","key":"13_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10514-011-9267-7","volume":"32","author":"E. Lalish","year":"2012","unstructured":"Lalish, E., Morgansen, K.A.: Distributed reactive collision avoidance. Autonomous Robots\u00a032(3), 207\u2013226 (2012)","journal-title":"Autonomous Robots"},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.robot.2009.09.003","volume":"58","author":"I. \u0160krjanc","year":"2010","unstructured":"\u0160krjanc, I., Klan\u010dar, G.: Optimal cooperative collision avoidance between multiple robots based on bernstein-b\u00e9zier curves. Robotics and Autonomous Systems\u00a058(1), 1\u20139 (2010)","journal-title":"Robotics and Autonomous Systems"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"van den Berg, J., Guy, S.J., Lin, M.C., Manocha, D.: Reciprocal n-body collision avoidance. In: ISRR, pp. 3\u201319 (August 2009)","DOI":"10.1007\/978-3-642-19457-3_1"},{"issue":"4","key":"13_CR22","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1109\/TRO.2011.2120810","volume":"27","author":"J. Snape","year":"2011","unstructured":"Snape, J., van den Berg, J., Guy, S.J., Manocha, D.: The hybrid reciprocal velocity obstacle. IEEE Transactions on Robotics\u00a027(4), 696\u2013706 (2011)","journal-title":"IEEE Transactions on Robotics"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"van Toll, W., Cook IV, A.F., Geraerts, R.: Navigation meshes for realistic multi-layered environments. In: IROS, pp. 3526\u20133532 (September 2011)","DOI":"10.1109\/IROS.2011.6048397"},{"key":"13_CR24","unstructured":"Kato, S., Nishiyama, S., Takeno, J.: Coordinating mobile robots by applying traffic rules. In: IROS, pp. 1535\u20131541 (July 1992)"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-642-05089-3_35","volume-title":"FM 2009: Formal Methods","author":"A. Platzer","year":"2009","unstructured":"Platzer, A., Clarke, E.M.: Formal verification of curved flight collision avoidance maneuvers: A case study. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 547\u2013562. Springer, Heidelberg (2009)"},{"issue":"10","key":"13_CR26","doi-asserted-by":"publisher","first-page":"697","DOI":"10.2307\/2323537","volume":"90","author":"W.S. Massey","year":"1983","unstructured":"Massey, W.S.: Cross products of vectors in higher dimensional euclidean spaces. The American Mathematical Monthly\u00a090(10), 697\u2013701 (1983)","journal-title":"The American Mathematical Monthly"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"van den Berg, J., Lin, M., Manocha, D.: Reciprocal velocity obstacles for real-time multi-agent navigation. In: ICRA, pp. 1928\u20131935 (May 2008)","DOI":"10.1109\/ROBOT.2008.4543489"}],"container-title":["Lecture Notes in Computer Science","PRIMA 2013: Principles and Practice of Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-44927-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T20:57:16Z","timestamp":1688677036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-44927-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642449260","9783642449277"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-44927-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}