{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T09:52:40Z","timestamp":1718445160312},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T00:00:00Z","timestamp":1380067200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Robot Syst"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10846-013-9886-7","type":"journal-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T02:25:26Z","timestamp":1380075926000},"page":"243-270","source":"Crossref","is-referenced-by-count":5,"title":["Towards a Trajectory Planning Concept: Augmenting Path Planning Methods by Considering Speed Limit Constraints"],"prefix":"10.1007","volume":"75","author":[{"given":"Luk\u00e1\u0161","family":"Chrpa","sequence":"first","affiliation":[]},{"given":"Hugh","family":"Osborne","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"9886_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadzadeh, A., Motee, N., Jadbabaie, A., Pappas, G.J.: Multi-vehicle path planning in dynamically changing environments. In: Proceedings of ICRA, pp.\u00a02449\u20132454 (2009)","DOI":"10.1109\/ROBOT.2009.5152520"},{"issue":"2\u20134","key":"9886_CR2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01891837","volume":"10","author":"J Barraquand","year":"1993","unstructured":"Barraquand, J., Latombe, J.C.: Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles. Algorithmica 10(2\u20134), 121\u2013155 (1993)","journal-title":"Algorithmica"},{"key":"9886_CR3","first-page":"7","volume":"1","author":"A Botea","year":"2004","unstructured":"Botea, A., M\u00fcller, M., Schaeffer, J.: Near optimal hierarchical path-finding. JOGD 1, 7\u201328 (2004)","journal-title":"JOGD"},{"issue":"1","key":"9886_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1147\/sj.41.0025","volume":"4","author":"J Bresenham","year":"1965","unstructured":"Bresenham, J.: Algorithm for computer control of a digital plotter. IBM Syst. J. 4(1), 25\u201330 (1965)","journal-title":"IBM Syst. J."},{"key":"9886_CR5","unstructured":"Cheng, P., LaValle, S.M.: Resolution complete rapidly-exploring random trees. In: Proceedings of ICRA, pp.\u00a0267\u2013272 (2002)"},{"key":"9886_CR6","unstructured":"Choset, H., Lynch, K.M., Hutchinson, S., Kantor, G.A., Burgard, W., Kavraki, L.E., Thrun, S.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press, Cambridge (2005)"},{"key":"9886_CR7","unstructured":"Chrpa, L.: Trajectory planning on grids: Considering speed limit constraints. In: Proceedings of SCAI, pp.\u00a060\u201369. IOS press, Amsterdam (2011)"},{"key":"9886_CR8","unstructured":"Chrpa, L., Komenda, A.: Smoothed hex-grid trajectory planning using helicopter dynamics. In: Proceedings of International Conference on Agents and Artificial Intelligence (ICAART), vol.\u00a01, pp.\u00a0629\u2013632 (2011)"},{"key":"9886_CR9","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1613\/jair.2994","volume":"39","author":"K Daniel","year":"2010","unstructured":"Daniel, K., Nash, A., Koenig, S., Felner, A.: Theta*: Any-angle path planning on grids. J. Artif. Intell. Res. (JAIR) 39, 533\u2013579 (2010)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"9886_CR10","unstructured":"Demyen, D., Buro, M.: Efficient triangulation-based pathfinding. In: Proceedings of AAAI (2006)"},{"key":"9886_CR11","doi-asserted-by":"crossref","unstructured":"Ferguson, D., Howard, T.M., Likhachev, M.: Motion planning in urban environments. In: The DARPA Urban Challenge, pp.\u00a061\u201389 (2009)","DOI":"10.1007\/978-3-642-03991-1_2"},{"issue":"2","key":"9886_CR12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/rob.20109","volume":"23","author":"D Ferguson","year":"2006","unstructured":"Ferguson, D., Stentz, A.: Using interpolation to improve path planning: the field d* algorithm. J. Field Robot. 23(2), 79\u2013101 (2006)","journal-title":"J. Field Robot."},{"key":"9886_CR13","doi-asserted-by":"crossref","unstructured":"Ghallab, M., Nau, D., Traverso, P.: Automated Planning, Theory and Practice. Morgan Kaufmann Publishers, San Mateo (2004)","DOI":"10.1016\/B978-155860856-6\/50020-X"},{"issue":"2","key":"9886_CR14","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."},{"issue":"2","key":"9886_CR15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1177\/0278364906075328","volume":"26","author":"TM Howard","year":"2007","unstructured":"Howard, T.M., Kelly, A.: Optimal rough terrain trajectory generation for wheeled mobile robots. Int. J. Robot. Res. 26(2), 141\u2013166 (2007)","journal-title":"Int. J. Robot. Res."},{"key":"9886_CR16","doi-asserted-by":"crossref","unstructured":"Karaman, S., Walter, M.R., Perez, A., Frazzoli, E., Teller, S.J.: Anytime motion planning using the rrt*. In: Proceedings of ICRA, pp.\u00a01478\u20131483 (2011)","DOI":"10.1109\/ICRA.2011.5980479"},{"key":"9886_CR17","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"Kavraki, L.E., Svestka, P., Kavraki, L.E., Latombe, J.C., Overmars, M.H.: 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":"9886_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"JC Latombe","year":"1991","unstructured":"Latombe, J.C.: Robot Motion Planning. Kluwer Academic Publishers, Norwell (1991)"},{"issue":"14","key":"9886_CR19","doi-asserted-by":"crossref","first-page":"1613","DOI":"10.1016\/j.artint.2007.11.009","volume":"172","author":"M Likhachev","year":"2008","unstructured":"Likhachev, M., Ferguson, D., Gordon, G.J., Stentz, A., Thrun, S.: Anytime search in dynamic graphs. Artif. Intell. 172(14), 1613\u20131643 (2008)","journal-title":"Artif. Intell."},{"issue":"10","key":"9886_CR20","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. Communun. ACM 22(10), 560\u2013570 (1979)","journal-title":"Communun. ACM"},{"key":"9886_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69897-2","volume-title":"Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness","author":"K Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. Springer-Verlag, Heidelber (1984)"},{"key":"9886_CR22","doi-asserted-by":"crossref","unstructured":"Narayanan, V., Phillips, M., Likhachev, M.: Anytime safe interval path planning for dynamic environments. In: Proceedings of IROS, pp.\u00a04708\u20134715 (2012)","DOI":"10.1109\/IROS.2012.6386191"},{"key":"9886_CR23","unstructured":"Nash, A., Daniel, K., Koenig, S., Felner, A.: Theta*: Any-angle path planning on grids. In: Proceedings of AAAI, pp.\u00a01177\u20131183 (2007)"},{"key":"9886_CR24","unstructured":"Nash, A., Koenig, S., Likhachev, M.: Incremental phi*: Incremental any-angle path planning on grids. In: Proceedings of IJCAI, pp.\u00a01824\u20131830 (2009)"},{"key":"9886_CR25","doi-asserted-by":"crossref","unstructured":"Nash, A., Koenig, S., Tovey, C.A.: Lazy theta*: any-angle path planning and path length analysis in 3d. In:\u00a0AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7566"},{"key":"9886_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804120","volume-title":"Computational Geometry in C","author":"J O\u2019Rourke","year":"1998","unstructured":"O\u2019Rourke, J.: Computational Geometry in C. Cambridge University Press, Cambridge (1998)"},{"key":"9886_CR27","doi-asserted-by":"crossref","unstructured":"Phillips, M., Likhachev, M.: Sipp: Safe interval path planning for dynamic environments. In: Proceedings of ICRA, pp.\u00a05628\u20135635 (2011)","DOI":"10.1109\/ICRA.2011.5980306"},{"issue":"3","key":"9886_CR28","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1002\/rob.20285","volume":"26","author":"M Pivtoraiko","year":"2009","unstructured":"Pivtoraiko, M., Knepper, R.A., Kelly, A.: Differentially constrained mobile robot motion planning in state lattices. J. Field Robot. 26(3), 308\u2013333 (2009)","journal-title":"J. Field Robot."},{"key":"9886_CR29","unstructured":"Scheuer, A., Fraichard, T.: Continuous-curvature path planning for car-like vehicles. In: Proceedings of the IEEE-RSJ International Conference on Intelligent Robots and Systems, pp.\u00a0997\u20131003 (1998)"},{"key":"9886_CR30","doi-asserted-by":"crossref","unstructured":"\u0160i\u0161l\u00e1k, D., P\u011bchou\u010dek, M., Volf, P., Pavl\u00ed\u010dek, D., Samek, J., Ma\u0159\u00edk, V., Losiewicz, P.: Defense Industry Applications of Autonomous Agents and Multi-Agent Systems, chap. AGENTFLY: Towards Multi-Agent Technology in Free Flight Air Traffic Control, pp.\u00a073\u201397. Birkhauser Verlag (2008)","DOI":"10.1007\/978-3-7643-8571-2_5"},{"issue":"7","key":"9886_CR31","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1163\/016918610X496928","volume":"24","author":"W Wang","year":"2010","unstructured":"Wang, W., Xu, X., Li, Y., Song, J., He, H.: Triple rrts: an effective method for path planning in narrow passages. Adv. Robot. 24(7), 943\u2013962 (2010)","journal-title":"Adv. Robot."},{"key":"9886_CR32","doi-asserted-by":"crossref","unstructured":"Wzorek, M., Doherty, P.: Reconfigurable path planning for an autonomous unmanned aerial vehicle. In: Proceedings of ICAPS, pp.\u00a0438\u2013441 (2006)","DOI":"10.1109\/ICHIT.2006.253618"},{"key":"9886_CR33","doi-asserted-by":"crossref","unstructured":"Yap, P.: Grid-based path-finding. In: Proceedings of Canadian Conference on AI, pp.\u00a044\u201355 (2002)","DOI":"10.1007\/3-540-47922-8_4"}],"container-title":["Journal of Intelligent & Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-013-9886-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10846-013-9886-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-013-9886-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T20:40:03Z","timestamp":1688503203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10846-013-9886-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,25]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["9886"],"URL":"https:\/\/doi.org\/10.1007\/s10846-013-9886-7","relation":{},"ISSN":["0921-0296","1573-0409"],"issn-type":[{"value":"0921-0296","type":"print"},{"value":"1573-0409","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,25]]}}}