{"id":"https://openalex.org/W7100145174","doi":null,"title":"Task Insertion and Reassignment in Networked Robots for Topological","display_name":"Task Insertion and Reassignment in Networked Robots for Topological","publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7100145174"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.726.1809","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.726.1809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://robotics.usc.edu/%7Elantao/publications/morphing10_wshp.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7100145174"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5101917996","display_name":"Lantao Liu","orcid":"https://orcid.org/0000-0002-6796-6817","observed_orcids":["https://orcid.org/0000-0002-6796-6817"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lantao Liu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Dylan Shell","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dylan Shell","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.5692999958992004,"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"}},"topics":[{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.5692999958992004,"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.23170000314712524,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.08380000293254852,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/task-reassignment","display_name":"task reassignment","score":0.875},{"id":"https://openalex.org/keywords/networked-robots","display_name":"networked robots","score":0.7960000038146973},{"id":"https://openalex.org/keywords/bipartite-matching","display_name":"bipartite matching","score":0.8619999885559082},{"id":"https://openalex.org/keywords/hungarian-algorithm","display_name":"Hungarian algorithm","score":0.9950000047683716},{"id":"https://openalex.org/keywords/path-routing","display_name":"path routing","score":0.8019999861717224},{"id":"https://openalex.org/keywords/robot-deployment","display_name":"robot deployment","score":0.6769999861717224},{"id":"https://openalex.org/keywords/signal-strength","display_name":"signal strength","score":0.5730000138282776},{"id":"https://openalex.org/keywords/sparse-graphs","display_name":"sparse graphs","score":0.6460000276565552},{"id":"https://openalex.org/keywords/limited-communication","display_name":"limited communication","score":0.6370000243186951},{"id":"https://openalex.org/keywords/optimization-criteria","display_name":"optimization criteria","score":0.4429999887943268}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7778000235557556},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7045999765396118},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6503999829292297},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5771999955177307},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5300999879837036},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4999000132083893},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4837000072002411},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.4742000102996826},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4641999900341034},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.460999995470047},{"id":"https://openalex.org/C50637493","wikidata":"https://www.wikidata.org/wiki/Q1136781","display_name":"Morphing","level":2,"score":0.4595000147819519},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.45500001311302185},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4056999981403351},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.391400009393692},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3702000081539154},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3666999936103821},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.3483000099658966},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3449000120162964},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3393999934196472},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.3391000032424927},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3353999853134155},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3228999972343445},{"id":"https://openalex.org/C21785340","wikidata":"https://www.wikidata.org/wiki/Q281922","display_name":"Hungarian algorithm","level":3,"score":0.3176000118255615},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.31349998712539673},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3037000000476837},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.29159998893737793},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2824999988079071},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.2815000116825104},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.2694999873638153},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.265500009059906},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.26190000772476196},{"id":"https://openalex.org/C111852164","wikidata":"https://www.wikidata.org/wiki/Q1414679","display_name":"Handover","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.2531000077724457},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.2522999942302704}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.726.1809","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.726.1809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://robotics.usc.edu/%7Elantao/publications/morphing10_wshp.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2148587452","https://openalex.org/W2021431021","https://openalex.org/W2295927337","https://openalex.org/W2276505282","https://openalex.org/W3023013592","https://openalex.org/W4210669081","https://openalex.org/W2019754108","https://openalex.org/W148261690","https://openalex.org/W2618479943","https://openalex.org/W4232113674"],"abstract_inverted_index":{"Abstract":[0],"\u2014":[1],"This":[2],"paper":[3],"considers":[4],"a":[5,22,31,75,101,159],"particular":[6,160],"form":[7],"of":[8,24,56,79,124,201],"incre-mental":[9],"assignment":[10,27,65,84],"problem":[11,28],"that":[12,72,188],"can":[13,132,150],"be":[14,133,151,183],"used":[15,154],"to":[16,46,61,103,116,136,169,182,199],"achieve":[17],"efficient":[18,90],"topological":[19],"morphing":[20],"in":[21,34,88,141],"network":[23],"robots.":[25],"The":[26,83,98,130,162],"arises":[29],"from":[30,108,158],"task-allocation":[32],"formulation":[33],"which":[35,142,170],"destination":[36],"locations":[37],"for":[38,155,193],"newly":[39],"deployed":[40],"robots":[41,146,202],"are":[42,96,175],"added":[43],"as":[44],"tasks":[45],"an":[47,89],"existing":[48],"allocation.":[49],"We":[50],"adapt":[51],"the":[52,57,63,80,105,121,167,189],"bipartite":[53],"matching":[54],"variant":[55],"Hungarian":[58,81],"algorithm\u2014originally":[59],"designed":[60],"solve":[62],"optimal":[64],"problem\u2014to":[66],"perform":[67],"path":[68],"routing":[69],"by":[70],"showing":[71],"there":[73],"is":[74,85],"three-dimensional":[76],"spatial":[77],"interpre-tation":[78],"graph.":[82],"globally":[86],"reallocated":[87],"manner":[91],"when":[92],"new":[93],"agent-task":[94],"pairs":[95],"inserted.":[97],"algorithm":[99,131,190],"uses":[100],"parameter":[102],"adjust":[104],"optimization":[106,164],"criterion:":[107],"minimizing":[109,117],"global":[110],"time":[111],"(or":[112],"energy,":[113],"or":[114],"distance),":[115],"disruption":[118],"(i.e.,":[119],"obtaining":[120],"fewest":[122],"number":[123],"robot":[125,139],"reassignments),":[126],"and":[127,153],"mixtures":[128],"in-between.":[129],"directly":[134],"applied":[135],"wirelessly":[137],"networked":[138],"systems":[140],"graph":[143],"edges":[144],"reflect":[145],"whose":[147],"signal":[148],"strength":[149],"measured":[152],"gradient-based":[156],"traversal":[157],"node.":[161],"adjustable":[163],"criterion":[165],"permits":[166],"degree":[168],"potentially":[171],"unreliable":[172],"long":[173],"traversals":[174,181],"favored":[176],"over":[177],"more":[178],"costly":[179],"short":[180],"tuned.":[184],"Our":[185],"results":[186],"suggest":[187],"works":[191],"well":[192],"sparse":[194],"graphs":[195],"making":[196],"it":[197],"well-suited":[198],"networks":[200],"with":[203],"limited":[204],"communication.":[205],"I.":[206]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}