{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T22:29:38Z","timestamp":1768084178903,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010221","name":"Higher Education Commision, Pakistan","doi-asserted-by":"publisher","award":["6025\/Federal\/NRPU\/R&D\/HEC\/2016"],"award-info":[{"award-number":["6025\/Federal\/NRPU\/R&D\/HEC\/2016"]}],"id":[{"id":"10.13039\/501100010221","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Robot"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s10514-020-09956-3","type":"journal-article","created":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T11:04:21Z","timestamp":1610017461000},"page":"209-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["LTA*: Local tangent based A* for optimal path planning"],"prefix":"10.1007","volume":"45","author":[{"given":"Muhammad Mateen","family":"Zafar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3525-1956","authenticated-orcid":false,"given":"Muhammad Latif","family":"Anjum","sequence":"additional","affiliation":[]},{"given":"Wajahat","family":"Hussain","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,7]]},"reference":[{"key":"9956_CR1","doi-asserted-by":"crossref","unstructured":"Adiyatov, O., & Varol, H. A. (2013). Rapidly-exploring random tree based memory efficient motion planning. In 2013 IEEE International Conference on Mechatronics and Automation (ICMA) (pp. 354\u2013359). IEEE.","DOI":"10.1109\/ICMA.2013.6617944"},{"key":"9956_CR2","doi-asserted-by":"crossref","unstructured":"Akgun, B., & Stilman, M. (2011). Sampling heuristics for optimal motion planning in high dimensions. In 2011 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS) (pp. 2640\u20132645). IEEE.","DOI":"10.1109\/IROS.2011.6095077"},{"key":"9956_CR3","doi-asserted-by":"crossref","unstructured":"Arslan, O., & Tsiotras, P. (2013). Use of relaxation methods in sampling-based algorithms for optimal motion planning. In 2013 IEEE International Conference on Robotics and Automation (ICRA) (pp. 2421\u20132428). IEEE.","DOI":"10.1109\/ICRA.2013.6630906"},{"issue":"3","key":"9956_CR4","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/0213031","volume":"13","author":"B Chazelle","year":"1984","unstructured":"Chazelle, B. (1984). Convex partitions of polyhedra: A lower bound and worst-case optimal algorithm. SIAM Journal on Computing, 13(3), 488\u2013507.","journal-title":"SIAM Journal on Computing"},{"key":"9956_CR5","doi-asserted-by":"crossref","unstructured":"Chazelle, B., & Dobkin, D. P. (1985). Optimal convex decompositions. In Machine Intelligence and pattern recognition (Vol. 2, pp. 63\u2013133). Elsevier.","DOI":"10.1016\/B978-0-444-87806-9.50009-8"},{"key":"9956_CR6","doi-asserted-by":"crossref","unstructured":"Choudhury, S., Gammell, J. D., Barfoot, T. D., Srinivasa, S. S., & Scherer, S. (2016). Regionally accelerated batch informed trees (rabit*): A framework to integrate local information into optimal path planning. In 2016 IEEE International Conference on Robotics and Automation (ICRA) (pp. 4207\u20134214). IEEE.","DOI":"10.1109\/ICRA.2016.7487615"},{"issue":"2","key":"9956_CR7","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1109\/TASE.2015.2487881","volume":"13","author":"D Devaurs","year":"2016","unstructured":"Devaurs, D., Sim\u00e9on, T., & Cort\u00e9s, J. (2016). Optimal path planning in complex cost spaces with sampling-based algorithms. IEEE Transactions on Automation Science and Engineering, 13(2), 415\u2013424.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"1","key":"9956_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische mathematik, 1(1), 269\u2013271.","journal-title":"Numerische mathematik"},{"key":"9956_CR9","doi-asserted-by":"crossref","unstructured":"Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2014). Informed rrt*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic. In 2014 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS 2014) (pp. 2997\u20133004). IEEE.","DOI":"10.1109\/IROS.2014.6942976"},{"key":"9956_CR10","doi-asserted-by":"crossref","unstructured":"Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2015). Batch informed trees (bit*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs. In 2015 IEEE International Conference on Robotics and Automation (ICRA) (pp. 3067\u20133074). IEEE.","DOI":"10.1109\/ICRA.2015.7139620"},{"issue":"2","key":"9956_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02770871","volume":"17","author":"SK Ghosh","year":"1997","unstructured":"Ghosh, S. K. (1997). On recognizing and characterizing visibility graphs of simple polygons. Discrete & Computational Geometry, 17(2), 143\u2013162.","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"9956_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100\u2013107.","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"9956_CR13","doi-asserted-by":"publisher","unstructured":"Hauer, F., & Tsiotras, P. (2017). Deformable rapidly-exploring random trees. In Proceedings of Robotics: Science and Systems, Cambridge, Massachusetts. https:\/\/doi.org\/10.15607\/RSS.2017.XIII.008.","DOI":"10.15607\/RSS.2017.XIII.008"},{"key":"9956_CR14","doi-asserted-by":"crossref","unstructured":"Huang, H. P., & Chung, S. Y. (2004). Dynamic visibility graph for path planning. In 2004 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS 2004). Proceedings (Vol. 3, pp. 2813\u20132818). IEEE.","DOI":"10.1109\/IROS.2004.1389835"},{"issue":"2","key":"9956_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1026449201026","volume":"1","author":"T Ishida","year":"1998","unstructured":"Ishida, T. (1998). Real-time search for autonomous agents and multiagent systems. Autonomous Agents and Multi-Agent Systems, 1(2), 139\u2013167.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9956_CR16","doi-asserted-by":"publisher","unstructured":"Janson, L., Hu, T., & Pavone, M. (2018). Safe motion planning in unknown environments: Optimality benchmarks and tractable policies. In Proceedings of Robotics: Science and Systems, Pittsburgh, Pennsylvania. https:\/\/doi.org\/10.15607\/RSS.2018.XIV.061.","DOI":"10.15607\/RSS.2018.XIV.061"},{"key":"9956_CR17","doi-asserted-by":"crossref","unstructured":"Karaman, S., & Frazzoli, E. (2010). Optimal kinodynamic motion planning using incremental sampling-based methods. In 2010 49th IEEE Conference on Decision and Control (CDC) (pp. 7681\u20137687). IEEE.","DOI":"10.1109\/CDC.2010.5717430"},{"issue":"7","key":"9956_CR18","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"Karaman, S., & Frazzoli, E. (2011). Sampling-based algorithms for optimal motion planning. The International Journal of Robotics Research, 30(7), 846\u2013894.","journal-title":"The International Journal of Robotics Research"},{"issue":"4","key":"9956_CR19","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"Kavraki, L. E., Svestka, P., Latombe, J. C., & Overmars, M. H. (1996). Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, 12(4), 566\u2013580.","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"1","key":"9956_CR20","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1177\/027836498600500106","volume":"5","author":"O Khatib","year":"1986","unstructured":"Khatib, O. (1986). Real-time obstacle avoidance for manipulators and mobile robots. The International Journal Of Robotics Research, 5(1), 90\u201398.","journal-title":"The International Journal Of Robotics Research"},{"issue":"3","key":"9956_CR21","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1109\/70.143352","volume":"8","author":"JO Kim","year":"1992","unstructured":"Kim, J. O., & Khosla, P. K. (1992). Real-time obstacle avoidance using harmonic potential functions. IEEE Transactions on Robotics and Automation, 8(3), 338\u2013349.","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"9956_CR22","doi-asserted-by":"crossref","unstructured":"Koenig, S., & Likhachev, M. (2002). Improved fast replanning for robot navigation in unknown terrain. In IEEE International Conference on Robotics and Automation, 2002. Proceedings. ICRA39;02 (Vol. 1, pp. 968\u2013975). IEEE.","DOI":"10.1109\/ROBOT.2002.1013481"},{"key":"9956_CR23","doi-asserted-by":"crossref","unstructured":"Koenig, S., & Likhachev, M. (2006). Real-time adaptive A. In Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (pp. 281\u2013288). ACM.","DOI":"10.1145\/1160633.1160682"},{"issue":"1\u20132","key":"9956_CR24","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.artint.2003.12.001","volume":"155","author":"S Koenig","year":"2004","unstructured":"Koenig, S., Likhachev, M., & Furcy, D. (2004). Lifelong planning A. Artificial Intelligence, 155(1\u20132), 93\u2013146.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9956_CR25","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"RE Korf","year":"1985","unstructured":"Korf, R. E. (1985). Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1), 97\u2013109.","journal-title":"Artificial Intelligence"},{"issue":"2\u20133","key":"9956_CR26","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","volume":"42","author":"RE Korf","year":"1990","unstructured":"Korf, R. E. (1990). Real-time heuristic search. Artificial Intelligence, 42(2\u20133), 189\u2013211.","journal-title":"Artificial Intelligence"},{"key":"9956_CR27","unstructured":"LaValle, S. M. (1998). Rapidly-exploring random trees: A new tool for path planning. Report No. TR 98-11, Computer Science Department, Iowa State University. Available at http:\/\/janowiec.cs.iastate.edu\/papers\/rrt.ps."},{"issue":"4","key":"9956_CR28","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1177\/027836499201100409","volume":"11","author":"YH Liu","year":"1992","unstructured":"Liu, Y. H., & Arimoto, S. (1992). Path planning using a tangent graph for mobile robots among polygonal and curved obstacles: Communication. The International Journal of Robotics Research, 11(4), 376\u2013382.","journal-title":"The International Journal of Robotics Research"},{"issue":"10","key":"9956_CR29","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T Lozano-Prez","year":"1979","unstructured":"Lozano-Prez, T., & Wesley, M. A. (1979). An algorithm for planning collision-free paths among polyhedral obstacles. Communications of the ACM, 22(10), 560\u2013570.","journal-title":"Communications of the ACM"},{"issue":"13","key":"9956_CR30","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.1177\/0278364914547786","volume":"33","author":"SM Persson","year":"2014","unstructured":"Persson, S. M., & Sharf, I. (2014). Sampling-based A* algorithm for robot path-planning. The International Journal of Robotics Research, 33(13), 1683\u20131708.","journal-title":"The International Journal of Robotics Research"},{"key":"9956_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.robot.2015.02.007","volume":"68","author":"AH Qureshi","year":"2015","unstructured":"Qureshi, A. H., & Ayaz, Y. (2015). Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments. Robotics and Autonomous Systems, 68, 1\u201311.","journal-title":"Robotics and Autonomous Systems"},{"issue":"12","key":"9956_CR32","doi-asserted-by":"publisher","first-page":"405","DOI":"10.5772\/56809","volume":"10","author":"A Rahman","year":"2013","unstructured":"Rahman, A., & Al-Jumaily, A. (2013). Design and development of a bilateral therapeutic hand device for stroke rehabilitation. International Journal of Advanced Robotic Systems, 10(12), 405.","journal-title":"International Journal of Advanced Robotic Systems"},{"key":"9956_CR33","first-page":"1","volume":"92","author":"SJ Russell","year":"1992","unstructured":"Russell, S. J. (1992). Efficient memory-bounded search methods. ECAI, 92, 1\u20135.","journal-title":"ECAI"},{"key":"9956_CR34","doi-asserted-by":"crossref","unstructured":"Shi, C., Zhang, M., & Peng, J. (2007). Harmonic potential field method for autonomous ship navigation. In 7th International Conference on ITS Telecommunications. ITST39;07 (pp. 1\u2013 6). IEEE.","DOI":"10.1109\/ITST.2007.4295916"},{"key":"9956_CR35","doi-asserted-by":"crossref","unstructured":"Stentz, A. (1994). Optimal and efficient path planning for partially-known environments. In 1994 IEEE International Conference on Robotics and Automation. Proceedings (pp. 3310\u20133317). IEEE.","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"9956_CR36","unstructured":"Stern, R., Sturtevant, N. R., Felner, A., Koenig, S., Ma, H., Walker, T. T., et al. (2019). Multi-agent pathfinding: Definitions, variants, and benchmarks. In Symposium on Combinatorial Search (SoCS), pp. 151\u2013158."},{"key":"9956_CR37","first-page":"2391","volume":"7","author":"X Sun","year":"2007","unstructured":"Sun, X., & Koenig, S. (2007). The fringe-saving A* search algorithm\u2014A feasibility study. IJCAI, 7, 2391\u20132397.","journal-title":"IJCAI"},{"key":"9956_CR38","unstructured":"Tang, L., Dian, S., Gu, G., Zhou, K., Wang, S., & Feng, X. (2010). A novel potential field method for obstacle avoidance and path planning of mobile robot. In 2010 3rd IEEE International Conference on Computer Science and Information Technology (ICCSIT) (Vol. 9, pp. 633\u2013637). IEEE."},{"issue":"3","key":"9956_CR39","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1109\/TSMCB.2010.2089619","volume":"41","author":"SG Vadlamudi","year":"2011","unstructured":"Vadlamudi, S. G., Aine, S., & Chakrabarti, P. P. (2011). Memory-bounded anytime heuristic-search algorithm. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 41(3), 725\u2013735.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)"},{"key":"9956_CR40","doi-asserted-by":"crossref","unstructured":"Webb, D.J., & van den Berg, J. (2013). Kinodynamic RRT*: Asymptotically optimal motion planning for robots with linear dynamics. In 2013 IEEE International Conference on Robotics and Automation (ICRA) (pp. 5054\u20135061). IEEE.","DOI":"10.1109\/ICRA.2013.6631299"},{"key":"9956_CR41","unstructured":"Yoshizumi, T., Miura, T., & Ishida, T. (2000). A* with partial expansion for large branching factor problems. In AAAI\/IAAI, pp. 923\u2013 929."}],"container-title":["Autonomous Robots"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-020-09956-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10514-020-09956-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-020-09956-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T11:50:52Z","timestamp":1614599452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10514-020-09956-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,7]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["9956"],"URL":"https:\/\/doi.org\/10.1007\/s10514-020-09956-3","relation":{},"ISSN":["0929-5593","1573-7527"],"issn-type":[{"value":"0929-5593","type":"print"},{"value":"1573-7527","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,7]]},"assertion":[{"value":"15 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}