{"id":"https://openalex.org/W2171469437","doi":"https://doi.org/10.1002/rob.4620120402","title":"Optimal assignment of robot tasks with precedence for muliti\u2010robot coordination by disjunctive graphs and state\u2010space search","display_name":"Optimal assignment of robot tasks with precedence for muliti\u2010robot coordination by disjunctive graphs and state\u2010space search","publication_year":1995,"publication_date":"1995-04-01","ids":{"openalex":"https://openalex.org/W2171469437","doi":"https://doi.org/10.1002/rob.4620120402","mag":"2171469437"},"language":"en","primary_location":{"id":"doi:10.1002/rob.4620120402","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rob.4620120402","pdf_url":null,"source":{"id":"https://openalex.org/S6068926","display_name":"Journal of Robotic Systems","issn_l":"0741-2223","issn":["0741-2223","1097-4563"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Robotic Systems","raw_type":"journal-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/A5111945589","display_name":"Chi\u2010Fang Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I99908691","display_name":"Yuan Ze University","ror":"https://ror.org/01fv1ds98","country_code":"TW","type":"education","lineage":["https://openalex.org/I99908691"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chi\u2010Fang Lin","raw_affiliation_strings":["Department of Computer Engineering and Science Yuan-Ze Institute of Technology Chungli, Taiwan 320 Republic of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering and Science Yuan-Ze Institute of Technology Chungli, Taiwan 320 Republic of China","institution_ids":["https://openalex.org/I99908691"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102160275","display_name":"Wen\u2010Hsiang Tsai","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Wen\u2010Hsiang Tsai","raw_affiliation_strings":["Department of Computer and Information Science National Chiao Tung University Hsinchu, Taiwan 300 Republic of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science National Chiao Tung University Hsinchu, Taiwan 300 Republic of China","institution_ids":["https://openalex.org/I148366613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1783,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81716607,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"12","issue":"4","first_page":"219","last_page":"236"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11159","display_name":"Manufacturing Process and Optimization","score":0.9991000294685364,"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.9991000294685364,"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/T10653","display_name":"Robot Manipulation and Learning","score":0.98089998960495,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9786999821662903,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6898459792137146},{"id":"https://openalex.org/keywords/workspace","display_name":"Workspace","score":0.6738723516464233},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5786176919937134},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5666759610176086},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5488775372505188},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5434998273849487},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5417531132698059},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5348635315895081},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5287820100784302},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.5089254379272461},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4964657425880432},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.49294090270996094},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.48415857553482056},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.48039108514785767},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.47371429204940796},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.46456992626190186},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.46313172578811646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3931090235710144},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36000749468803406},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33384525775909424},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3107150197029114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.267179012298584},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13731598854064941}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6898459792137146},{"id":"https://openalex.org/C58581272","wikidata":"https://www.wikidata.org/wiki/Q12741163","display_name":"Workspace","level":3,"score":0.6738723516464233},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5786176919937134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5666759610176086},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5488775372505188},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5434998273849487},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5417531132698059},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5348635315895081},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5287820100784302},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.5089254379272461},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4964657425880432},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.49294090270996094},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.48415857553482056},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.48039108514785767},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.47371429204940796},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.46456992626190186},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.46313172578811646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3931090235710144},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36000749468803406},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33384525775909424},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3107150197029114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.267179012298584},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13731598854064941},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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.1002/rob.4620120402","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rob.4620120402","pdf_url":null,"source":{"id":"https://openalex.org/S6068926","display_name":"Journal of Robotic Systems","issn_l":"0741-2223","issn":["0741-2223","1097-4563"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Robotic Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1482282870","https://openalex.org/W1970949506","https://openalex.org/W2063169100","https://openalex.org/W2090189305","https://openalex.org/W2111244700","https://openalex.org/W2113105635","https://openalex.org/W2131199482","https://openalex.org/W2131699845","https://openalex.org/W2151645094","https://openalex.org/W2160645305","https://openalex.org/W2165504976","https://openalex.org/W2170810291","https://openalex.org/W2333535550","https://openalex.org/W4206754465","https://openalex.org/W4401409847"],"related_works":["https://openalex.org/W2937059810","https://openalex.org/W1586515950","https://openalex.org/W2379349345","https://openalex.org/W2382974548","https://openalex.org/W1976256054","https://openalex.org/W3086805279","https://openalex.org/W2135219659","https://openalex.org/W2760584304","https://openalex.org/W2358965113","https://openalex.org/W2348791067"],"abstract_inverted_index":{"Abstract":[0],"An":[1],"approach":[2],"to":[3,11,20,28,46,59,97,121,192,202],"optimal":[4,41,178],"assignment":[5,43,117,149,179],"of":[6,35,38,57,80,118,135,206],"tasks":[7,75,82,120],"with":[8,180],"precedence":[9],"relationships":[10],"multiple":[12],"robots":[13,17],"is":[14,44,87,94,129,184],"proposed.":[15],"The":[16,40,78],"are":[18,76,189,200],"assumed":[19],"share":[21],"a":[22,30,36,90,99,114,125,159,172],"common":[23],"workspace":[24],"and":[25,124],"work":[26],"cooperatively":[27],"accomplish":[29],"given":[31],"process":[32,85],"plan":[33,62,86],"consisting":[34],"set":[37],"tasks.":[39],"task":[42,148],"defined":[45],"be":[47,151],"the":[48,54,61,64,73,81,84,110,119,122,133,136,155,164,168,177,181,195,204,207],"one":[49],"that":[50,66],"results":[51,199],"in":[52,83,109,158],"spending":[53],"least":[55],"amount":[56],"time":[58],"complete":[60],"under":[63],"criterion":[65],"no":[67],"robot":[68,144],"collision":[69],"will":[70],"occur":[71],"when":[72],"assigned":[74],"performed.":[77],"ordering":[79],"described":[88],"by":[89,153,163],"topological":[91],"tree,":[92],"which":[93],"then":[95],"expanded":[96,111],"form":[98],"larger":[100],"state\u2010space":[101],"tree":[102,105,112],"without":[103],"redundant":[104],"paths.":[106],"Each":[107],"path":[108,157],"represents":[113],"partially":[115],"developed":[116],"robots,":[123],"graph":[126,161],"formulation":[127],"scheme":[128],"presented":[130],"for":[131,142,175],"estimating":[132],"cost":[134,183],"assignment.":[137],"A":[138,169],"collision\u2010free":[139],"motion":[140],"schedule":[141],"each":[143,147],"based":[145],"on":[146],"can":[150],"obtained":[152],"finding":[154,176],"minimaximal":[156],"disjunctive":[160],"formulated":[162],"scheme.":[165],"By":[166],"using":[167],"*":[170],"algorithm,":[171],"search":[173,196],"method":[174],"minimum":[182],"presented.":[185],"Some":[186],"heuristic":[187],"rules":[188],"also":[190],"proposed":[191,208],"speed":[193],"up":[194],"process.":[197],"Simulation":[198],"illustrated":[201],"show":[203],"effectiveness":[205],"approach.":[209],"\u00a9":[210],"1995":[211],"John":[212],"Wiley":[213],"&":[214],"Sons,":[215],"Inc.":[216]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-23T06:36:01.041984","created_date":"2025-10-10T00:00:00"}