{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T19:42:53Z","timestamp":1649187773028},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,6,14]],"date-time":"2013-06-14T00:00:00Z","timestamp":1371168000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["K\u00fcnstl Intell"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s13218-013-0257-0","type":"journal-article","created":{"date-parts":[[2013,6,13]],"date-time":"2013-06-13T10:44:41Z","timestamp":1371120281000},"page":"201-211","source":"Crossref","is-referenced-by-count":0,"title":["Statistic Methods for Path-Planning Algorithms Comparison"],"prefix":"10.1007","volume":"27","author":[{"given":"Pablo","family":"Mu\u00f1oz","sequence":"first","affiliation":[]},{"given":"David F.","family":"Barrero","sequence":"additional","affiliation":[]},{"given":"Mar\u00eda D.","family":"R-Moreno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,14]]},"reference":[{"key":"257_CR1","doi-asserted-by":"crossref","DOI":"10.1201\/b13169","volume-title":"Artificial intelligence for games","author":"I Millington","year":"2009","unstructured":"Millington I, Funge J (2009) Artificial intelligence for games, 2nd edn. Morgan Kaufmann, San Mateo","edition":"2"},{"key":"257_CR2","volume-title":"Proceedings of the international symposium on robotics research (ISRR)","author":"D Ferguson","year":"2005","unstructured":"Ferguson D, Stentz A (2005) Field D*: an interpolation-based path planner and replanner. In: Proceedings of the international symposium on robotics research (ISRR), October 2005"},{"key":"257_CR3","first-page":"1177","volume-title":"Proceedings of the AAAI conference on artificial intelligence (AAAI)","author":"A Nash","year":"2007","unstructured":"Nash A, Daniel K, Koenig S, Felner A (2007) Theta*: any-angle path planning on grids. In: Proceedings of the AAAI conference on artificial intelligence (AAAI), pp 1177\u20131183"},{"key":"257_CR4","volume-title":"Proc of the thirty-second SGAI international conference on artificial intelligence","author":"P Munoz","year":"2012","unstructured":"Munoz P, R-Moreno MD (2012) S-Theta*: low steering path-planning algorithm. In: Proc of the thirty-second SGAI international conference on artificial intelligence, Cambridge, UK, December 2012"},{"key":"257_CR5","volume-title":"6th IEEE international conference on intelligent systems IS\u201912","author":"P Munoz","year":"2012","unstructured":"Munoz P, R-Moreno MD (2012) Improving efficiency in any-angle path-planning algorithms. In: 6th IEEE international conference on intelligent systems IS\u201912, Sofia, Bulgaria, September 2012"},{"key":"257_CR6","first-page":"1051","volume-title":"IEEE international conference on robotics and biomimetics","author":"S Choi","year":"2010","unstructured":"Choi S, Lee JY, Yu W (2010) Fast any-angle path planning on grid maps with non-collision pruning. In: IEEE international conference on robotics and biomimetics, Tianjin, China, December 2010, pp 1051\u20131056"},{"key":"257_CR7","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 (2010) Theta*: any-angle path planning on grids. J Artif Intell Res 39:533\u2013579","journal-title":"J Artif Intell Res"},{"key":"257_CR8","first-page":"1","volume":"1","author":"A Botea","year":"2004","unstructured":"Botea A, Muller M, Schaeffer J (2004) Near optimal hierarchical path-finding. J Game Dev 1:1\u201322","journal-title":"J Game Dev"},{"key":"257_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/3-540-47922-8_4","volume-title":"Advances in artificial intelligence","author":"P Yap","year":"2002","unstructured":"Yap P (2002) Grid-based path-finding. In: Advances in artificial intelligence. Lecture notes in computer science, vol 2338. Springer, Berlin, pp 44\u201355"},{"key":"257_CR10","volume-title":"ICRA 2008 workshop on path planning on costmaps","author":"G Ayorkor","year":"2008","unstructured":"Ayorkor G, Stentz A, Dias MB (2008) Continuous-field path planning with constrained path-dependent state variables. In: ICRA 2008 workshop on path planning on costmaps, May 2008"},{"key":"257_CR11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1147\/sj.41.0025","volume":"4","author":"J Bresenham","year":"1965","unstructured":"Bresenham J (1965) Algorithm for computer control of a digital plotter. IBM Syst J 4:25\u201330","journal-title":"IBM Syst J"},{"key":"257_CR12","first-page":"238","volume-title":"Proceedings of the fourteenth conference on uncertainty in artificial intelligence (UAI-98)","author":"H Hoos","year":"1998","unstructured":"Hoos H, St\u00fctzle T (1998) Evaluating Las Vegas algorithms\u2014pitfalls and remedies. In: Proceedings of the fourteenth conference on uncertainty in artificial intelligence (UAI-98). Morgan Kaufmann, San Mateo, pp 238\u2013245"},{"issue":"4","key":"257_CR13","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1023\/A:1006350622830","volume":"24","author":"H Hoos","year":"2000","unstructured":"Hoos H, St\u00fctzle T (2000) Local search algorithms for SAT: an empirical evaluation. J Autom Reason 24(4):421\u2013481","journal-title":"J Autom Reason"},{"key":"257_CR14","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.5.1.2","volume":"5","author":"R Barr","year":"1993","unstructured":"Barr R, Hickman B (1993) Reporting computational experiments with parallel algorithms: issues, measures, and experts\u2019 opinions. ORSA J Comput 5:2","journal-title":"ORSA J Comput"},{"key":"257_CR15","volume-title":"Proceedings AAAI99","author":"H Hoos","year":"1998","unstructured":"Hoos H, St\u00fctzle T (1998) Characterizing the run-time behavior of stochastic local search. In: Proceedings AAAI99"},{"issue":"1\u20132","key":"257_CR16","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0004-3702(99)00048-X","volume":"112","author":"H Hoos","year":"1999","unstructured":"Hoos H, St\u00fctzle T (1999) Towards a characterisation of the behaviour of stochastic local search algorithms for SAT. Artif Intell 112(1\u20132):213\u2013232","journal-title":"Artif Intell"},{"key":"257_CR17","unstructured":"Chiarandini M, St\u00fctzle T (2002) Experimental evaluation of course timetabling algorithms. Intellectics Group, Computer Science Department, Darmstadt University of Technology, Darmstadt, Germany. Tech Rep AIDA-02-05"},{"key":"257_CR18","first-page":"327","volume-title":"Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on innovative applications of artificial intelligence (AAAI\u201997\/IAAI\u201997)","author":"D Frost","year":"1997","unstructured":"Frost D, Rish I, Vila L (1997) Summarizing CSP hardness with continuous probability distributions. In: Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on innovative applications of artificial intelligence (AAAI\u201997\/IAAI\u201997). AAAI Press, New York, pp 327\u2013333"},{"key":"257_CR19","volume-title":"Workshops at the twenty-fourth AAAI conference on artificial intelligence","author":"S Epstein","year":"2010","unstructured":"Epstein S, Yun X (2010) From unsolvable to solvable: an exploration of simple changes. In: Workshops at the twenty-fourth AAAI conference on artificial intelligence"},{"key":"257_CR20","series-title":"LNCS","first-page":"155","volume-title":"Proceedings of the 14th European conference on genetic programming (EuroGP 2011)","author":"DF Barrero","year":"2011","unstructured":"Barrero DF, Casta\u00f1o B, R-Moreno MD, Camacho D (2011) Statistical distribution of generation-to-success in GP: application to model accumulated success probability. In: Proceedings of the 14th European conference on genetic programming (EuroGP 2011), Turin, Italy, 27\u201329 Apr 2011. LNCS, vol 6621. Springer, Berlin, pp 155\u2013166"}],"container-title":["KI - K\u00fcnstliche Intelligenz"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-013-0257-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13218-013-0257-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-013-0257-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T06:07:57Z","timestamp":1563170877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13218-013-0257-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,14]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["257"],"URL":"https:\/\/doi.org\/10.1007\/s13218-013-0257-0","relation":{},"ISSN":["0933-1875","1610-1987"],"issn-type":[{"value":"0933-1875","type":"print"},{"value":"1610-1987","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,14]]}}}