The simple grid polygon exploration problem
Abstract This paper considers an on-line exploration problem. We use a mobile robot to explore an unknown simple grid polygon. The robot is assumed to have limited sensing capability that can only detect the four basic cells adjacent to it. The robot’s task is to explore each cell and to return to t...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Wei, Qi [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2021 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of combinatorial optimization - Springer US, 1997, 41(2021), 3 vom: 03. Feb., Seite 625-639 |
|---|---|
| Übergeordnetes Werk: |
volume:41 ; year:2021 ; number:3 ; day:03 ; month:02 ; pages:625-639 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10878-021-00705-5 |
|---|
| Katalog-ID: |
OLC2124279947 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2124279947 | ||
| 003 | DE-627 | ||
| 005 | 20230505085019.0 | ||
| 007 | tu | ||
| 008 | 230505s2021 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10878-021-00705-5 |2 doi | |
| 035 | |a (DE-627)OLC2124279947 | ||
| 035 | |a (DE-He213)s10878-021-00705-5-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |q VZ |
| 084 | |a 3,2 |2 ssgn | ||
| 100 | 1 | |a Wei, Qi |e verfasserin |0 (orcid)0000-0002-2326-0601 |4 aut | |
| 245 | 1 | 0 | |a The simple grid polygon exploration problem |
| 264 | 1 | |c 2021 | |
| 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 © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 | ||
| 520 | |a Abstract This paper considers an on-line exploration problem. We use a mobile robot to explore an unknown simple grid polygon. The robot is assumed to have limited sensing capability that can only detect the four basic cells adjacent to it. The robot’s task is to explore each cell and to return to the start. To explore a cell, the robot has to enter it. We ask for a short exploration tour, that is, minimizing the number of multiple-visit cells. The competitive ratio is used to measure the performance of our strategy. It is the ratio between the length of the on-line exploration path and the length of the shortest path achieved with full knowledge of the polygon. As our main result, we present a new on-line exploration strategy and prove that the robot’s path is at most 7/6 times longer than the shortest path. This matches the previously known lower bound. | ||
| 650 | 4 | |a Path planning | |
| 650 | 4 | |a On-line Exploration | |
| 650 | 4 | |a Competitive analysis | |
| 650 | 4 | |a Grid polygon | |
| 650 | 4 | |a Mobile robot | |
| 700 | 1 | |a Sun, Jie |4 aut | |
| 700 | 1 | |a Tan, Xuehou |4 aut | |
| 700 | 1 | |a Yao, Xiaolin |4 aut | |
| 700 | 1 | |a Ren, Yonggong |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of combinatorial optimization |d Springer US, 1997 |g 41(2021), 3 vom: 03. Feb., Seite 625-639 |w (DE-627)216539323 |w (DE-600)1339574-9 |w (DE-576)094421935 |x 1382-6905 |7 nnns |
| 773 | 1 | 8 | |g volume:41 |g year:2021 |g number:3 |g day:03 |g month:02 |g pages:625-639 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10878-021-00705-5 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_2108 | ||
| 951 | |a AR | ||
| 952 | |d 41 |j 2021 |e 3 |b 03 |c 02 |h 625-639 | ||
| author_variant |
q w qw j s js x t xt x y xy y r yr |
|---|---|
| matchkey_str |
article:13826905:2021----::hsmlgiplgnxlr |
| hierarchy_sort_str |
2021 |
| publishDate |
2021 |
| allfields |
10.1007/s10878-021-00705-5 doi (DE-627)OLC2124279947 (DE-He213)s10878-021-00705-5-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Wei, Qi verfasserin (orcid)0000-0002-2326-0601 aut The simple grid polygon exploration problem 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 Abstract This paper considers an on-line exploration problem. We use a mobile robot to explore an unknown simple grid polygon. The robot is assumed to have limited sensing capability that can only detect the four basic cells adjacent to it. The robot’s task is to explore each cell and to return to the start. To explore a cell, the robot has to enter it. We ask for a short exploration tour, that is, minimizing the number of multiple-visit cells. The competitive ratio is used to measure the performance of our strategy. It is the ratio between the length of the on-line exploration path and the length of the shortest path achieved with full knowledge of the polygon. As our main result, we present a new on-line exploration strategy and prove that the robot’s path is at most 7/6 times longer than the shortest path. This matches the previously known lower bound. Path planning On-line Exploration Competitive analysis Grid polygon Mobile robot Sun, Jie aut Tan, Xuehou aut Yao, Xiaolin aut Ren, Yonggong aut Enthalten in Journal of combinatorial optimization Springer US, 1997 41(2021), 3 vom: 03. Feb., Seite 625-639 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:41 year:2021 number:3 day:03 month:02 pages:625-639 https://doi.org/10.1007/s10878-021-00705-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_2108 AR 41 2021 3 03 02 625-639 |
| spelling |
10.1007/s10878-021-00705-5 doi (DE-627)OLC2124279947 (DE-He213)s10878-021-00705-5-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Wei, Qi verfasserin (orcid)0000-0002-2326-0601 aut The simple grid polygon exploration problem 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 Abstract This paper considers an on-line exploration problem. We use a mobile robot to explore an unknown simple grid polygon. The robot is assumed to have limited sensing capability that can only detect the four basic cells adjacent to it. The robot’s task is to explore each cell and to return to the start. To explore a cell, the robot has to enter it. We ask for a short exploration tour, that is, minimizing the number of multiple-visit cells. The competitive ratio is used to measure the performance of our strategy. It is the ratio between the length of the on-line exploration path and the length of the shortest path achieved with full knowledge of the polygon. As our main result, we present a new on-line exploration strategy and prove that the robot’s path is at most 7/6 times longer than the shortest path. This matches the previously known lower bound. Path planning On-line Exploration Competitive analysis Grid polygon Mobile robot Sun, Jie aut Tan, Xuehou aut Yao, Xiaolin aut Ren, Yonggong aut Enthalten in Journal of combinatorial optimization Springer US, 1997 41(2021), 3 vom: 03. Feb., Seite 625-639 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:41 year:2021 number:3 day:03 month:02 pages:625-639 https://doi.org/10.1007/s10878-021-00705-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_2108 AR 41 2021 3 03 02 625-639 |
| allfields_unstemmed |
10.1007/s10878-021-00705-5 doi (DE-627)OLC2124279947 (DE-He213)s10878-021-00705-5-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Wei, Qi verfasserin (orcid)0000-0002-2326-0601 aut The simple grid polygon exploration problem 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 Abstract This paper considers an on-line exploration problem. We use a mobile robot to explore an unknown simple grid polygon. The robot is assumed to have limited sensing capability that can only detect the four basic cells adjacent to it. The robot’s task is to explore each cell and to return to the start. To explore a cell, the robot has to enter it. We ask for a short exploration tour, that is, minimizing the number of multiple-visit cells. The competitive ratio is used to measure the performance of our strategy. It is the ratio between the length of the on-line exploration path and the length of the shortest path achieved with full knowledge of the polygon. As our main result, we present a new on-line exploration strategy and prove that the robot’s path is at most 7/6 times longer than the shortest path. This matches the previously known lower bound. Path planning On-line Exploration Competitive analysis Grid polygon Mobile robot Sun, Jie aut Tan, Xuehou aut Yao, Xiaolin aut Ren, Yonggong aut Enthalten in Journal of combinatorial optimization Springer US, 1997 41(2021), 3 vom: 03. Feb., Seite 625-639 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:41 year:2021 number:3 day:03 month:02 pages:625-639 https://doi.org/10.1007/s10878-021-00705-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_2108 AR 41 2021 3 03 02 625-639 |
| allfieldsGer |
10.1007/s10878-021-00705-5 doi (DE-627)OLC2124279947 (DE-He213)s10878-021-00705-5-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Wei, Qi verfasserin (orcid)0000-0002-2326-0601 aut The simple grid polygon exploration problem 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 Abstract This paper considers an on-line exploration problem. We use a mobile robot to explore an unknown simple grid polygon. The robot is assumed to have limited sensing capability that can only detect the four basic cells adjacent to it. The robot’s task is to explore each cell and to return to the start. To explore a cell, the robot has to enter it. We ask for a short exploration tour, that is, minimizing the number of multiple-visit cells. The competitive ratio is used to measure the performance of our strategy. It is the ratio between the length of the on-line exploration path and the length of the shortest path achieved with full knowledge of the polygon. As our main result, we present a new on-line exploration strategy and prove that the robot’s path is at most 7/6 times longer than the shortest path. This matches the previously known lower bound. Path planning On-line Exploration Competitive analysis Grid polygon Mobile robot Sun, Jie aut Tan, Xuehou aut Yao, Xiaolin aut Ren, Yonggong aut Enthalten in Journal of combinatorial optimization Springer US, 1997 41(2021), 3 vom: 03. Feb., Seite 625-639 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:41 year:2021 number:3 day:03 month:02 pages:625-639 https://doi.org/10.1007/s10878-021-00705-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_2108 AR 41 2021 3 03 02 625-639 |
| allfieldsSound |
10.1007/s10878-021-00705-5 doi (DE-627)OLC2124279947 (DE-He213)s10878-021-00705-5-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Wei, Qi verfasserin (orcid)0000-0002-2326-0601 aut The simple grid polygon exploration problem 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 Abstract This paper considers an on-line exploration problem. We use a mobile robot to explore an unknown simple grid polygon. The robot is assumed to have limited sensing capability that can only detect the four basic cells adjacent to it. The robot’s task is to explore each cell and to return to the start. To explore a cell, the robot has to enter it. We ask for a short exploration tour, that is, minimizing the number of multiple-visit cells. The competitive ratio is used to measure the performance of our strategy. It is the ratio between the length of the on-line exploration path and the length of the shortest path achieved with full knowledge of the polygon. As our main result, we present a new on-line exploration strategy and prove that the robot’s path is at most 7/6 times longer than the shortest path. This matches the previously known lower bound. Path planning On-line Exploration Competitive analysis Grid polygon Mobile robot Sun, Jie aut Tan, Xuehou aut Yao, Xiaolin aut Ren, Yonggong aut Enthalten in Journal of combinatorial optimization Springer US, 1997 41(2021), 3 vom: 03. Feb., Seite 625-639 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:41 year:2021 number:3 day:03 month:02 pages:625-639 https://doi.org/10.1007/s10878-021-00705-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_2108 AR 41 2021 3 03 02 625-639 |
| language |
English |
| source |
Enthalten in Journal of combinatorial optimization 41(2021), 3 vom: 03. Feb., Seite 625-639 volume:41 year:2021 number:3 day:03 month:02 pages:625-639 |
| sourceStr |
Enthalten in Journal of combinatorial optimization 41(2021), 3 vom: 03. Feb., Seite 625-639 volume:41 year:2021 number:3 day:03 month:02 pages:625-639 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Path planning On-line Exploration Competitive analysis Grid polygon Mobile robot |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Journal of combinatorial optimization |
| authorswithroles_txt_mv |
Wei, Qi @@aut@@ Sun, Jie @@aut@@ Tan, Xuehou @@aut@@ Yao, Xiaolin @@aut@@ Ren, Yonggong @@aut@@ |
| publishDateDaySort_date |
2021-02-03T00:00:00Z |
| hierarchy_top_id |
216539323 |
| dewey-sort |
3510 |
| id |
OLC2124279947 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2124279947</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505085019.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230505s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10878-021-00705-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2124279947</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10878-021-00705-5-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">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wei, Qi</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-2326-0601</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The simple grid polygon exploration problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</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">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper considers an on-line exploration problem. We use a mobile robot to explore an unknown simple grid polygon. The robot is assumed to have limited sensing capability that can only detect the four basic cells adjacent to it. The robot’s task is to explore each cell and to return to the start. To explore a cell, the robot has to enter it. We ask for a short exploration tour, that is, minimizing the number of multiple-visit cells. The competitive ratio is used to measure the performance of our strategy. It is the ratio between the length of the on-line exploration path and the length of the shortest path achieved with full knowledge of the polygon. As our main result, we present a new on-line exploration strategy and prove that the robot’s path is at most 7/6 times longer than the shortest path. This matches the previously known lower bound.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Path planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">On-line Exploration</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Competitive analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Grid polygon</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mobile robot</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sun, Jie</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tan, Xuehou</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yao, Xiaolin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ren, Yonggong</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of combinatorial optimization</subfield><subfield code="d">Springer US, 1997</subfield><subfield code="g">41(2021), 3 vom: 03. Feb., Seite 625-639</subfield><subfield code="w">(DE-627)216539323</subfield><subfield code="w">(DE-600)1339574-9</subfield><subfield code="w">(DE-576)094421935</subfield><subfield code="x">1382-6905</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:41</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:3</subfield><subfield code="g">day:03</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:625-639</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10878-021-00705-5</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-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">41</subfield><subfield code="j">2021</subfield><subfield code="e">3</subfield><subfield code="b">03</subfield><subfield code="c">02</subfield><subfield code="h">625-639</subfield></datafield></record></collection>
|
| author |
Wei, Qi |
| spellingShingle |
Wei, Qi ddc 510 ssgn 3,2 misc Path planning misc On-line Exploration misc Competitive analysis misc Grid polygon misc Mobile robot The simple grid polygon exploration problem |
| authorStr |
Wei, Qi |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)216539323 |
| format |
Article |
| dewey-ones |
510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1382-6905 |
| topic_title |
510 VZ 3,2 ssgn The simple grid polygon exploration problem Path planning On-line Exploration Competitive analysis Grid polygon Mobile robot |
| topic |
ddc 510 ssgn 3,2 misc Path planning misc On-line Exploration misc Competitive analysis misc Grid polygon misc Mobile robot |
| topic_unstemmed |
ddc 510 ssgn 3,2 misc Path planning misc On-line Exploration misc Competitive analysis misc Grid polygon misc Mobile robot |
| topic_browse |
ddc 510 ssgn 3,2 misc Path planning misc On-line Exploration misc Competitive analysis misc Grid polygon misc Mobile robot |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Journal of combinatorial optimization |
| hierarchy_parent_id |
216539323 |
| dewey-tens |
510 - Mathematics |
| hierarchy_top_title |
Journal of combinatorial optimization |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 |
| title |
The simple grid polygon exploration problem |
| ctrlnum |
(DE-627)OLC2124279947 (DE-He213)s10878-021-00705-5-p |
| title_full |
The simple grid polygon exploration problem |
| author_sort |
Wei, Qi |
| journal |
Journal of combinatorial optimization |
| journalStr |
Journal of combinatorial optimization |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2021 |
| contenttype_str_mv |
txt |
| container_start_page |
625 |
| author_browse |
Wei, Qi Sun, Jie Tan, Xuehou Yao, Xiaolin Ren, Yonggong |
| container_volume |
41 |
| class |
510 VZ 3,2 ssgn |
| format_se |
Aufsätze |
| author-letter |
Wei, Qi |
| doi_str_mv |
10.1007/s10878-021-00705-5 |
| normlink |
(ORCID)0000-0002-2326-0601 |
| normlink_prefix_str_mv |
(orcid)0000-0002-2326-0601 |
| dewey-full |
510 |
| title_sort |
the simple grid polygon exploration problem |
| title_auth |
The simple grid polygon exploration problem |
| abstract |
Abstract This paper considers an on-line exploration problem. We use a mobile robot to explore an unknown simple grid polygon. The robot is assumed to have limited sensing capability that can only detect the four basic cells adjacent to it. The robot’s task is to explore each cell and to return to the start. To explore a cell, the robot has to enter it. We ask for a short exploration tour, that is, minimizing the number of multiple-visit cells. The competitive ratio is used to measure the performance of our strategy. It is the ratio between the length of the on-line exploration path and the length of the shortest path achieved with full knowledge of the polygon. As our main result, we present a new on-line exploration strategy and prove that the robot’s path is at most 7/6 times longer than the shortest path. This matches the previously known lower bound. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 |
| abstractGer |
Abstract This paper considers an on-line exploration problem. We use a mobile robot to explore an unknown simple grid polygon. The robot is assumed to have limited sensing capability that can only detect the four basic cells adjacent to it. The robot’s task is to explore each cell and to return to the start. To explore a cell, the robot has to enter it. We ask for a short exploration tour, that is, minimizing the number of multiple-visit cells. The competitive ratio is used to measure the performance of our strategy. It is the ratio between the length of the on-line exploration path and the length of the shortest path achieved with full knowledge of the polygon. As our main result, we present a new on-line exploration strategy and prove that the robot’s path is at most 7/6 times longer than the shortest path. This matches the previously known lower bound. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 |
| abstract_unstemmed |
Abstract This paper considers an on-line exploration problem. We use a mobile robot to explore an unknown simple grid polygon. The robot is assumed to have limited sensing capability that can only detect the four basic cells adjacent to it. The robot’s task is to explore each cell and to return to the start. To explore a cell, the robot has to enter it. We ask for a short exploration tour, that is, minimizing the number of multiple-visit cells. The competitive ratio is used to measure the performance of our strategy. It is the ratio between the length of the on-line exploration path and the length of the shortest path achieved with full knowledge of the polygon. As our main result, we present a new on-line exploration strategy and prove that the robot’s path is at most 7/6 times longer than the shortest path. This matches the previously known lower bound. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_2108 |
| container_issue |
3 |
| title_short |
The simple grid polygon exploration problem |
| url |
https://doi.org/10.1007/s10878-021-00705-5 |
| remote_bool |
false |
| author2 |
Sun, Jie Tan, Xuehou Yao, Xiaolin Ren, Yonggong |
| author2Str |
Sun, Jie Tan, Xuehou Yao, Xiaolin Ren, Yonggong |
| ppnlink |
216539323 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10878-021-00705-5 |
| up_date |
2024-07-03T22:51:09.162Z |
| _version_ |
1803600075595710464 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2124279947</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505085019.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230505s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10878-021-00705-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2124279947</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10878-021-00705-5-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">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wei, Qi</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-2326-0601</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The simple grid polygon exploration problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</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">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper considers an on-line exploration problem. We use a mobile robot to explore an unknown simple grid polygon. The robot is assumed to have limited sensing capability that can only detect the four basic cells adjacent to it. The robot’s task is to explore each cell and to return to the start. To explore a cell, the robot has to enter it. We ask for a short exploration tour, that is, minimizing the number of multiple-visit cells. The competitive ratio is used to measure the performance of our strategy. It is the ratio between the length of the on-line exploration path and the length of the shortest path achieved with full knowledge of the polygon. As our main result, we present a new on-line exploration strategy and prove that the robot’s path is at most 7/6 times longer than the shortest path. This matches the previously known lower bound.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Path planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">On-line Exploration</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Competitive analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Grid polygon</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mobile robot</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sun, Jie</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tan, Xuehou</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yao, Xiaolin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ren, Yonggong</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of combinatorial optimization</subfield><subfield code="d">Springer US, 1997</subfield><subfield code="g">41(2021), 3 vom: 03. Feb., Seite 625-639</subfield><subfield code="w">(DE-627)216539323</subfield><subfield code="w">(DE-600)1339574-9</subfield><subfield code="w">(DE-576)094421935</subfield><subfield code="x">1382-6905</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:41</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:3</subfield><subfield code="g">day:03</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:625-639</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10878-021-00705-5</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-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">41</subfield><subfield code="j">2021</subfield><subfield code="e">3</subfield><subfield code="b">03</subfield><subfield code="c">02</subfield><subfield code="h">625-639</subfield></datafield></record></collection>
|
| score |
7.400075 |