{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T04:38:41Z","timestamp":1778560721716,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2017,12,11]],"date-time":"2017-12-11T00:00:00Z","timestamp":1512950400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Robot Syst"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10846-017-0748-6","type":"journal-article","created":{"date-parts":[[2017,12,11]],"date-time":"2017-12-11T01:07:01Z","timestamp":1512954421000},"page":"425-444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["L* Algorithm\u2014A Linear Computational Complexity Graph Searching Algorithm for Path Planning"],"prefix":"10.1007","volume":"91","author":[{"given":"Adam","family":"Niewola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"Podsedkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,11]]},"reference":[{"key":"748_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach, 594 p","author":"S Arrora","year":"2009","unstructured":"Arrora, S., Barak, B.: Computational Complexity: A Modern Approach, 594 p. Cambridge University Press, New York (2009)"},{"key":"748_CR2","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Lagogiannis, G., Trajan, R.: Strict fibonacci heaps. In: Proceedings of the 44th Symposium on Theory of Computing, p. 1177 (2012)","DOI":"10.1145\/2213977.2214082"},{"key":"748_CR3","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., Fernel, A.: Theta*, any-angle path planning on grids. J. Artif. Intell. Res. 39, 533\u2013579 (2010)","journal-title":"J. Artif. Intell. Res."},{"issue":"11","key":"748_CR4","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/363269.363610","volume":"12","author":"RB Dial","year":"1969","unstructured":"Dial, R.B.: Algorithm 360: shortest-path forest with topological ordering. Commun. ACM 12(11), 632\u2013633 (1969)","journal-title":"Commun. ACM"},{"key":"748_CR5","volume-title":"Heuristic Search\u2014Theory and Applications","author":"S Edelkamp","year":"2012","unstructured":"Edelkamp, S., Schroedl, S.: Heuristic Search\u2014Theory and Applications. Morgan Kaufmann, San Mateo (2012)"},{"issue":"3","key":"748_CR6","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Trajan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach. 34(3), 596\u2013615 (1987)","journal-title":"J. Assoc. Comput. Mach."},{"key":"748_CR7","unstructured":"Hatem, M., Burns, E., Ruml, W.: Faster Problem Solving in Java with Heuristic Search. IBM Developer Works (2013)"},{"issue":"2","key":"748_CR8","doi-asserted-by":"crossref","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.: A formal basis for the heuristic determination f minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"748_CR9","doi-asserted-by":"crossref","unstructured":"Hernandez, C., Baier, J.A., Asin, R.: Making A* run faster than D*-lite for path-planning in partially known terrain. In: Twenty-Fourth International Conference on Automated Planning and Scheduling (2014)","DOI":"10.1609\/icaps.v24i1.13675"},{"issue":"1","key":"748_CR10","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1177\/027836498600500106","volume":"5","author":"O Khatib","year":"1986","unstructured":"Khatib, O.: Real-time obstacle avoidance for manipulators and mobile robots. Int. J. Robot. Res. 5(1), 90\u201398 (1986)","journal-title":"Int. J. Robot. Res."},{"key":"748_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-49487-6","volume-title":"Algorithm Engineering: Selected Results and Surveys","author":"L Kliemann","year":"2016","unstructured":"Kliemann, L., Sanders, P.: Algorithm Engineering: Selected Results and Surveys. Springer International Publishing, Basel (2016)"},{"issue":"1\u20132","key":"748_CR12","doi-asserted-by":"crossref","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.: Lifelong planning A*. Artif. Intell. 155(1\u20132), 93\u2013146 (2004)","journal-title":"Artif. Intell."},{"key":"748_CR13","unstructured":"Koenig, S., Likhachev, M.: D* Lite. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 476\u2013483 (2002)"},{"key":"748_CR14","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"J-C Latombe","year":"1991","unstructured":"Latombe, J.-C.: Robot Motion Planning, p. 651. Kluwer Academic Publisher, Dordrecht (1991)"},{"issue":"3","key":"748_CR15","first-page":"57","volume":"7","author":"A Niewola","year":"2013","unstructured":"Niewola, A.: Rough surface description system in 2,5d map for mobile robot navigation. J. Autom. Mob. Robot. Intell. Syst. 7(3), 57\u201363 (2013)","journal-title":"J. Autom. Mob. Robot. Intell. Syst."},{"key":"748_CR16","doi-asserted-by":"crossref","unstructured":"Niewola, A., Podsedkowski, L.: Nonholonomic mobile robot path planning with linear computational complexity graph searching algorithm. In: 2015 10th International Workshop on Robot Motion and Control (RoMoCo), pp. 217\u2013222 (2015)","DOI":"10.1109\/RoMoCo.2015.7219738"},{"key":"748_CR17","first-page":"476","volume-title":"Principles of Artificial Intelligence","author":"N Nilsson","year":"1980","unstructured":"Nilsson, N.: Principles of Artificial Intelligence, p. 476. Tioga Publishing Company, Pato Alto (1980)"},{"key":"748_CR18","doi-asserted-by":"crossref","unstructured":"Podsedkowski, L.: Path planner for nonholonomic mobile robot with fast replanning procedure. In: IEEE International Conference on Robotics and Automation, pp. 3588\u20133593 (1998)","DOI":"10.1109\/ROBOT.1998.681024"},{"key":"748_CR19","doi-asserted-by":"crossref","unstructured":"Stentz, A.: Optimal and efficient path planning for partially-known environment. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA \u201994), pp. 3310\u20133317 (1994)","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"748_CR20","unstructured":"Stentz, A.: The focussed D* algorithm for real-time replanning. The focussed D* algorithm for real-time replanning. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 1652\u20131659 (1995)"},{"issue":"2","key":"748_CR21","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/TCIAIG.2012.2197681","volume":"4","author":"NR Sturtevant","year":"2012","unstructured":"Sturtevant, N.R.: Benchmarks for grid-based pathfinding. IEEE Trans. Comput. Intell. AI Games 4(2), 144\u2013148 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"748_CR22","doi-asserted-by":"crossref","unstructured":"Nguyet, T.T.N., Hoai, T.V., Thi, N.A.: Some advanced techniques in reducing time for path planning based on visibility graph. In: 2011 Third International Conference on Knowledge and Systems Engineering (KSE), pp. 190\u2013194 (2011)","DOI":"10.1109\/KSE.2011.37"},{"key":"748_CR23","doi-asserted-by":"crossref","unstructured":"Ho, Y.-J., Li, J.-S.: Collision-free curvature-bounded smooth path planning using composite bezier curve based on voronoi diagram. In: 2009 IEEE International Symposium on Computational Intelligence in Robotics and Automation, pp. 463\u2013469 (2009)","DOI":"10.1109\/CIRA.2009.5423161"},{"key":"748_CR24","doi-asserted-by":"crossref","unstructured":"Zhiye, L., Xiong, C.: Path planning approach based on probabilistic roadmap for sensor based car-like robot in unknown environments. In: 2004 IEEE International Conference on Systems, Man and Cybernetics, pp. 2907\u20132912 (2004)","DOI":"10.1109\/ICSMC.2004.1400774"}],"container-title":["Journal of Intelligent & Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10846-017-0748-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-017-0748-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-017-0748-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T20:29:36Z","timestamp":1693340976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10846-017-0748-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,11]]},"references-count":24,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["748"],"URL":"https:\/\/doi.org\/10.1007\/s10846-017-0748-6","relation":{},"ISSN":["0921-0296","1573-0409"],"issn-type":[{"value":"0921-0296","type":"print"},{"value":"1573-0409","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,11]]}}}