{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:50Z","timestamp":1740098930501,"version":"3.37.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319664705"},{"type":"electronic","value":"9783319664712"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66471-2_1","type":"book-chapter","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T15:25:30Z","timestamp":1502378730000},"page":"1-10","source":"Crossref","is-referenced-by-count":2,"title":["Applying MAPP Algorithm for Cooperative Path Finding in Urban Environments"],"prefix":"10.1007","author":[{"given":"Anton","family":"Andreychuk","sequence":"first","affiliation":[]},{"given":"Konstantin","family":"Yakovlev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,11]]},"reference":[{"key":"1_CR1","unstructured":"Koenig, S., Likhachev, M.: D* lite. In: Proceedings of the AAAI Conference of Artificial Intelligence (AAAI), pp. 476\u2013483 (2002)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Magid, E., Keren, D., Rivlin, E., Yavneh, I.: Spline-based robot navigation. In: Proceedings of 2006 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), Beijing, China, 9\u201315 October 2006, pp. 2296\u20132301 (2006)","DOI":"10.1109\/IROS.2006.282635"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-319-24489-1_16","volume-title":"KI 2015: Advances in Artificial Intelligence","author":"K Yakovlev","year":"2015","unstructured":"Yakovlev, K., Baskin, E., Hramoin, I.: Grid-based angle-constrained path planning. In: H\u00f6lldobler, S., Kr\u00f6tzsch, M., Pe\u00f1aloza, R., Rudolph, S. (eds.) KI 2015. LNCS, vol. 9324, pp. 208\u2013221. Springer, Cham (2015). doi: 10.1007\/978-3-319-24489-1_16"},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1613\/jair.5007","volume":"56","author":"D Harabor","year":"2016","unstructured":"Harabor, D., Grastien, A., \u00d6z, D., Aksakalli, V.: Optimal any-angle pathfinding in practice. J. Artif. Intell. Res. (JAIR) 56, 89\u2013118 (2016)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"4","key":"1_CR5","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1177\/027836498400300405","volume":"3","author":"J Hopcroft","year":"1984","unstructured":"Hopcroft, J., Schwartz, J., Sharir, M.: On the complexity of motion planning for multiple independent objects; PSPACE-hardness of the \u201cwarehouseman\u2019s problem\u201d. Int. J. Robot. Res. 3(4), 76\u201388 (1984)","journal-title":"Int. J. Robot. Res."},{"issue":"10","key":"1_CR6","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T Lozano-P\u00e9rez","year":"1979","unstructured":"Lozano-P\u00e9rez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM 22(10), 560\u2013570 (1979)","journal-title":"Commun. ACM"},{"issue":"2","key":"1_CR7","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/MRA.2008.921540","volume":"15","author":"P Bhattacharya","year":"2008","unstructured":"Bhattacharya, P., Gavrilova, M.L.: Roadmap-based path planning - using the Voronoi diagram for a clearance-based shortest path. IEEE Robot. Autom. Mag. 15(2), 58\u201366 (2008)","journal-title":"IEEE Robot. Autom. Mag."},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-16958-8_22","volume-title":"Motion in Games","author":"M Kallmann","year":"2010","unstructured":"Kallmann, M.: Navigation queries from triangular meshes. In: Boulic, R., Chrysanthou, Y., Komura, T. (eds.) MIG 2010. LNCS, vol. 6459, pp. 230\u2013241. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-16958-8_22"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-47922-8_4","volume-title":"Advances in Artificial Intelligence","author":"P Yap","year":"2002","unstructured":"Yap, P.: Grid-based path-finding. In: Cohen, R., Spencer, B. (eds.) AI 2002. LNCS, vol. 2338, pp. 44\u201355. Springer, Heidelberg (2002). doi: 10.1007\/3-540-47922-8_4"},{"issue":"6","key":"1_CR10","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/2.30720","volume":"22","author":"A Elfes","year":"1989","unstructured":"Elfes, A.: Using occupancy grids for mobile robot perception and navigation. Computer 22(6), 46\u201357 (1989)","journal-title":"Computer"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Standley, T.: Finding optimal solutions to cooperative pathfinding problems. In: Proceedings of The 24th AAAI Conference on Artificial Intelligence (AAAI-2010), pp. 173\u2013178 (2010)","DOI":"10.1609\/aaai.v24i1.7564"},{"issue":"2","key":"1_CR12","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P Hart","year":"1968","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"1_CR13","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","volume":"219","author":"G Sharon","year":"2015","unstructured":"Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40\u201366 (2015)","journal-title":"Artif. Intell."},{"key":"1_CR14","unstructured":"Boyarski, E., Felner, A., Stern, R., Sharon, F., Tolpin, D., Betzalel, D., Shimony, S.: ICBS: improved conflict-based search algorithm for multi-agent pathfinding. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI-2015), pp. 740\u2013746 (2015)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Wagner, G., Choset, H.: M*: a complete multirobot path planning algorithm with performance bounds. In: Proceedings of The 2011 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS-2011), pp. 3260\u20133267 (2011)","DOI":"10.1109\/IROS.2011.6095022"},{"key":"1_CR16","unstructured":"Standley, T., Korf, R.: Complete algorithms for cooperative pathfinding problems. In: Proceedings of The 22d International Joint Conference on Artificial Intelligence (IJCAI-2011), vol. 1, pp. 668\u2013673. AAAI Press (2011)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Barer, M., Sharon, G., Stern, R., Felner, A.: Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem. In: Proceedings of the 7th Annual Symposium on Combinatorial Search (SOCS-2014), pp. 19\u201327 (2014)","DOI":"10.1609\/socs.v5i1.18315"},{"key":"1_CR18","doi-asserted-by":"crossref","first-page":"1419","DOI":"10.1007\/BF01840371","volume":"2","author":"M Erdmann","year":"1987","unstructured":"Erdmann, M., Lozano-P\u00e9rez, T.: On multiple moving objects. Algorithmica 2, 1419\u20131424 (1987)","journal-title":"Algorithmica"},{"issue":"6","key":"1_CR19","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1109\/70.182671","volume":"8","author":"A Zelinsky","year":"1992","unstructured":"Zelinsky, A.: A mobile robot exploration algorithm. IEEE Trans. Robot. Autom. 8(6), 707\u2013717 (1992)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Silver, D.: Cooperative pathfinding. In: Proceedings of the 1st Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE-2005), pp. 117\u2013122 (2005)","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Bnaya, Z., Felner, A.: Conflict-oriented windowed hierarchical cooperative A $${^\\ast }$$ . In: Proceedings of the 2014 IEEE International Conference on Robotics and Automation (ICRA-2014), pp. 3743\u20133748 (2014)","DOI":"10.1109\/ICRA.2014.6907401"},{"key":"1_CR22","unstructured":"Wang, K.-H.C., Botea, A.: Tractable multi-agent path planning on grid maps. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-2009), pp. 1870\u20131875 (2009)"},{"issue":"3","key":"1_CR23","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1109\/TASE.2015.2445780","volume":"12","author":"M \u010c\u00e1p","year":"2015","unstructured":"\u010c\u00e1p, M., Nov\u00e1k, P., Kleiner, A., Seleck\u00fd, M.: Prioritized planning algorithms for trajectory coordination of multiple mobile robots. IEEE Trans. Autom. Sci. Eng. 12(3), 835\u2013849 (2015)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"1_CR24","first-page":"55","volume":"42","author":"K-HC Wang","year":"2011","unstructured":"Wang, K.-H.C., Botea, A.: MAPP: a scalable multi-agent path planning algorithm with tractability and completeness guarantees. J. Artif. Intell. Res. (JAIR) 42, 55\u201390 (2011)","journal-title":"J. Artif. Intell. Res. (JAIR)"}],"container-title":["Lecture Notes in Computer Science","Interactive Collaborative Robotics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66471-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T23:23:05Z","timestamp":1692919385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66471-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319664705","9783319664712"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66471-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}