The topology of look-compute-move robot wait-free algorithms with hard termination
Abstract Look-Compute-Move models for a set of autonomous robots have been thoroughly studied for over two decades. We consider the standard Asynchronous Luminous Robots (ALR) model, where robots are located in a graph G. Each robot, repeatedly Looks at its surroundings and obtains a snapshot contai...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Alcántara, Manuel [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2018 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer-Verlag GmbH Germany, part of Springer Nature 2018 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Distributed computing - Springer Berlin Heidelberg, 1986, 32(2018), 3 vom: 15. Dez., Seite 235-255 |
|---|---|
| Übergeordnetes Werk: |
volume:32 ; year:2018 ; number:3 ; day:15 ; month:12 ; pages:235-255 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00446-018-0345-3 |
|---|
| Katalog-ID: |
OLC2054812331 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2054812331 | ||
| 003 | DE-627 | ||
| 005 | 20230403073114.0 | ||
| 007 | tu | ||
| 008 | 200819s2018 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00446-018-0345-3 |2 doi | |
| 035 | |a (DE-627)OLC2054812331 | ||
| 035 | |a (DE-He213)s00446-018-0345-3-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 082 | 0 | 4 | |a 620 |q VZ |
| 100 | 1 | |a Alcántara, Manuel |e verfasserin |0 (orcid)0000-0001-6551-8300 |4 aut | |
| 245 | 1 | 0 | |a The topology of look-compute-move robot wait-free algorithms with hard termination |
| 264 | 1 | |c 2018 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer-Verlag GmbH Germany, part of Springer Nature 2018 | ||
| 520 | |a Abstract Look-Compute-Move models for a set of autonomous robots have been thoroughly studied for over two decades. We consider the standard Asynchronous Luminous Robots (ALR) model, where robots are located in a graph G. Each robot, repeatedly Looks at its surroundings and obtains a snapshot containing the vertices of G, where all robots are located; based on this snapshot, each robot Computes a vertex (adjacent to its current position), and then Moves to it. Robots have visible lights, allowing them to communicate more information than only its actual position, and they move asynchronously, meaning that each one runs at its own arbitrary speed. We are also interested in a case which has been barely explored: the robots need not all be present initially, they might appear asynchronously. We call this the Extended Asynchronous Appearing Luminous Robots (EALR) model. A central problem in the mobile robots area is bringing the robots to the same vertex. We study several versions of this problem, where the robots move towards the same (or close to each other) vertices. And we concentrate on the requirement that each robot executes a finite number of Look-Compute-Move cycles, independently of the interleaving of other robot’s cycles, and then stops. Our main result is direct connections between the (ALR and) EALR model and the asynchronous wait-free multiprocess read/write shared memory (WFSM) model. General robot tasks in a graph are also provided, which include several version of gathering. Finally, using the connection between the EALR model and the WFSM model, a combinatorial topology characterization for the solvable robot tasks is presented. | ||
| 650 | 4 | |a Mobile robots | |
| 650 | 4 | |a Decentralized algorithms for robots | |
| 650 | 4 | |a Gathering | |
| 650 | 4 | |a Rendezvous | |
| 650 | 4 | |a Fault tolerance | |
| 650 | 4 | |a Termination | |
| 650 | 4 | |a Wait-free computing | |
| 700 | 1 | |a Castañeda, Armando |4 aut | |
| 700 | 1 | |a Flores-Peñaloza, David |4 aut | |
| 700 | 1 | |a Rajsbaum, Sergio |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Distributed computing |d Springer Berlin Heidelberg, 1986 |g 32(2018), 3 vom: 15. Dez., Seite 235-255 |w (DE-627)13042885X |w (DE-600)635600-X |w (DE-576)01592789X |x 0178-2770 |7 nnns |
| 773 | 1 | 8 | |g volume:32 |g year:2018 |g number:3 |g day:15 |g month:12 |g pages:235-255 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00446-018-0345-3 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_2244 | ||
| 912 | |a GBV_ILN_4126 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4318 | ||
| 912 | |a GBV_ILN_4319 | ||
| 951 | |a AR | ||
| 952 | |d 32 |j 2018 |e 3 |b 15 |c 12 |h 235-255 | ||
| author_variant |
m a ma a c ac d f p dfp s r sr |
|---|---|
| matchkey_str |
article:01782770:2018----::htplgolocmueoeoowifeagrtm |
| hierarchy_sort_str |
2018 |
| publishDate |
2018 |
| allfields |
10.1007/s00446-018-0345-3 doi (DE-627)OLC2054812331 (DE-He213)s00446-018-0345-3-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Alcántara, Manuel verfasserin (orcid)0000-0001-6551-8300 aut The topology of look-compute-move robot wait-free algorithms with hard termination 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract Look-Compute-Move models for a set of autonomous robots have been thoroughly studied for over two decades. We consider the standard Asynchronous Luminous Robots (ALR) model, where robots are located in a graph G. Each robot, repeatedly Looks at its surroundings and obtains a snapshot containing the vertices of G, where all robots are located; based on this snapshot, each robot Computes a vertex (adjacent to its current position), and then Moves to it. Robots have visible lights, allowing them to communicate more information than only its actual position, and they move asynchronously, meaning that each one runs at its own arbitrary speed. We are also interested in a case which has been barely explored: the robots need not all be present initially, they might appear asynchronously. We call this the Extended Asynchronous Appearing Luminous Robots (EALR) model. A central problem in the mobile robots area is bringing the robots to the same vertex. We study several versions of this problem, where the robots move towards the same (or close to each other) vertices. And we concentrate on the requirement that each robot executes a finite number of Look-Compute-Move cycles, independently of the interleaving of other robot’s cycles, and then stops. Our main result is direct connections between the (ALR and) EALR model and the asynchronous wait-free multiprocess read/write shared memory (WFSM) model. General robot tasks in a graph are also provided, which include several version of gathering. Finally, using the connection between the EALR model and the WFSM model, a combinatorial topology characterization for the solvable robot tasks is presented. Mobile robots Decentralized algorithms for robots Gathering Rendezvous Fault tolerance Termination Wait-free computing Castañeda, Armando aut Flores-Peñaloza, David aut Rajsbaum, Sergio aut Enthalten in Distributed computing Springer Berlin Heidelberg, 1986 32(2018), 3 vom: 15. Dez., Seite 235-255 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:32 year:2018 number:3 day:15 month:12 pages:235-255 https://doi.org/10.1007/s00446-018-0345-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 AR 32 2018 3 15 12 235-255 |
| spelling |
10.1007/s00446-018-0345-3 doi (DE-627)OLC2054812331 (DE-He213)s00446-018-0345-3-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Alcántara, Manuel verfasserin (orcid)0000-0001-6551-8300 aut The topology of look-compute-move robot wait-free algorithms with hard termination 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract Look-Compute-Move models for a set of autonomous robots have been thoroughly studied for over two decades. We consider the standard Asynchronous Luminous Robots (ALR) model, where robots are located in a graph G. Each robot, repeatedly Looks at its surroundings and obtains a snapshot containing the vertices of G, where all robots are located; based on this snapshot, each robot Computes a vertex (adjacent to its current position), and then Moves to it. Robots have visible lights, allowing them to communicate more information than only its actual position, and they move asynchronously, meaning that each one runs at its own arbitrary speed. We are also interested in a case which has been barely explored: the robots need not all be present initially, they might appear asynchronously. We call this the Extended Asynchronous Appearing Luminous Robots (EALR) model. A central problem in the mobile robots area is bringing the robots to the same vertex. We study several versions of this problem, where the robots move towards the same (or close to each other) vertices. And we concentrate on the requirement that each robot executes a finite number of Look-Compute-Move cycles, independently of the interleaving of other robot’s cycles, and then stops. Our main result is direct connections between the (ALR and) EALR model and the asynchronous wait-free multiprocess read/write shared memory (WFSM) model. General robot tasks in a graph are also provided, which include several version of gathering. Finally, using the connection between the EALR model and the WFSM model, a combinatorial topology characterization for the solvable robot tasks is presented. Mobile robots Decentralized algorithms for robots Gathering Rendezvous Fault tolerance Termination Wait-free computing Castañeda, Armando aut Flores-Peñaloza, David aut Rajsbaum, Sergio aut Enthalten in Distributed computing Springer Berlin Heidelberg, 1986 32(2018), 3 vom: 15. Dez., Seite 235-255 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:32 year:2018 number:3 day:15 month:12 pages:235-255 https://doi.org/10.1007/s00446-018-0345-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 AR 32 2018 3 15 12 235-255 |
| allfields_unstemmed |
10.1007/s00446-018-0345-3 doi (DE-627)OLC2054812331 (DE-He213)s00446-018-0345-3-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Alcántara, Manuel verfasserin (orcid)0000-0001-6551-8300 aut The topology of look-compute-move robot wait-free algorithms with hard termination 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract Look-Compute-Move models for a set of autonomous robots have been thoroughly studied for over two decades. We consider the standard Asynchronous Luminous Robots (ALR) model, where robots are located in a graph G. Each robot, repeatedly Looks at its surroundings and obtains a snapshot containing the vertices of G, where all robots are located; based on this snapshot, each robot Computes a vertex (adjacent to its current position), and then Moves to it. Robots have visible lights, allowing them to communicate more information than only its actual position, and they move asynchronously, meaning that each one runs at its own arbitrary speed. We are also interested in a case which has been barely explored: the robots need not all be present initially, they might appear asynchronously. We call this the Extended Asynchronous Appearing Luminous Robots (EALR) model. A central problem in the mobile robots area is bringing the robots to the same vertex. We study several versions of this problem, where the robots move towards the same (or close to each other) vertices. And we concentrate on the requirement that each robot executes a finite number of Look-Compute-Move cycles, independently of the interleaving of other robot’s cycles, and then stops. Our main result is direct connections between the (ALR and) EALR model and the asynchronous wait-free multiprocess read/write shared memory (WFSM) model. General robot tasks in a graph are also provided, which include several version of gathering. Finally, using the connection between the EALR model and the WFSM model, a combinatorial topology characterization for the solvable robot tasks is presented. Mobile robots Decentralized algorithms for robots Gathering Rendezvous Fault tolerance Termination Wait-free computing Castañeda, Armando aut Flores-Peñaloza, David aut Rajsbaum, Sergio aut Enthalten in Distributed computing Springer Berlin Heidelberg, 1986 32(2018), 3 vom: 15. Dez., Seite 235-255 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:32 year:2018 number:3 day:15 month:12 pages:235-255 https://doi.org/10.1007/s00446-018-0345-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 AR 32 2018 3 15 12 235-255 |
| allfieldsGer |
10.1007/s00446-018-0345-3 doi (DE-627)OLC2054812331 (DE-He213)s00446-018-0345-3-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Alcántara, Manuel verfasserin (orcid)0000-0001-6551-8300 aut The topology of look-compute-move robot wait-free algorithms with hard termination 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract Look-Compute-Move models for a set of autonomous robots have been thoroughly studied for over two decades. We consider the standard Asynchronous Luminous Robots (ALR) model, where robots are located in a graph G. Each robot, repeatedly Looks at its surroundings and obtains a snapshot containing the vertices of G, where all robots are located; based on this snapshot, each robot Computes a vertex (adjacent to its current position), and then Moves to it. Robots have visible lights, allowing them to communicate more information than only its actual position, and they move asynchronously, meaning that each one runs at its own arbitrary speed. We are also interested in a case which has been barely explored: the robots need not all be present initially, they might appear asynchronously. We call this the Extended Asynchronous Appearing Luminous Robots (EALR) model. A central problem in the mobile robots area is bringing the robots to the same vertex. We study several versions of this problem, where the robots move towards the same (or close to each other) vertices. And we concentrate on the requirement that each robot executes a finite number of Look-Compute-Move cycles, independently of the interleaving of other robot’s cycles, and then stops. Our main result is direct connections between the (ALR and) EALR model and the asynchronous wait-free multiprocess read/write shared memory (WFSM) model. General robot tasks in a graph are also provided, which include several version of gathering. Finally, using the connection between the EALR model and the WFSM model, a combinatorial topology characterization for the solvable robot tasks is presented. Mobile robots Decentralized algorithms for robots Gathering Rendezvous Fault tolerance Termination Wait-free computing Castañeda, Armando aut Flores-Peñaloza, David aut Rajsbaum, Sergio aut Enthalten in Distributed computing Springer Berlin Heidelberg, 1986 32(2018), 3 vom: 15. Dez., Seite 235-255 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:32 year:2018 number:3 day:15 month:12 pages:235-255 https://doi.org/10.1007/s00446-018-0345-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 AR 32 2018 3 15 12 235-255 |
| allfieldsSound |
10.1007/s00446-018-0345-3 doi (DE-627)OLC2054812331 (DE-He213)s00446-018-0345-3-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Alcántara, Manuel verfasserin (orcid)0000-0001-6551-8300 aut The topology of look-compute-move robot wait-free algorithms with hard termination 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract Look-Compute-Move models for a set of autonomous robots have been thoroughly studied for over two decades. We consider the standard Asynchronous Luminous Robots (ALR) model, where robots are located in a graph G. Each robot, repeatedly Looks at its surroundings and obtains a snapshot containing the vertices of G, where all robots are located; based on this snapshot, each robot Computes a vertex (adjacent to its current position), and then Moves to it. Robots have visible lights, allowing them to communicate more information than only its actual position, and they move asynchronously, meaning that each one runs at its own arbitrary speed. We are also interested in a case which has been barely explored: the robots need not all be present initially, they might appear asynchronously. We call this the Extended Asynchronous Appearing Luminous Robots (EALR) model. A central problem in the mobile robots area is bringing the robots to the same vertex. We study several versions of this problem, where the robots move towards the same (or close to each other) vertices. And we concentrate on the requirement that each robot executes a finite number of Look-Compute-Move cycles, independently of the interleaving of other robot’s cycles, and then stops. Our main result is direct connections between the (ALR and) EALR model and the asynchronous wait-free multiprocess read/write shared memory (WFSM) model. General robot tasks in a graph are also provided, which include several version of gathering. Finally, using the connection between the EALR model and the WFSM model, a combinatorial topology characterization for the solvable robot tasks is presented. Mobile robots Decentralized algorithms for robots Gathering Rendezvous Fault tolerance Termination Wait-free computing Castañeda, Armando aut Flores-Peñaloza, David aut Rajsbaum, Sergio aut Enthalten in Distributed computing Springer Berlin Heidelberg, 1986 32(2018), 3 vom: 15. Dez., Seite 235-255 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:32 year:2018 number:3 day:15 month:12 pages:235-255 https://doi.org/10.1007/s00446-018-0345-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 AR 32 2018 3 15 12 235-255 |
| language |
English |
| source |
Enthalten in Distributed computing 32(2018), 3 vom: 15. Dez., Seite 235-255 volume:32 year:2018 number:3 day:15 month:12 pages:235-255 |
| sourceStr |
Enthalten in Distributed computing 32(2018), 3 vom: 15. Dez., Seite 235-255 volume:32 year:2018 number:3 day:15 month:12 pages:235-255 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Mobile robots Decentralized algorithms for robots Gathering Rendezvous Fault tolerance Termination Wait-free computing |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Distributed computing |
| authorswithroles_txt_mv |
Alcántara, Manuel @@aut@@ Castañeda, Armando @@aut@@ Flores-Peñaloza, David @@aut@@ Rajsbaum, Sergio @@aut@@ |
| publishDateDaySort_date |
2018-12-15T00:00:00Z |
| hierarchy_top_id |
13042885X |
| dewey-sort |
14 |
| id |
OLC2054812331 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2054812331</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230403073114.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2018 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00446-018-0345-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054812331</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00446-018-0345-3-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Alcántara, Manuel</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0001-6551-8300</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The topology of look-compute-move robot wait-free algorithms with hard termination</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag GmbH Germany, part of Springer Nature 2018</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Look-Compute-Move models for a set of autonomous robots have been thoroughly studied for over two decades. We consider the standard Asynchronous Luminous Robots (ALR) model, where robots are located in a graph G. Each robot, repeatedly Looks at its surroundings and obtains a snapshot containing the vertices of G, where all robots are located; based on this snapshot, each robot Computes a vertex (adjacent to its current position), and then Moves to it. Robots have visible lights, allowing them to communicate more information than only its actual position, and they move asynchronously, meaning that each one runs at its own arbitrary speed. We are also interested in a case which has been barely explored: the robots need not all be present initially, they might appear asynchronously. We call this the Extended Asynchronous Appearing Luminous Robots (EALR) model. A central problem in the mobile robots area is bringing the robots to the same vertex. We study several versions of this problem, where the robots move towards the same (or close to each other) vertices. And we concentrate on the requirement that each robot executes a finite number of Look-Compute-Move cycles, independently of the interleaving of other robot’s cycles, and then stops. Our main result is direct connections between the (ALR and) EALR model and the asynchronous wait-free multiprocess read/write shared memory (WFSM) model. General robot tasks in a graph are also provided, which include several version of gathering. Finally, using the connection between the EALR model and the WFSM model, a combinatorial topology characterization for the solvable robot tasks is presented.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mobile robots</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decentralized algorithms for robots</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gathering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rendezvous</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault tolerance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Termination</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Wait-free computing</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Castañeda, Armando</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Flores-Peñaloza, David</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rajsbaum, Sergio</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Distributed computing</subfield><subfield code="d">Springer Berlin Heidelberg, 1986</subfield><subfield code="g">32(2018), 3 vom: 15. Dez., Seite 235-255</subfield><subfield code="w">(DE-627)13042885X</subfield><subfield code="w">(DE-600)635600-X</subfield><subfield code="w">(DE-576)01592789X</subfield><subfield code="x">0178-2770</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:32</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:3</subfield><subfield code="g">day:15</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:235-255</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00446-018-0345-3</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">32</subfield><subfield code="j">2018</subfield><subfield code="e">3</subfield><subfield code="b">15</subfield><subfield code="c">12</subfield><subfield code="h">235-255</subfield></datafield></record></collection>
|
| author |
Alcántara, Manuel |
| spellingShingle |
Alcántara, Manuel ddc 004 ddc 620 misc Mobile robots misc Decentralized algorithms for robots misc Gathering misc Rendezvous misc Fault tolerance misc Termination misc Wait-free computing The topology of look-compute-move robot wait-free algorithms with hard termination |
| authorStr |
Alcántara, Manuel |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)13042885X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0178-2770 |
| topic_title |
004 VZ 620 VZ The topology of look-compute-move robot wait-free algorithms with hard termination Mobile robots Decentralized algorithms for robots Gathering Rendezvous Fault tolerance Termination Wait-free computing |
| topic |
ddc 004 ddc 620 misc Mobile robots misc Decentralized algorithms for robots misc Gathering misc Rendezvous misc Fault tolerance misc Termination misc Wait-free computing |
| topic_unstemmed |
ddc 004 ddc 620 misc Mobile robots misc Decentralized algorithms for robots misc Gathering misc Rendezvous misc Fault tolerance misc Termination misc Wait-free computing |
| topic_browse |
ddc 004 ddc 620 misc Mobile robots misc Decentralized algorithms for robots misc Gathering misc Rendezvous misc Fault tolerance misc Termination misc Wait-free computing |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Distributed computing |
| hierarchy_parent_id |
13042885X |
| dewey-tens |
000 - Computer science, knowledge & systems 620 - Engineering |
| hierarchy_top_title |
Distributed computing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)13042885X (DE-600)635600-X (DE-576)01592789X |
| title |
The topology of look-compute-move robot wait-free algorithms with hard termination |
| ctrlnum |
(DE-627)OLC2054812331 (DE-He213)s00446-018-0345-3-p |
| title_full |
The topology of look-compute-move robot wait-free algorithms with hard termination |
| author_sort |
Alcántara, Manuel |
| journal |
Distributed computing |
| journalStr |
Distributed computing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2018 |
| contenttype_str_mv |
txt |
| container_start_page |
235 |
| author_browse |
Alcántara, Manuel Castañeda, Armando Flores-Peñaloza, David Rajsbaum, Sergio |
| container_volume |
32 |
| class |
004 VZ 620 VZ |
| format_se |
Aufsätze |
| author-letter |
Alcántara, Manuel |
| doi_str_mv |
10.1007/s00446-018-0345-3 |
| normlink |
(ORCID)0000-0001-6551-8300 |
| normlink_prefix_str_mv |
(orcid)0000-0001-6551-8300 |
| dewey-full |
004 620 |
| title_sort |
the topology of look-compute-move robot wait-free algorithms with hard termination |
| title_auth |
The topology of look-compute-move robot wait-free algorithms with hard termination |
| abstract |
Abstract Look-Compute-Move models for a set of autonomous robots have been thoroughly studied for over two decades. We consider the standard Asynchronous Luminous Robots (ALR) model, where robots are located in a graph G. Each robot, repeatedly Looks at its surroundings and obtains a snapshot containing the vertices of G, where all robots are located; based on this snapshot, each robot Computes a vertex (adjacent to its current position), and then Moves to it. Robots have visible lights, allowing them to communicate more information than only its actual position, and they move asynchronously, meaning that each one runs at its own arbitrary speed. We are also interested in a case which has been barely explored: the robots need not all be present initially, they might appear asynchronously. We call this the Extended Asynchronous Appearing Luminous Robots (EALR) model. A central problem in the mobile robots area is bringing the robots to the same vertex. We study several versions of this problem, where the robots move towards the same (or close to each other) vertices. And we concentrate on the requirement that each robot executes a finite number of Look-Compute-Move cycles, independently of the interleaving of other robot’s cycles, and then stops. Our main result is direct connections between the (ALR and) EALR model and the asynchronous wait-free multiprocess read/write shared memory (WFSM) model. General robot tasks in a graph are also provided, which include several version of gathering. Finally, using the connection between the EALR model and the WFSM model, a combinatorial topology characterization for the solvable robot tasks is presented. © Springer-Verlag GmbH Germany, part of Springer Nature 2018 |
| abstractGer |
Abstract Look-Compute-Move models for a set of autonomous robots have been thoroughly studied for over two decades. We consider the standard Asynchronous Luminous Robots (ALR) model, where robots are located in a graph G. Each robot, repeatedly Looks at its surroundings and obtains a snapshot containing the vertices of G, where all robots are located; based on this snapshot, each robot Computes a vertex (adjacent to its current position), and then Moves to it. Robots have visible lights, allowing them to communicate more information than only its actual position, and they move asynchronously, meaning that each one runs at its own arbitrary speed. We are also interested in a case which has been barely explored: the robots need not all be present initially, they might appear asynchronously. We call this the Extended Asynchronous Appearing Luminous Robots (EALR) model. A central problem in the mobile robots area is bringing the robots to the same vertex. We study several versions of this problem, where the robots move towards the same (or close to each other) vertices. And we concentrate on the requirement that each robot executes a finite number of Look-Compute-Move cycles, independently of the interleaving of other robot’s cycles, and then stops. Our main result is direct connections between the (ALR and) EALR model and the asynchronous wait-free multiprocess read/write shared memory (WFSM) model. General robot tasks in a graph are also provided, which include several version of gathering. Finally, using the connection between the EALR model and the WFSM model, a combinatorial topology characterization for the solvable robot tasks is presented. © Springer-Verlag GmbH Germany, part of Springer Nature 2018 |
| abstract_unstemmed |
Abstract Look-Compute-Move models for a set of autonomous robots have been thoroughly studied for over two decades. We consider the standard Asynchronous Luminous Robots (ALR) model, where robots are located in a graph G. Each robot, repeatedly Looks at its surroundings and obtains a snapshot containing the vertices of G, where all robots are located; based on this snapshot, each robot Computes a vertex (adjacent to its current position), and then Moves to it. Robots have visible lights, allowing them to communicate more information than only its actual position, and they move asynchronously, meaning that each one runs at its own arbitrary speed. We are also interested in a case which has been barely explored: the robots need not all be present initially, they might appear asynchronously. We call this the Extended Asynchronous Appearing Luminous Robots (EALR) model. A central problem in the mobile robots area is bringing the robots to the same vertex. We study several versions of this problem, where the robots move towards the same (or close to each other) vertices. And we concentrate on the requirement that each robot executes a finite number of Look-Compute-Move cycles, independently of the interleaving of other robot’s cycles, and then stops. Our main result is direct connections between the (ALR and) EALR model and the asynchronous wait-free multiprocess read/write shared memory (WFSM) model. General robot tasks in a graph are also provided, which include several version of gathering. Finally, using the connection between the EALR model and the WFSM model, a combinatorial topology characterization for the solvable robot tasks is presented. © Springer-Verlag GmbH Germany, part of Springer Nature 2018 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 |
| container_issue |
3 |
| title_short |
The topology of look-compute-move robot wait-free algorithms with hard termination |
| url |
https://doi.org/10.1007/s00446-018-0345-3 |
| remote_bool |
false |
| author2 |
Castañeda, Armando Flores-Peñaloza, David Rajsbaum, Sergio |
| author2Str |
Castañeda, Armando Flores-Peñaloza, David Rajsbaum, Sergio |
| ppnlink |
13042885X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00446-018-0345-3 |
| up_date |
2024-07-04T00:28:49.553Z |
| _version_ |
1803606220661063680 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2054812331</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230403073114.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2018 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00446-018-0345-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054812331</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00446-018-0345-3-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Alcántara, Manuel</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0001-6551-8300</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The topology of look-compute-move robot wait-free algorithms with hard termination</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag GmbH Germany, part of Springer Nature 2018</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Look-Compute-Move models for a set of autonomous robots have been thoroughly studied for over two decades. We consider the standard Asynchronous Luminous Robots (ALR) model, where robots are located in a graph G. Each robot, repeatedly Looks at its surroundings and obtains a snapshot containing the vertices of G, where all robots are located; based on this snapshot, each robot Computes a vertex (adjacent to its current position), and then Moves to it. Robots have visible lights, allowing them to communicate more information than only its actual position, and they move asynchronously, meaning that each one runs at its own arbitrary speed. We are also interested in a case which has been barely explored: the robots need not all be present initially, they might appear asynchronously. We call this the Extended Asynchronous Appearing Luminous Robots (EALR) model. A central problem in the mobile robots area is bringing the robots to the same vertex. We study several versions of this problem, where the robots move towards the same (or close to each other) vertices. And we concentrate on the requirement that each robot executes a finite number of Look-Compute-Move cycles, independently of the interleaving of other robot’s cycles, and then stops. Our main result is direct connections between the (ALR and) EALR model and the asynchronous wait-free multiprocess read/write shared memory (WFSM) model. General robot tasks in a graph are also provided, which include several version of gathering. Finally, using the connection between the EALR model and the WFSM model, a combinatorial topology characterization for the solvable robot tasks is presented.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mobile robots</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decentralized algorithms for robots</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gathering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rendezvous</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault tolerance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Termination</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Wait-free computing</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Castañeda, Armando</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Flores-Peñaloza, David</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rajsbaum, Sergio</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Distributed computing</subfield><subfield code="d">Springer Berlin Heidelberg, 1986</subfield><subfield code="g">32(2018), 3 vom: 15. Dez., Seite 235-255</subfield><subfield code="w">(DE-627)13042885X</subfield><subfield code="w">(DE-600)635600-X</subfield><subfield code="w">(DE-576)01592789X</subfield><subfield code="x">0178-2770</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:32</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:3</subfield><subfield code="g">day:15</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:235-255</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00446-018-0345-3</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">32</subfield><subfield code="j">2018</subfield><subfield code="e">3</subfield><subfield code="b">15</subfield><subfield code="c">12</subfield><subfield code="h">235-255</subfield></datafield></record></collection>
|
| score |
7.3998375 |