{"id":"https://openalex.org/W1545185138","doi":"https://doi.org/10.1109/robot.2003.1242179","title":"Planning multi-goal tours for robot arms","display_name":"Planning multi-goal tours for robot arms","publication_year":2004,"publication_date":"2004-03-30","ids":{"openalex":"https://openalex.org/W1545185138","doi":"https://doi.org/10.1109/robot.2003.1242179","mag":"1545185138"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2003.1242179","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2003.1242179","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)","raw_type":"proceedings-article"},"type":"article","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/A5071315518","display_name":"Mitul Saha","orcid":"https://orcid.org/0000-0002-6338-5070"},"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":"M. Saha","raw_affiliation_strings":["Computer Science Department, University of Stanford, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Stanford, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054053087","display_name":"Gildardo Sanchez\u2010Ante","orcid":"https://orcid.org/0000-0003-3666-0855"},"institutions":[{"id":"https://openalex.org/I98461037","display_name":"Tecnol\u00f3gico de Monterrey","ror":"https://ror.org/03ayjn504","country_code":"MX","type":"education","lineage":["https://openalex.org/I98461037"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"G. Sanchez-Ante","raw_affiliation_strings":["Computer Science Department, ITESM-Campus Guadalajara, Guadalajara, Mexico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, ITESM-Campus Guadalajara, Guadalajara, Mexico","institution_ids":["https://openalex.org/I98461037"]}]},{"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":["Computer Science Department, University of Stanford, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Stanford, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8287,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.73554406,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"3","issue":null,"first_page":"3797","last_page":"3803"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9921000003814697,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9851999878883362,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/motion-planning","display_name":"Motion planning","score":0.7205412983894348},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6710686087608337},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6691967844963074},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6295097470283508},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.600906491279602},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5769076943397522},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5229480862617493},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.5158790349960327},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4811874032020569},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.47906526923179626},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.47659534215927124},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4614696502685547},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4105531871318817},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.325522243976593},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31346410512924194},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2406095564365387},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2236991822719574}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7205412983894348},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6710686087608337},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6691967844963074},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6295097470283508},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.600906491279602},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5769076943397522},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5229480862617493},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.5158790349960327},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4811874032020569},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.47906526923179626},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.47659534215927124},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4614696502685547},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4105531871318817},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.325522243976593},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31346410512924194},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2406095564365387},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2236991822719574},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/robot.2003.1242179","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2003.1242179","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5400000214576721,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W63574109","https://openalex.org/W187767610","https://openalex.org/W1429007086","https://openalex.org/W1557739567","https://openalex.org/W2018117885","https://openalex.org/W2020643009","https://openalex.org/W2021118704","https://openalex.org/W2070983513","https://openalex.org/W2097566786","https://openalex.org/W2110684256","https://openalex.org/W2128990851","https://openalex.org/W2138800545","https://openalex.org/W2170220350","https://openalex.org/W2752885492","https://openalex.org/W2956015669","https://openalex.org/W4250180496","https://openalex.org/W6607571859","https://openalex.org/W6628465472","https://openalex.org/W6633349033"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W2592478754","https://openalex.org/W2189435634","https://openalex.org/W4301419164","https://openalex.org/W2055574289","https://openalex.org/W2950637524","https://openalex.org/W942307408","https://openalex.org/W4376528622","https://openalex.org/W2738834950","https://openalex.org/W2004837674"],"abstract_inverted_index":{"This":[0,40,62],"paper":[1,63],"considers":[2],"the":[3,27,38,57,71,74,87,114,124],"following":[4],"multi-goal":[5],"motion":[6],"planning":[7],"problem:":[8],"a":[9,65,92,102,106,117],"robot":[10],"arm":[11],"must":[12,30],"reach":[13],"several":[14],"goal":[15],"configurations":[16],"in":[17,45,105,123,131],"some":[18],"sequence,":[19],"but":[20],"this":[21],"sequence":[22],"is":[23,78,128],"not":[24],"given.":[25],"Instead,":[26],"robot's":[28],"planner":[29],"compute":[31],"an":[32],"optimal":[33],"or":[34],"near-optimal":[35],"path":[36,94],"through":[37],"goals.":[39],"problem":[41],"occurs,":[42],"for":[43],"instance,":[44],"spot-welding,":[46],"inspection,":[47],"and":[48,59,86],"measurement":[49],"tasks.":[50],"It":[51],"combines":[52],"two":[53,96],"computationally":[54],"hard":[55],"sub-problems:":[56],"shortest-path":[58],"traveling-salesman":[60],"problems.":[61],"describes":[64],"greedy":[66],"algorithm":[67,115],"that":[68,73,99],"operates":[69],"under":[70],"assumption":[72],"number":[75,119],"of":[76,90,100,110,120],"goals":[77,97],"relatively":[79],"small":[80],"(a":[81],"few":[82],"dozen":[83],"at":[84],"most)":[85],"computational":[88],"cost":[89],"finding":[91,101],"good":[93,103],"between":[95],"dominates":[98],"tour":[104],"graph":[107],"with":[108],"edges":[109],"given":[111],"costs.":[112],"Although":[113],"computes":[116],"quadratic":[118],"goal-to-goal":[121],"paths":[122],"worst":[125],"case,":[126],"it":[127],"much":[129],"faster":[130],"practice.":[132]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}