{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:52:16Z","timestamp":1648713136622},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,9,15]],"date-time":"2012-09-15T00:00:00Z","timestamp":1347667200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Intel Serv Robotics"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s11370-012-0116-0","type":"journal-article","created":{"date-parts":[[2012,9,15]],"date-time":"2012-09-15T00:27:36Z","timestamp":1347668856000},"page":"245-258","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of solutions to the time-optimal planning and execution problem"],"prefix":"10.1007","volume":"5","author":[{"given":"Thomas","family":"Allen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Scheding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,15]]},"reference":[{"key":"116_CR1","unstructured":"Allen T (2011) Time-optimal active decision making. PhD thesis, The University of Sydney"},{"key":"116_CR2","doi-asserted-by":"crossref","unstructured":"Allen T (2011) The time-optimal planning and execution problem. In: IEEE international conference on robotics and automation, Shanghai, China","DOI":"10.1109\/ICRA.2011.5979708"},{"key":"116_CR3","doi-asserted-by":"crossref","unstructured":"Allen T, Hill A, Underwood J, Scheding S (2009) Dynamic path planning with multi-agent data fusion: the parallel hierarchical replanner. In: Proceedings of the international conference on robotics and automation, Kobe, Japan, pp 3245\u20133250","DOI":"10.1109\/ROBOT.2009.5152883"},{"key":"116_CR4","unstructured":"Bekris K, Chen B, Ladd A, Plaku E, Kavraki L (2003) Multiple query probabilistic roadmap planning using single query primitives. In: IEEE\/RSJ international conference on intelligent robots and systems"},{"key":"116_CR5","unstructured":"Belghith K, Kabanza F, Hartman L, Nkambou R (2006) Anytime dynamic path-planning with flexible probabilistic roadmaps. In: IEEE international conference on robotics and automation"},{"key":"116_CR6","volume-title":"Dynamic programming","author":"R Bellman","year":"1957","unstructured":"Bellman R (1957) Dynamic programming. Princeton University Press, New Jersey"},{"key":"116_CR7","volume-title":"The complexity of robot motion planning","author":"J Canny","year":"1988","unstructured":"Canny J (1988) The complexity of robot motion planning. MIT Press, Cambridge"},{"key":"116_CR8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V Cerny","year":"1985","unstructured":"Cerny V (1985) A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. J Optim Theory Appl 45:41\u201351","journal-title":"J Optim Theory Appl"},{"key":"116_CR9","unstructured":"Ferguson D, Likhachev M, Stentz A (2005) A guide to heuristic-based path planning. In: Proceedings of the international workshop on planning under uncertainty for autonomous systems. International conference on automated planning and scheduling (ICAPS)"},{"key":"116_CR10","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/358523.358553","volume":"25","author":"A Fournier","year":"1982","unstructured":"Fournier A, Fussel D, Carpenter L (1982) Computer rendering of stochastic models. Commun ACM 25:371\u2013384","journal-title":"Commun ACM"},{"key":"116_CR11","volume-title":"Monte Carlo methods","author":"J Hammersley","year":"1975","unstructured":"Hammersley J, Handscomb D (1975) Monte Carlo methods. Methuen, London"},{"key":"116_CR12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2096","volume":"28","author":"E Hansen","year":"2007","unstructured":"Hansen E, Zhou R (2007) Anytime heuristic search. J Artif Intell Res 28:267\u2013297","journal-title":"J Artif Intell Res"},{"key":"116_CR13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0004-3702(00)00068-0","volume":"126","author":"E Hansen","year":"2001","unstructured":"Hansen E, Zilberstein S (2001) Montioring and control of anytime algorithms: a dynamic programming approach. Artif Intell 126:139\u2013157","journal-title":"Artif Intell"},{"key":"116_CR14","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"2","author":"P Hart","year":"1968","unstructured":"Hart P, Nilsson N, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 2:100\u2013107","journal-title":"IEEE Trans Syst Sci Cybern"},{"key":"116_CR15","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1056777.1056779","volume":"37","author":"P Hart","year":"1972","unstructured":"Hart P, Nilsson N, Raphael B (1972) Correction to \u201cA formal basis for the heuristic determination of minimum cost paths\u201d. SIGART Newslett 37:28\u201329","journal-title":"SIGART Newslett"},{"key":"116_CR16","unstructured":"Horvitz E (1987) Reasoning about beliefs and actions under computational resource constraints. In: Proceedings of the third workshop on uncertainty in artifical intelligence, Seattle, WA, pp\u00a0429\u2013444"},{"key":"116_CR17","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/rob.20244","volume":"25","author":"T Howard","year":"2008","unstructured":"Howard T, Green C, Kelly A, Ferguson D (2008) State space sampling of feasible motions for high-performance mobile robot navigation in complex environments. J Field Robot 25: 325\u2013345","journal-title":"J Field Robot"},{"key":"116_CR18","unstructured":"Karumanchi S (2010) Off-road mobility analysis from proprioceptive feedback. PhD thesis, Department of Aerospace, Mechanical, and Mechatronic Engineering, The University of Sydney"},{"issue":"8","key":"116_CR19","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1177\/0278364910370241","volume":"29","author":"S Karumanchi","year":"2010","unstructured":"Karumanchi S, Allen T, Bailey T, Scheding S (2010) Non-parametric learning to aid path planning over slopes. Int J Robot Res 29(8):997\u20131018","journal-title":"Int J Robot Res"},{"issue":"4","key":"116_CR20","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"Kavraki LE, Svestka P, Latombe JC, Overmars MH (1996) Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans Robot Autom 12(4):566\u2013580","journal-title":"IEEE Trans Robot Autom"},{"key":"116_CR21","doi-asserted-by":"crossref","unstructured":"Kelly A, Stentz A, Amidi O, Bode M, Bradley D, Diaz-Calderon A, Happold M, Herman H, Mandelbaum R, Pilarski T, Rander P, Thayer S, Vallidis N, Warner R (2006) Toward reliable off road autonomous vehicles operating in challenging environments. Int J Robot Res 25(5\u20136):449\u2013483","DOI":"10.1177\/0278364906065543"},{"issue":"4598","key":"116_CR22","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"New Series 220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt C, Vecchi M (1983) Optimization by simulated annealing. Science New Series 220(4598):671\u2013680","journal-title":"Science"},{"key":"116_CR23","doi-asserted-by":"crossref","unstructured":"Knepper R, Kelly A (2006) High performance state lattice planning using heuristic look-up tables. In: 2006 IEEE\/RSJ international conference on intelligent robots and systems, pp 3375\u20133380","DOI":"10.1109\/IROS.2006.282515"},{"key":"116_CR24","doi-asserted-by":"crossref","unstructured":"LaValle SM (2006) Planning algorithms. Cambridge University Press, Cambridge. http:\/\/planning.cs.uiuc.edu\/","DOI":"10.1017\/CBO9780511546877"},{"key":"116_CR25","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1177\/0278364909340445","volume":"28","author":"M Likhachev","year":"2009","unstructured":"Likhachev M, Ferguson D (2009) Planning long dynamically feasible maneuvers for autonomous vehicles. Int J Robot Res 28:933\u2013945","journal-title":"Int J Robot Res"},{"key":"116_CR26","unstructured":"Likhachev M, Ferguson D, Gordon G, Stentz A, Thrun S (2005) Anytime dynamic A*: an anytime, replanning algorithm. In: Proceedings of the international conference on automated planning and scheduling (ICAPS)"},{"key":"116_CR27","unstructured":"Likhachev M, Ferguson D, Gordon G, Stentz A, Thrun S (2005) Anytime dynamic A*: the proofs. Technical report. CMU-RI-TR-05-12, Robotics Institute, Pittsburgh, PA"},{"key":"116_CR28","unstructured":"Likhachev M, Gordon G, Thrun S (2003) ARA*: anytime A* with provable bounds on sub-optimality. In: Neural information processing systems"},{"key":"116_CR29","unstructured":"Matthews G (2008) Asynchronous decision making for decentralised autonomous systems. PhD thesis, Department of Aerospace, Mechanical, and Mechatronic Engineering, The University of Sydney"},{"issue":"4","key":"116_CR30","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/15886.15890","volume":"20","author":"G Miller","year":"1986","unstructured":"Miller G (1986) The definition and rendering of terrain maps. Comput Graph 20(4):39\u201348","journal-title":"Comput Graph"},{"key":"116_CR31","volume-title":"Heuristics","author":"J Pearl","year":"1984","unstructured":"Pearl J (1984) Heuristics. Addison-Wesley, New York"},{"key":"116_CR32","unstructured":"Pivtoraiko M, Kelly A (2005) Efficient constrained path planning via search state lattices. In: The 8th international symposium on artifical intelligence, robotics, and automation in space"},{"key":"116_CR33","doi-asserted-by":"crossref","unstructured":"Pivtoraiko M, Kelly A (2005) Generating near minimal spanning control sets for constrained motion planning in discrete state spaces. In: International conference on intelligent robots and systems","DOI":"10.1109\/IROS.2005.1545046"},{"key":"116_CR34","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0004-3702(70)90007-X","volume":"1","author":"I Pohl","year":"1970","unstructured":"Pohl I (1970) Heuristic search viewed as path finding in a graph. Artif Intell 1:193\u2013204","journal-title":"Artif Intell"},{"key":"116_CR35","volume-title":"Artifical intelligence: a modern approach, 2nd edn","author":"S Russell","year":"2003","unstructured":"Russell S, Norvig P (2003) Artifical intelligence: a modern approach, 2nd edn. Prentice Hall, New York"},{"key":"116_CR36","doi-asserted-by":"crossref","unstructured":"Russell S, Wefald E, Karnaugh M, Karp R, McAllester D, Subramanian D, Wellman M (1991) Principles of metareasoning. In: Artificial intelligence. Morgan Kaufmann, pp 400\u2013411","DOI":"10.1016\/0004-3702(91)90015-C"},{"key":"116_CR37","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1163\/016918609X12619993300746","volume":"24","author":"T Saitoh","year":"2010","unstructured":"Saitoh T, Suzuki M, Kuroda Y (2010) Vision-based probabilistic map estimation with an inclined surface grid for rough terrain rover navigation. Adv Robot 24:421\u2013440","journal-title":"Adv Robot"},{"key":"116_CR38","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/3-540-36460-9_27","volume":"6","author":"G S\u00e1nchez","year":"2003","unstructured":"S\u00e1nchez G, Latombe JC (2003) A single-query bi-directional probabilistic roadmap planner with lazy collision checking. Int J Robot Res 6:403\u2013417","journal-title":"Int J Robot Res"},{"key":"116_CR39","volume-title":"Reinforcement learning","author":"R Sutton","year":"1998","unstructured":"Sutton R, Barto A (1998) Reinforcement learning. MIT Press, Cambridge"},{"issue":"3","key":"116_CR40","first-page":"58","volume":"38","author":"G Tesauro","year":"1995","unstructured":"Tesauro G (1995) Temporal difference learning and TD-gammon. Commun Assoc Comput Mach 38(3):58\u201369","journal-title":"Commun Assoc Comput Mach"},{"key":"116_CR41","unstructured":"Thayer J, Ruml W (2008) Faster than weighted A*: an optimistic approach to bounded suboptimal search. In: Proceedings of the eighteenth international conference on automated planning and scheduling"},{"key":"116_CR42","unstructured":"Underwood J (2009) Reliable and safe autonomy for ground vehicles in unstructured environments. PhD thesis, Department of Aerospace, Mechanical, and Mechatronic Engineering, The University of Sydney"},{"key":"116_CR43","unstructured":"Valve Corporation: Steam Hardware Survey (2010) http:\/\/store.steampowered.com\/hwsurvey\/cpus\/"},{"key":"116_CR44","doi-asserted-by":"crossref","unstructured":"Voss R (1987) Fractals in nature: characterization, measurement, and simulation. In: SIGGRAPH","DOI":"10.1007\/978-1-4612-3784-6_1"},{"key":"116_CR45","unstructured":"Watkins C (1989) Learning from delayed rewards. PhD thesis, Cambridge University, Cambridge"},{"key":"116_CR46","first-page":"73","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein S (1996) Using anytime algorithms in intelligent systems. Artif Intell Mag 17:73\u201383","journal-title":"Artif Intell Mag"},{"key":"116_CR47","volume-title":"Imprecise and approximate computation. Approximate reasoning using anytime algorithms, chap 4","author":"S Zilberstein","year":"1995","unstructured":"Zilberstein S, Russell S (1995) Imprecise and approximate computation. Approximate reasoning using anytime algorithms, chap 4. Kluwer, Norwell"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-012-0116-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11370-012-0116-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-012-0116-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T19:06:07Z","timestamp":1562180767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11370-012-0116-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,15]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["116"],"URL":"https:\/\/doi.org\/10.1007\/s11370-012-0116-0","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,15]]}}}