{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:48:07Z","timestamp":1773154087777,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030667221","type":"print"},{"value":"9783030667238","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-66723-8_16","type":"book-chapter","created":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T13:36:54Z","timestamp":1612877814000},"page":"261-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hierarchical Multiobjective Shortest Path Problems"],"prefix":"10.1007","author":[{"given":"Konstantin","family":"Slutsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitry","family":"Yershov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tichakorn","family":"Wongpiromsarn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilio","family":"Frazzoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,9]]},"reference":[{"key":"16_CR1","unstructured":"Ben Ticha, H., Absi, N.: A solution method for the Multi-destination Bi-objectives Shortest Path Problem, July 2017"},{"key":"16_CR2","unstructured":"Castro, L.I.R., Chaudhari, P., Tumova, J., Karaman, S., Frazzoli, E., Rus, D.: Incremental sampling-based algorithm for minimum-violation motion planning. In: 52nd IEEE Conference on Decision and Control, pp. 3217\u20133224, December 2013"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Censi, A., Slutsky, K., Wongpiromsarn, T., Yershov, D., Pendleton, S., Fu, J., Frazzoli, E.: Liability, ethics, and culture-aware behavior specification using rulebooks. In: 2019 International Conference on Robotics and Automation (ICRA), pp. 8536\u20138542, May 2019","DOI":"10.1109\/ICRA.2019.8794364"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"de Lima Pinto, L., Bornstein, C.T., Maculan, N.: The tricriterion shortest path problem with at least two bottleneck objective functions. In: European Journal of Operational Research, vol. 198, no.\u00a02, pp. 387\u2013391, October 2009","DOI":"10.1016\/j.ejor.2008.09.036"},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"16_CR6","unstructured":"Edelkamp, S., Jabbar, S., Lluch-Lafuente, A.: Cost-algebraic heuristic search. In: Proceedings of the National Conference on Artificial Intelligence, vol. 3, pp. 1362\u20131367 (2005)"},{"issue":"11\u201312","key":"16_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-03991-1_2","volume":"56","author":"D Ferguson","year":"2009","unstructured":"Ferguson, D., Howard, T.M., Likhachev, M.: Motion planning in urban environments. Springer Tracts Adv. Robot. 56(11\u201312), 61\u201389 (2009)","journal-title":"Springer Tracts Adv. Robot."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Gandibleux, X., Beugnies, F., Randriamasy, S.: Martins\u2019 algorithm revisited for multi-objective shortest path problems with a MaxMin cost function, 4or, vol. 4, no. 1, pp. 47\u201359, March 2006","DOI":"10.1007\/s10288-005-0074-x"},{"issue":"17","key":"16_CR9","doi-asserted-by":"publisher","first-page":"3081","DOI":"10.1016\/j.comnet.2010.05.017","volume":"54","author":"RG Garroppo","year":"2010","unstructured":"Garroppo, R.G., Giordano, S., Tavanti, L.: A survey on multi-constrained optimal path computation: exact and approximate algorithms. Comput. Netw. 54(17), 3081\u20133107 (2010)","journal-title":"Comput. Netw."},{"issue":"4","key":"16_CR10","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1109\/TITS.2015.2498841","volume":"17","author":"D Gonz\u00e1lez","year":"2016","unstructured":"Gonz\u00e1lez, D., P\u00e9rez, J., Milan\u00e9s, V., Nashashibi, F.: A review of motion planning techniques for automated vehicles. IEEE Trans. Intell. Transport. Syst. 17(4), 1135\u20131145 (2016)","journal-title":"IEEE Trans. Intell. Transport. Syst."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Hansen, P.: Bicriterion Path Problems, pp. 109\u2013127 (1980)","DOI":"10.1007\/978-3-642-48782-8_9"},{"issue":"2","key":"16_CR12","doi-asserted-by":"publisher","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":"4\u20136","key":"16_CR13","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s00165-012-0245-4","volume":"24","author":"P H\u00f6fner","year":"2012","unstructured":"H\u00f6fner, P., M\u00f6ller, B.: Dijkstra, Floyd and Warshall meet Kleene. Form. Asp. Comput. 24(4\u20136), 459\u2013476 (2012)","journal-title":"Form. Asp. Comput."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Holte, R., Zilles, S.: On the optimal efficiency of cost-algebraic a*. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a033, pp. 2288\u20132295 (2019)","DOI":"10.1609\/aaai.v33i01.33012288"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"LaValle, S.M.: Planning algorithms. Cambridge University Press, vol. 9780521862, May 2006","DOI":"10.1017\/CBO9780511546877"},{"issue":"8","key":"16_CR16","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1177\/0278364909340445","volume":"28","author":"M Likhachev","year":"2009","unstructured":"Likhachev, M., Ferguson, D.: Planning long dynamically feasible maneuvers for autonomous vehicles. Int. J. Robot. Res. 28(8), 933\u2013945 (2009)","journal-title":"Int. J. Robot. Res."},{"key":"16_CR17","unstructured":"Mandow, L., De La Cruz, J.L.: A memory-efficient search strategy for multiobjective shortest path problems. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009, vol. 5803 LNAI, pp. 25\u201332 (2009)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Mandow, L., De La Cruz, J.L.P.: Multiobjective A* search with consistent heuristics. J. ACM 57(5), 1\u201325 (2010)","DOI":"10.1145\/1754399.1754400"},{"issue":"2","key":"16_CR19","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"EQV Martins","year":"1984","unstructured":"Martins, E.Q.V.: On a multicriteria shortest path problem. European J. Oper. Res. 16(2), 236\u2013245 (1984)","journal-title":"European J. Oper. Res."},{"issue":"4","key":"16_CR20","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1145\/115234.115368","volume":"38","author":"BS Stewart","year":"1991","unstructured":"Stewart, B.S., White, C.C.: Multiobjective A*. J. ACM (JACM) 38(4), 775\u2013814 (1991)","journal-title":"J. ACM (JACM)"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Tumova, J., Castro, L.I.R., Karaman, S., Frazzoli, E., Rus, D.: Minimum-violation LTL planning with conflicting specifications. In: 2013 American Control Conference, pp. 200\u2013205, June 2013","DOI":"10.1109\/ACC.2013.6579837"},{"key":"16_CR22","unstructured":"Tumova, J., Hall, G.C., Karaman, S., Frazzoli, E., Rus, D.: Least-violating control strategy synthesis with safety rules. In: Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, ser. HSCC 2013. New York, NY, USA, ACM, 2013, pp. 1\u201310 (2013)"},{"key":"16_CR23","unstructured":"Zimmermann, U.: Linear and combinatorial optimization in ordered algebraic structures. Ann. Discrete Math., 10, viii+380 (1981)"}],"container-title":["Springer Proceedings in Advanced Robotics","Algorithmic Foundations of Robotics XIV"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-66723-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T14:05:19Z","timestamp":1612879519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-66723-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030667221","9783030667238"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-66723-8_16","relation":{},"ISSN":["2511-1256","2511-1264"],"issn-type":[{"value":"2511-1256","type":"print"},{"value":"2511-1264","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAFR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Algorithmic Foundations of Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oulu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wafr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/robotics.cs.rutgers.edu\/wafr2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}