{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T04:10:46Z","timestamp":1748664646467,"version":"3.41.0"},"reference-count":42,"publisher":"SAGE Publications","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AIC"],"published-print":{"date-parts":[[2015,9,18]]},"DOI":"10.3233\/aic-150658","type":"journal-article","created":{"date-parts":[[2015,9,22]],"date-time":"2015-09-22T15:57:59Z","timestamp":1442937479000},"page":"665-681","source":"Crossref","is-referenced-by-count":0,"title":["Using random sampling trees for automated planning"],"prefix":"10.1177","volume":"28","author":[{"given":"Vidal","family":"Alc\u00e1zar","sequence":"first","affiliation":[{"name":"Computer Science Department, Universidad Carlos III de Madrid, Madrid, Spain. E-mails:\u00a0vidal.alcazar.saiz@gmail.com,\u00a0sfarregu@inf.uc3m.es,\u00a0dborrajo@ia.uc3m.es"}]},{"given":"Susana","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[{"name":"Computer Science Department, Universidad Carlos III de Madrid, Madrid, Spain. E-mails:\u00a0vidal.alcazar.saiz@gmail.com,\u00a0sfarregu@inf.uc3m.es,\u00a0dborrajo@ia.uc3m.es"}]},{"given":"Daniel","family":"Borrajo","sequence":"additional","affiliation":[{"name":"Computer Science Department, Universidad Carlos III de Madrid, Madrid, Spain. E-mails:\u00a0vidal.alcazar.saiz@gmail.com,\u00a0sfarregu@inf.uc3m.es,\u00a0dborrajo@ia.uc3m.es"}]},{"given":"Manuela","family":"Veloso","sequence":"additional","affiliation":[{"name":"Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, USA. E-mail:\u00a0mmv@cs.cmu.edu"}]}],"member":"179","reference":[{"key":"10.3233\/AIC-150658_ref1","unstructured":"[1]V.\u00a0Alc\u00e1zar, D.\u00a0Borrajo, S.\u00a0Fern\u00e1ndez and R.\u00a0Fuentetaja, Revisiting regression in planning, in: International Joint Conference on Artificial Intelligence, 2013, pp.\u00a02254\u20132260."},{"key":"10.3233\/AIC-150658_ref2","doi-asserted-by":"crossref","unstructured":"[2]V.\u00a0Alc\u00e1zar, M.M.\u00a0Veloso and D.\u00a0Borrajo, Adapting a rapidly-exploring random tree for automated planning, in: Symposium on Combinatorial Search, 2011, pp.\u00a02\u20139.","DOI":"10.1609\/socs.v2i1.18192"},{"issue":"3","key":"10.3233\/AIC-150658_ref3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","article-title":"Voronoi diagrams \u2013 A survey of a fundamental geometric data structure","volume":"23","author":"Aurenhammer","year":"1991","journal-title":"ACM Computing Surveys"},{"key":"10.3233\/AIC-150658_ref4","doi-asserted-by":"crossref","unstructured":"[4]J.\u00a0Bibai, P.\u00a0Sav\u00e9ant, M.\u00a0Schoenauer and V.\u00a0Vidal, An evolutionary metaheuristic based on state decomposition for domain-independent satisficing planning, in: International Conference on Automated Planning and Scheduling, AAAI, 2010, pp.\u00a018\u201325.","DOI":"10.1609\/icaps.v20i1.13399"},{"issue":"1,2","key":"10.3233\/AIC-150658_ref5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0004-3702(01)00108-4","article-title":"Planning as heuristic search","volume":"129","author":"Bonet","year":"2001","journal-title":"Artificial Intelligence"},{"issue":"4","key":"10.3233\/AIC-150658_ref6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","article-title":"New methods to color the vertices of a graph","volume":"22","author":"Br\u00e9laz","year":"1979","journal-title":"Communications of the ACM"},{"key":"10.3233\/AIC-150658_ref7","doi-asserted-by":"crossref","unstructured":"[7]J.\u00a0Bruce and M.\u00a0Veloso, Real-time randomized path planning for robot navigation, in: International Conference on Intelligent Robots and Systems, October 2002, 2002, pp.\u00a0288\u2013295.","DOI":"10.1007\/978-3-540-45135-8_23"},{"key":"10.3233\/AIC-150658_ref8","doi-asserted-by":"crossref","unstructured":"[8]J.\u00a0Bruce and M.M.\u00a0Veloso, Real-time randomized motion planning for multiple domains, in: RoboCup, G.\u00a0Lakemeyer, E.\u00a0Sklar, D.G.\u00a0Sorrenti and T.\u00a0Takahashi, eds, Lecture Notes in Computer Science, Vol.\u00a04434, 2006, pp.\u00a0532\u2013539.","DOI":"10.1007\/978-3-540-74024-7_55"},{"key":"10.3233\/AIC-150658_ref9","unstructured":"[9]D.\u00a0Burfoot, J.\u00a0Pineau and G.\u00a0Dudek, RRT-plan: A randomized algorithm for STRIPS planning, in: International Conference on Automated Planning and Scheduling, 2006, pp.\u00a0362\u2013365."},{"issue":"1,2","key":"10.3233\/AIC-150658_ref10","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","article-title":"The computational complexity of propositional STRIPS planning","volume":"69","author":"Bylander","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-150658_ref11","unstructured":"[11]H.\u00a0Choset, K.M.\u00a0Lynch, S.\u00a0Hutchinson, G.A.\u00a0Kantor, W.\u00a0Burgard, L.E.\u00a0Kavraki and S.\u00a0Thrun, Principles of Robot Motion: Theory, Algorithms, and Implementations, MIT Press, Cambridge, MA, 2005."},{"key":"10.3233\/AIC-150658_ref12","doi-asserted-by":"crossref","unstructured":"[12]M.\u00a0Christie, R.\u00a0Machap, J.-M.\u00a0Normand, P.\u00a0Olivier and J.\u00a0Pickering, Virtual camera planning: A survey, in: Smart Graphics, A.\u00a0Butz, B.\u00a0Fisher, A.\u00a0Kr\u00fcger and P.\u00a0Olivier, eds, Lecture Notes in Computer Science, Vol.\u00a03638, Springer, Heidelberg, 2005, pp.\u00a040\u201352.","DOI":"10.1007\/11536482_4"},{"key":"10.3233\/AIC-150658_ref13","doi-asserted-by":"crossref","first-page":"i116","DOI":"10.1093\/bioinformatics\/bti1017","article-title":"A path planning approach for computing large-amplitude motions of flexible molecules","volume":"21","author":"Cort\u00e9s","year":"2005","journal-title":"Bioinformatics"},{"issue":"3","key":"10.3233\/AIC-150658_ref14","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1111\/0824-7935.00065","article-title":"Pattern databases","volume":"14","author":"Culberson","year":"1998","journal-title":"Comput. Intell."},{"issue":"3","key":"10.3233\/AIC-150658_ref15","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/TII.2012.2188901","article-title":"AutoAssem: An automated assembly planning system for complex products","volume":"8","author":"Da\u00a0Xu","year":"2012","journal-title":"IEEE Transactions on Industrial Informatics"},{"key":"10.3233\/AIC-150658_ref16","unstructured":"[16]R.\u00a0Fuentetaja, D.\u00a0Borrajo and C.\u00a0Linares L\u00f3pez, A unified view of cost-based heuristics, in: Proceedings of the 2nd Workshop on Heuristics for Domain-Independent Planning. Conference on Automated Planning and Scheduling (ICAPS\u201909), Thessaloniki, Greece, 2009."},{"key":"10.3233\/AIC-150658_ref17","unstructured":"[17]A.\u00a0Gerevini and I.\u00a0Serina, LPG: A planner based on local search for planning graphs with action costs, in: Conference on Artificial Intelligence Planning Systems, AAAI, 2002, pp.\u00a013\u201322."},{"issue":"3","key":"10.3233\/AIC-150658_ref18","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","article-title":"Increasing tree search efficiency for constraint satisfaction problems","volume":"14","author":"Haralick","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-150658_ref19","unstructured":"[19]P.\u00a0Haslum, Additive and reversed relaxed reachability heuristics revisited, in: Proceedings of the 6th International Planning Competition, 2008."},{"key":"10.3233\/AIC-150658_ref20","doi-asserted-by":"crossref","unstructured":"[20]P.\u00a0Haslum, hm (P) = h1 (Pm ): Alternative characterisations of the generalisation from hmax to hm , in: International Conference on Automated Planning and Scheduling, 2009, pp.\u00a0354\u2013357.","DOI":"10.1609\/icaps.v19i1.13384"},{"key":"10.3233\/AIC-150658_ref21","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1613\/jair.1705","article-title":"The Fast Downward planning system","volume":"26","author":"Helmert","year":"2006","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"5,6","key":"10.3233\/AIC-150658_ref22","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.artint.2008.10.013","article-title":"Concise finite-domain representations for PDDL planning tasks","volume":"173","author":"Helmert","year":"2009","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-150658_ref23","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","article-title":"The FF planning system: Fast plan generation through heuristic search","volume":"14","author":"Hoffmann","year":"2001","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"10.3233\/AIC-150658_ref24","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1613\/jair.1492","article-title":"Ordered landmarks in planning","volume":"22","author":"Hoffmann","year":"2004","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"10.3233\/AIC-150658_ref25","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/70.508439","article-title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces","volume":"12","author":"Kavraki","year":"1996","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"10.3233\/AIC-150658_ref26","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1613\/jair.715","article-title":"On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm","volume":"12","author":"Koehler","year":"2000","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"10.3233\/AIC-150658_ref27","doi-asserted-by":"crossref","unstructured":"[27]J.J.\u00a0Kuffner and S.M.\u00a0LaValle, RRT-connect: An efficient approach to single-query path planning, in: ICRA, IEEE, 2000, pp.\u00a0995\u20131001.","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"10.3233\/AIC-150658_ref28","doi-asserted-by":"crossref","unstructured":"[28]S.M.\u00a0LaValle, Planning Algorithms, Cambridge Univ. Press, Cambridge, UK, 2006, available at: http:\/\/planning.cs.uiuc.edu\/.","DOI":"10.1017\/CBO9780511546877"},{"key":"10.3233\/AIC-150658_ref29","doi-asserted-by":"crossref","unstructured":"[29]S.M.\u00a0LaValle and J.J.\u00a0Kuffner, Randomized kinodynamic planning, in: International Conference on Robotics and Automation, 1999, pp.\u00a0473\u2013479.","DOI":"10.1109\/ROBOT.1999.770022"},{"key":"10.3233\/AIC-150658_ref30","doi-asserted-by":"crossref","unstructured":"[30]C.\u00a0Linares L\u00f3pez and D.\u00a0Borrajo, Adding diversity to classical heuristic planning, in: Proceedings of the Third Annual Symposium on Combinatorial Search (SoCS\u201910), Atlanta, USA, 2010, pp.\u00a073\u201380.","DOI":"10.1609\/socs.v1i1.18171"},{"key":"10.3233\/AIC-150658_ref31","unstructured":"[31]Q.\u00a0Lu, Y.\u00a0Xu, R.\u00a0Huang and Y.\u00a0Chen, The Roamer planner: Random-walk assisted best-first search, in: The 2011 International Planning Competition, 2011."},{"key":"10.3233\/AIC-150658_ref33","doi-asserted-by":"crossref","unstructured":"[33]S.\u00a0Morgan and M.S.\u00a0Branicky, Sampling-based planning for discrete spaces, in: International Conference on Intelligent Robots and Systems, 2004, pp.\u00a01938\u20131945.","DOI":"10.1109\/IROS.2004.1389681"},{"key":"10.3233\/AIC-150658_ref34","unstructured":"[34]H.\u00a0Nakhost and M.\u00a0M\u00fcller, Monte-Carlo exploration for deterministic planning, in: International Joint Conference on Artificial Intelligence, 2009, pp.\u00a01766\u20131771."},{"key":"10.3233\/AIC-150658_ref35","doi-asserted-by":"crossref","unstructured":"[35]S.\u00a0Richter, J.T.\u00a0Thayer and W.\u00a0Ruml, The joy of forgetting: Faster anytime search via restarting, in: International Conference on Automated Planning and Scheduling, R.I.\u00a0Brafman, H.\u00a0Geffner, J.\u00a0Hoffmann and H.A.\u00a0Kautz, eds, 2010, pp.\u00a0137\u2013144.","DOI":"10.1609\/icaps.v20i1.13412"},{"key":"10.3233\/AIC-150658_ref36","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1613\/jair.2972","article-title":"The LAMA planner: Guiding cost-based anytime planning with landmarks","volume":"39","author":"Richter","year":"2010","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"10.3233\/AIC-150658_ref37","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.artint.2012.08.001","article-title":"Planning as satisfiability: Heuristics","volume":"193","author":"Rintanen","year":"2012","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-150658_ref38","doi-asserted-by":"crossref","unstructured":"[38]G.\u00a0R\u00f6ger and M.\u00a0Helmert, The more, the merrier: Combining heuristic estimators for satisficing planning, in: International Conference on Automated Planning and Scheduling, 2010, pp.\u00a0246\u2013249.","DOI":"10.1609\/icaps.v20i1.13435"},{"key":"10.3233\/AIC-150658_ref40","unstructured":"[40]V.\u00a0Vidal, A lookahead strategy for heuristic search planning, in: International Conference on Automated Planning and Scheduling, S.\u00a0Zilberstein, J.\u00a0Koehler and S.\u00a0Koenig, eds, 2004, pp.\u00a0150\u2013160."},{"key":"10.3233\/AIC-150658_ref41","doi-asserted-by":"crossref","unstructured":"[41]F.\u00a0Xie, M.\u00a0M\u00fcller and R.\u00a0Holte, Adding local exploration to greedy best-first search in satisficing planning, in: AAAI Conference on Artificial Intelligence, 2014, pp.\u00a02388\u20132394.","DOI":"10.1609\/aaai.v28i1.9035"},{"key":"10.3233\/AIC-150658_ref42","doi-asserted-by":"crossref","unstructured":"[42]F.\u00a0Xie, H.\u00a0Nakhost and M.\u00a0M\u00fcller, Planning via random walk-driven local search, in: International Conference on Automated Planning and Scheduling, 2012, pp.\u00a0181\u2013189.","DOI":"10.1609\/icaps.v22i1.13515"},{"key":"10.3233\/AIC-150658_ref43","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1613\/jair.1136","article-title":"VHPOP: Versatile heuristic partial order planner","volume":"20","author":"Younes","year":"2003","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"14","key":"10.3233\/AIC-150658_ref44","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1016\/j.artint.2010.06.002","article-title":"The computational complexity of avoiding spurious states in state space abstraction","volume":"174","author":"Zilles","year":"2010","journal-title":"Artificial Intelligence"}],"container-title":["AI Communications"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/AIC-150658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T19:11:38Z","timestamp":1748632298000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospress&doi=10.3233\/AIC-150658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,18]]},"references-count":42,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.3233\/aic-150658","relation":{},"ISSN":["1875-8452","0921-7126"],"issn-type":[{"type":"electronic","value":"1875-8452"},{"type":"print","value":"0921-7126"}],"subject":[],"published":{"date-parts":[[2015,9,18]]}}}