{"id":"https://openalex.org/W2062105084","doi":"https://doi.org/10.1007/s00454-003-2952-3","title":"Pseudo Approximation Algorithms with Applications to Optimal Motion Planning","display_name":"Pseudo Approximation Algorithms with Applications to Optimal Motion Planning","publication_year":2003,"publication_date":"2003-12-23","ids":{"openalex":"https://openalex.org/W2062105084","doi":"https://doi.org/10.1007/s00454-003-2952-3","mag":"2062105084"},"language":"en","primary_location":{"id":"doi:10.1007/s00454-003-2952-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-003-2952-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-003-2952-3.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete and Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/s00454-003-2952-3.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038413661","display_name":"Tetsuo Asano","orcid":"https://orcid.org/0000-0002-4741-0467"},"institutions":[{"id":"https://openalex.org/I177738480","display_name":"Japan Advanced Institute of Science and Technology","ror":"https://ror.org/03frj4r98","country_code":"JP","type":"education","lineage":["https://openalex.org/I177738480"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Tetsuo Asano","raw_affiliation_strings":["School of Information Science, JAIST, \nAsahidai, Tatsunokuchi, Ishikana 923-12, Japan","School of Information Science, JAIST, Asahidai, Tatsunokuchi, Ishikana 923-12, Japan#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Information Science, JAIST, \nAsahidai, Tatsunokuchi, Ishikana 923-12, Japan","institution_ids":["https://openalex.org/I177738480"]},{"raw_affiliation_string":"School of Information Science, JAIST, Asahidai, Tatsunokuchi, Ishikana 923-12, Japan#TAB#","institution_ids":["https://openalex.org/I177738480"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069172477","display_name":"David Kirkpatrick","orcid":"https://orcid.org/0000-0002-3276-2734"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"David Kirkpatrick","raw_affiliation_strings":["Department of Computer Science, University of British Columbia,\nVancouver, British Columbia,  V6T 1Z4, Canada","Department of Computer Science, University of British Columbia,#N#Vancouver, British Columbia,  V6T 1Z4, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of British Columbia,\nVancouver, British Columbia,  V6T 1Z4, Canada","institution_ids":["https://openalex.org/I141945490"]},{"raw_affiliation_string":"Department of Computer Science, University of British Columbia,#N#Vancouver, British Columbia,  V6T 1Z4, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078989577","display_name":"Chee Yap","orcid":"https://orcid.org/0000-0003-2952-3545"},"institutions":[{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chee Yap","raw_affiliation_strings":["Courant Institute, New York University, 251 Mercer Street, New York, NY 10012, USA","Courant Institute, New York University, 251 Mercer Street, New York, NY 10012, USA()"],"affiliations":[{"raw_affiliation_string":"Courant Institute, New York University, 251 Mercer Street, New York, NY 10012, USA","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"raw_affiliation_string":"Courant Institute, New York University, 251 Mercer Street, New York, NY 10012, USA()","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5038413661"],"corresponding_institution_ids":["https://openalex.org/I177738480"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.8858,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.86304761,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"31","issue":"1","first_page":"139","last_page":"171"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7050849199295044},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5897544026374817},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5658795833587646},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5336160659790039},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4513130486011505},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4507184624671936},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14194941520690918},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1089613139629364}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7050849199295044},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5897544026374817},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5658795833587646},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5336160659790039},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4513130486011505},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4507184624671936},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14194941520690918},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1089613139629364},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00454-003-2952-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-003-2952-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-003-2952-3.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete and Computational Geometry","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00454-003-2952-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-003-2952-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-003-2952-3.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete and Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7414685408","display_name":"ITR: A New Computational Paradigm: Robustness as a Resource","funder_award_id":"0082056","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2062105084.pdf","grobid_xml":"https://content.openalex.org/works/W2062105084.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1509580513","https://openalex.org/W1514550606","https://openalex.org/W1520128606","https://openalex.org/W1975489634","https://openalex.org/W1993813109","https://openalex.org/W2001804342","https://openalex.org/W2010692862","https://openalex.org/W2018347014","https://openalex.org/W2024693023","https://openalex.org/W2025736494","https://openalex.org/W2036114412","https://openalex.org/W2057364504","https://openalex.org/W2057677006","https://openalex.org/W2086051681","https://openalex.org/W2130300980","https://openalex.org/W2170220350","https://openalex.org/W2171665075","https://openalex.org/W2286988137","https://openalex.org/W2735847404","https://openalex.org/W3004540582","https://openalex.org/W4246219036","https://openalex.org/W6648537628","https://openalex.org/W6654969588","https://openalex.org/W6812516842"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2544423928","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2980963558","https://openalex.org/W2181413294","https://openalex.org/W2052122378","https://openalex.org/W2989452537"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}