{"id":"https://openalex.org/W2156758121","doi":"https://doi.org/10.1109/robot.2005.1570825","title":"Learning-Assisted Multi-Step Planning","display_name":"Learning-Assisted Multi-Step Planning","publication_year":2006,"publication_date":"2006-01-18","ids":{"openalex":"https://openalex.org/W2156758121","doi":"https://doi.org/10.1109/robot.2005.1570825","mag":"2156758121"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2005.1570825","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2005.1570825","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027878263","display_name":"Kris Hauser","orcid":"https://orcid.org/0000-0002-5207-1527"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Hauser","raw_affiliation_strings":["University of Stanford, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Stanford, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090037830","display_name":"Timothy Bretl","orcid":"https://orcid.org/0000-0001-7883-7300"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. Bretl","raw_affiliation_strings":["University of Stanford, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Stanford, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113658744","display_name":"J.-C. Latombe","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.-C. Latombe","raw_affiliation_strings":["University of Stanford, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Stanford, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4575","last_page":"4580"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10653","display_name":"Robot Manipulation and Learning","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7707483768463135},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7258606553077698},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.6578153967857361},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.5995643138885498},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5436370968818665},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.539702832698822},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5295487642288208},{"id":"https://openalex.org/keywords/classifier","display_name":"Classifier (UML)","score":0.5043631792068481},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4142056405544281}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7707483768463135},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7258606553077698},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6578153967857361},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.5995643138885498},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5436370968818665},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.539702832698822},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5295487642288208},{"id":"https://openalex.org/C95623464","wikidata":"https://www.wikidata.org/wiki/Q1096149","display_name":"Classifier (UML)","level":2,"score":0.5043631792068481},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4142056405544281},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/robot.2005.1570825","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2005.1570825","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.60.7817","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.7817","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stanford.edu/~khauser/papers/Hauser-2005-Learning.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W4983232","https://openalex.org/W77797718","https://openalex.org/W854322902","https://openalex.org/W1483753820","https://openalex.org/W1500443963","https://openalex.org/W1573240230","https://openalex.org/W1576520375","https://openalex.org/W1588486985","https://openalex.org/W2021118704","https://openalex.org/W2103524001","https://openalex.org/W2107479439","https://openalex.org/W2114193135","https://openalex.org/W2122410182","https://openalex.org/W2139212933","https://openalex.org/W2171266831","https://openalex.org/W2402652894","https://openalex.org/W2615415874","https://openalex.org/W3086498226","https://openalex.org/W3193477162","https://openalex.org/W6600203084","https://openalex.org/W6603146607","https://openalex.org/W6628906341","https://openalex.org/W6634258577","https://openalex.org/W6634442568","https://openalex.org/W6675522605","https://openalex.org/W6677136972","https://openalex.org/W6712875393"],"related_works":["https://openalex.org/W2943623134","https://openalex.org/W2494523064","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W2145503356","https://openalex.org/W3138952546","https://openalex.org/W1519058190","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153"],"abstract_inverted_index":{"Probabilistic":[0],"sampling-based":[1],"motion":[2,51,95],"planners":[3],"are":[4],"unable":[5],"to":[6,17,69,83,101],"detect":[7],"when":[8],"no":[9],"feasible":[10],"path":[11,24],"exists.":[12],"A":[13],"common":[14],"heuristic":[15],"is":[16,25,81],"declare":[18],"a":[19,23,29,53,66,79,89,117],"query":[20],"infeasible":[21,106],"if":[22],"not":[26],"found":[27],"in":[28,114],"fixed":[30],"amount":[31],"of":[32,88],"time.":[33],"In":[34,74],"applications":[35],"where":[36],"many":[37],"queries":[38],"must":[39],"be":[40],"processed":[41],"\u2013":[42,52],"for":[43],"instance,":[44],"robotic":[45],"manipulation,":[46],"multi-limbed":[47],"locomotion,":[48],"and":[49],"contact":[50],"critical":[54],"question":[55],"arises:":[56],"what":[57],"should":[58],"this":[59,72,99],"time":[60,104],"limit":[61],"be?":[62],"This":[63,108],"paper":[64],"presents":[65],"machine-learning":[67],"approach":[68,109],"deal":[70],"with":[71],"question.":[73],"an":[75,92],"off-line":[76],"learning":[77],"phase,":[78],"classifier":[80,100],"trained":[82],"quickly":[84],"predict":[85],"the":[86],"feasibility":[87],"query.":[90],"Then,":[91],"improved":[93],"multi-step":[94],"planning":[96],"algorithm":[97],"uses":[98],"avoid":[102],"wasting":[103],"on":[105,116],"queries.":[107],"has":[110],"been":[111],"successfully":[112],"demonstrated":[113],"simulation":[115],"four-limbed,":[118],"free-climbing":[119],"robot.":[120]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}