{"id":"https://openalex.org/W3027502764","doi":"https://doi.org/10.1109/cis-ram47153.2019.9095547","title":"Planning Method of Near-Minimum-Time Task Tour for Industrial Point-to-Point Robot","display_name":"Planning Method of Near-Minimum-Time Task Tour for Industrial Point-to-Point Robot","publication_year":2019,"publication_date":"2019-11-01","ids":{"openalex":"https://openalex.org/W3027502764","doi":"https://doi.org/10.1109/cis-ram47153.2019.9095547","mag":"3027502764"},"language":"en","primary_location":{"id":"doi:10.1109/cis-ram47153.2019.9095547","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cis-ram47153.2019.9095547","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Cybernetics and Intelligent Systems (CIS) and IEEE Conference on Robotics, Automation and Mechatronics (RAM)","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/A5111677477","display_name":"Kosuke Nemoto","orcid":null},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Kosuke Nemoto","raw_affiliation_strings":["Depertment of Intelligent Interaction Technologies, University of Tsukuba, Ibaraki, Japan"],"affiliations":[{"raw_affiliation_string":"Depertment of Intelligent Interaction Technologies, University of Tsukuba, Ibaraki, Japan","institution_ids":["https://openalex.org/I146399215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016877257","display_name":"Yasumichi AIYAMA","orcid":"https://orcid.org/0000-0002-6228-258X"},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yasumichi Aiyama","raw_affiliation_strings":["Faculty of Engineering Information and Systems, University of Tsukuba, Ibaraki, Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering Information and Systems, University of Tsukuba, Ibaraki, Japan","institution_ids":["https://openalex.org/I146399215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111677477"],"corresponding_institution_ids":["https://openalex.org/I146399215"],"apc_list":null,"apc_paid":null,"fwci":0.2175,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66502479,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"404","last_page":"409"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991999864578247,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/robot","display_name":"Robot","score":0.7192082405090332},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6498976349830627},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6208746433258057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6028719544410706},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5661817789077759},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.5512573719024658},{"id":"https://openalex.org/keywords/automation","display_name":"Automation","score":0.5334548950195312},{"id":"https://openalex.org/keywords/factory","display_name":"Factory (object-oriented programming)","score":0.5260833501815796},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5035726428031921},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5025045871734619},{"id":"https://openalex.org/keywords/industrial-robot","display_name":"Industrial robot","score":0.4888891279697418},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.46360647678375244},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43311724066734314},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43087613582611084},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4286348521709442},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.278523325920105},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.2378411889076233},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21350350975990295}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7192082405090332},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6498976349830627},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6208746433258057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6028719544410706},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5661817789077759},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.5512573719024658},{"id":"https://openalex.org/C115901376","wikidata":"https://www.wikidata.org/wiki/Q184199","display_name":"Automation","level":2,"score":0.5334548950195312},{"id":"https://openalex.org/C40149104","wikidata":"https://www.wikidata.org/wiki/Q5620977","display_name":"Factory (object-oriented programming)","level":2,"score":0.5260833501815796},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5035726428031921},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5025045871734619},{"id":"https://openalex.org/C2776126113","wikidata":"https://www.wikidata.org/wiki/Q1128980","display_name":"Industrial robot","level":3,"score":0.4888891279697418},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.46360647678375244},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43311724066734314},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43087613582611084},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4286348521709442},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.278523325920105},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.2378411889076233},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21350350975990295},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cis-ram47153.2019.9095547","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cis-ram47153.2019.9095547","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Cybernetics and Intelligent Systems (CIS) and IEEE Conference on Robotics, Automation and Mechatronics (RAM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W1993992568"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2164188042","https://openalex.org/W4306878646","https://openalex.org/W2054495636","https://openalex.org/W2046552997","https://openalex.org/W2913191894","https://openalex.org/W4389782626","https://openalex.org/W4376138746"],"abstract_inverted_index":{"This":[0,103],"paper":[1],"introduces":[2],"a":[3,127],"near-optimal":[4],"path":[5,121],"planning":[6,122],"for":[7,10,29,43,94,123],"industrial":[8,30,124],"robot":[9,38,142],"multiple":[11,26],"point":[12,27],"tasks.":[13],"For":[14,140],"instance,":[15],"spot":[16],"welding,":[17],"drilling,":[18],"screwing":[19],"and":[20],"inspection":[21],"with":[22,153],"camera":[23],"are":[24],"popular":[25],"work":[28],"robots.":[31],"How":[32],"to":[33,50,73,112,115,148],"decide":[34],"the":[35,80,129],"sequence":[36],"of":[37,64],"motions":[39],"is":[40,57,62,70,85,100,109],"important":[41],"issue":[42],"factory":[44],"automation":[45],"because":[46,60],"it":[47,144],"directory":[48],"influences":[49],"system":[51],"productivity.":[52],"Though":[53],"getting":[54],"optimal":[55],"tour":[56],"not":[58],"easy":[59],"this":[61],"kind":[63],"Traveling":[65],"Salesman":[66],"Problem":[67],"(TSP)":[68],"that":[69,108],"almost":[71],"impossible":[72],"solve":[74,113,116],"in":[75,91],"polynomial":[76],"time.":[77],"In":[78],"TSP":[79,114],"cost":[81],"between":[82,96],"two":[83,97],"cities":[84],"given":[86],"by":[87],"geometrical":[88],"distance":[89],"though":[90],"robotics":[92],"time":[93],"moving":[95],"task":[98,119,155],"points":[99,120],"gets":[101],"cost.":[102],"article":[104],"adopts":[105],"heuristic":[106],"algorithm":[107,130],"often":[110],"used":[111],"about":[117,146],"50":[118],"robot.":[125],"As":[126],"result,":[128],"gives":[131],"under":[132],"1%":[133],"gap":[134],"solution":[135],"against":[136],"best":[137],"known":[138],"solutions.":[139],"actual":[141],"tasks,":[143],"generates":[145],"6":[147],"10%":[149],"efficient":[150],"results":[151],"compared":[152],"human":[154],"planners":[156],"path.":[157]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}