{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T16:55:43Z","timestamp":1777654543154,"version":"3.51.4"},"reference-count":2,"publisher":"World Scientific Pub Co Pte Lt","issue":"04n05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[1999,8]]},"abstract":"<jats:p> We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomly-sampled milestones. The analysis of expansive configuration spaces has inspired us to develop a new randomized planning algorithm. This new algorithm tries to sample only the portion of the configuration space that is relevant to the current query, avoiding the cost of precomputing a roadmap for the entire configuration space. Thus, it is well-suited for problems where only a single query is submitted for a given environment. The algorithm has been implemented and successfully applied to complex assembly maintainability problems from the automotive industry. <\/jats:p>","DOI":"10.1142\/s0218195999000285","type":"journal-article","created":{"date-parts":[[2003,5,22]],"date-time":"2003-05-22T06:35:01Z","timestamp":1053585301000},"page":"495-512","source":"Crossref","is-referenced-by-count":217,"title":["PATH PLANNING IN EXPANSIVE CONFIGURATION SPACES"],"prefix":"10.1142","volume":"09","author":[{"given":"DAVID","family":"HSU","sequence":"first","affiliation":[{"name":"Computer Science Department, Stanford University, Stanford, CA\u00a094305, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JEAN-CLAUDE","family":"LATOMBE","sequence":"additional","affiliation":[{"name":"Computer Science Department, Stanford University, Stanford, CA\u00a094305, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"RAJEEV","family":"MOTWANI","sequence":"additional","affiliation":[{"name":"Computer Science Department, Stanford University, Stanford, CA\u00a094305, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1177\/027836499101000604"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195999000285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:32:26Z","timestamp":1565137946000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195999000285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,8]]},"references-count":2,"journal-issue":{"issue":"04n05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1999,8]]}},"alternative-id":["10.1142\/S0218195999000285"],"URL":"https:\/\/doi.org\/10.1142\/s0218195999000285","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,8]]}}}