Grid Exploration: Theory and algorithms

0 avg rating
( 0 ratings by Goodreads )
 
9783639459340: Grid Exploration: Theory and algorithms

The grid exploration problem consists in finding a shortest possible tour which visits every cell of a grid at least once. Solutions to this problem can be applied in scenarios where an autonomous robot must perform tasks such as mowing the lawn or cleaning a room. We distinguish two variants of grid exploration. In the offline variant, the entire grid is given as input, whereas in the online variant the robot has limited visibility and must acquire information about the initially unknown grid as it explores it. We provide an overview of currently known results for offline and online grid exploration. We also develop new techniques to prove bounds for the length of shortest exploration tours and show how to combine them to get stronger bounds. Previous results for the online variant assume that the robot is initially located at the boundary of the grid. We give a new algorithm which does not make this assumption and achieves the same competitive ratio.

"synopsis" may belong to another edition of this title.

About the Author:

is 22 years old. He grew up in Basel, Switzerland and got his master's degree in computer science from ETH Zürich where he was on the board of the computer science student association. He also interned at AdNovum Informatik and at Google where he recently started as a full-time software engineer.

"About this title" may belong to another edition of this title.

Buy New View Book
List Price: US$ 46.00
US$ 36.66

Convert Currency

Shipping: US$ 7.91
From United Kingdom to U.S.A.

Destination, Rates & Speeds

Add to Basket

Top Search Results from the AbeBooks Marketplace

1.

Wernli Dino
Published by AV Akademikerverlag 2012-11-17 (2012)
ISBN 10: 3639459342 ISBN 13: 9783639459340
New paperback Quantity Available: > 20
Seller:
Blackwell's
(Oxford, OX, United Kingdom)
Rating
[?]

Book Description AV Akademikerverlag 2012-11-17, 2012. paperback. Book Condition: New. Bookseller Inventory # 9783639459340

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 36.66
Convert Currency

Add to Basket

Shipping: US$ 7.91
From United Kingdom to U.S.A.
Destination, Rates & Speeds

2.

Wernli Dino
Published by AV Akademikerverlag (2012)
ISBN 10: 3639459342 ISBN 13: 9783639459340
New Quantity Available: > 20
Print on Demand
Seller:
Pbshop
(Wood Dale, IL, U.S.A.)
Rating
[?]

Book Description AV Akademikerverlag, 2012. PAP. Book Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # IQ-9783639459340

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 42.58
Convert Currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, Rates & Speeds

3.

Wernli, Dino
ISBN 10: 3639459342 ISBN 13: 9783639459340
New Quantity Available: 1
Seller:
Rating
[?]

Book Description Book Condition: New. Publisher/Verlag: AV Akademikerverlag | Theory and algorithms | The grid exploration problem consists in finding a shortest possible tour which visits every cell of a grid at least once. Solutions to this problem can be applied in scenarios where an autonomous robot must perform tasks such as mowing the lawn or cleaning a room. We distinguish two variants of grid exploration. In the offline variant, the entire grid is given as input, whereas in the online variant the robot has limited visibility and must acquire information about the initially unknown grid as it explores it. We provide an overview of currently known results for offline and online grid exploration. We also develop new techniques to prove bounds for the length of shortest exploration tours and show how to combine them to get stronger bounds. Previous results for the online variant assume that the robot is initially located at the boundary of the grid. We give a new algorithm which does not make this assumption and achieves the same competitive ratio. | Format: Paperback | Language/Sprache: english | 80 pp. Bookseller Inventory # K9783639459340

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 43.39
Convert Currency

Add to Basket

Shipping: US$ 3.52
From Germany to U.S.A.
Destination, Rates & Speeds

4.

Wernli Dino
Published by AV Akademikerverlag (2016)
ISBN 10: 3639459342 ISBN 13: 9783639459340
New Paperback Quantity Available: 1
Print on Demand
Seller:
Ria Christie Collections
(Uxbridge, United Kingdom)
Rating
[?]

Book Description AV Akademikerverlag, 2016. Paperback. Book Condition: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Bookseller Inventory # ria9783639459340_lsuk

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 42.22
Convert Currency

Add to Basket

Shipping: US$ 5.10
From United Kingdom to U.S.A.
Destination, Rates & Speeds

5.

Wernli Dino
Published by AV Akademikerverlag (2012)
ISBN 10: 3639459342 ISBN 13: 9783639459340
New Quantity Available: > 20
Print on Demand
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description AV Akademikerverlag, 2012. PAP. Book Condition: New. New Book. Delivered from our UK warehouse in 3 to 5 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # LQ-9783639459340

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 37.71
Convert Currency

Add to Basket

Shipping: US$ 11.88
From United Kingdom to U.S.A.
Destination, Rates & Speeds

6.

Dino Wernli
Published by AV Akademikerverlag Nov 2012 (2012)
ISBN 10: 3639459342 ISBN 13: 9783639459340
New Taschenbuch Quantity Available: 1
Seller:
Rheinberg-Buch
(Bergisch Gladbach, Germany)
Rating
[?]

Book Description AV Akademikerverlag Nov 2012, 2012. Taschenbuch. Book Condition: Neu. Neuware - The grid exploration problem consists in finding a shortest possible tour which visits every cell of a grid at least once. Solutions to this problem can be applied in scenarios where an autonomous robot must perform tasks such as mowing the lawn or cleaning a room. We distinguish two variants of grid exploration. In the offline variant, the entire grid is given as input, whereas in the online variant the robot has limited visibility and must acquire information about the initially unknown grid as it explores it. We provide an overview of currently known results for offline and online grid exploration. We also develop new techniques to prove bounds for the length of shortest exploration tours and show how to combine them to get stronger bounds. Previous results for the online variant assume that the robot is initially located at the boundary of the grid. We give a new algorithm which does not make this assumption and achieves the same competitive ratio. 80 pp. Englisch. Bookseller Inventory # 9783639459340

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 43.70
Convert Currency

Add to Basket

Shipping: US$ 20.19
From Germany to U.S.A.
Destination, Rates & Speeds

7.

Dino Wernli
Published by AV Akademikerverlag Nov 2012 (2012)
ISBN 10: 3639459342 ISBN 13: 9783639459340
New Taschenbuch Quantity Available: 1
Seller:
Agrios-Buch
(Bergisch Gladbach, Germany)
Rating
[?]

Book Description AV Akademikerverlag Nov 2012, 2012. Taschenbuch. Book Condition: Neu. Neuware - The grid exploration problem consists in finding a shortest possible tour which visits every cell of a grid at least once. Solutions to this problem can be applied in scenarios where an autonomous robot must perform tasks such as mowing the lawn or cleaning a room. We distinguish two variants of grid exploration. In the offline variant, the entire grid is given as input, whereas in the online variant the robot has limited visibility and must acquire information about the initially unknown grid as it explores it. We provide an overview of currently known results for offline and online grid exploration. We also develop new techniques to prove bounds for the length of shortest exploration tours and show how to combine them to get stronger bounds. Previous results for the online variant assume that the robot is initially located at the boundary of the grid. We give a new algorithm which does not make this assumption and achieves the same competitive ratio. 80 pp. Englisch. Bookseller Inventory # 9783639459340

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 43.70
Convert Currency

Add to Basket

Shipping: US$ 20.19
From Germany to U.S.A.
Destination, Rates & Speeds

8.

Dino Wernli
Published by AV Akademikerverlag
ISBN 10: 3639459342 ISBN 13: 9783639459340
New Paperback Quantity Available: > 20
Seller:
BuySomeBooks
(Las Vegas, NV, U.S.A.)
Rating
[?]

Book Description AV Akademikerverlag. Paperback. Book Condition: New. Paperback. 80 pages. Dimensions: 8.7in. x 5.9in. x 0.2in.The grid exploration problem consists in finding a shortest possible tour which visits every cell of a grid at least once. Solutions to this problem can be applied in scenarios where an autonomous robot must perform tasks such as mowing the lawn or cleaning a room. We distinguish two variants of grid exploration. In the offline variant, the entire grid is given as input, whereas in the online variant the robot has limited visibility and must acquire information about the initially unknown grid as it explores it. We provide an overview of currently known results for offline and online grid exploration. We also develop new techniques to prove bounds for the length of shortest exploration tours and show how to combine them to get stronger bounds. Previous results for the online variant assume that the robot is initially located at the boundary of the grid. We give a new algorithm which does not make this assumption and achieves the same competitive ratio. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Paperback. Bookseller Inventory # 9783639459340

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 64.65
Convert Currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, Rates & Speeds

9.

Wernli Dino
Published by AV Akademikerverlag (2012)
ISBN 10: 3639459342 ISBN 13: 9783639459340
New Paperback Quantity Available: > 20
Print on Demand
Seller:
The Book Depository EURO
(London, United Kingdom)
Rating
[?]

Book Description AV Akademikerverlag, 2012. Paperback. Book Condition: New. Language: English . Brand New Book ***** Print on Demand *****.The grid exploration problem consists in finding a shortest possible tour which visits every cell of a grid at least once. Solutions to this problem can be applied in scenarios where an autonomous robot must perform tasks such as mowing the lawn or cleaning a room. We distinguish two variants of grid exploration. In the offline variant, the entire grid is given as input, whereas in the online variant the robot has limited visibility and must acquire information about the initially unknown grid as it explores it. We provide an overview of currently known results for offline and online grid exploration. We also develop new techniques to prove bounds for the length of shortest exploration tours and show how to combine them to get stronger bounds. Previous results for the online variant assume that the robot is initially located at the boundary of the grid. We give a new algorithm which does not make this assumption and achieves the same competitive ratio. Bookseller Inventory # AAV9783639459340

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 62.97
Convert Currency

Add to Basket

Shipping: US$ 3.96
From United Kingdom to U.S.A.
Destination, Rates & Speeds

10.

Dino Wernli
Published by AV Akademikerverlag Nov 2012 (2012)
ISBN 10: 3639459342 ISBN 13: 9783639459340
New Taschenbuch Quantity Available: 1
Print on Demand
Seller:
AHA-BUCH GmbH
(Einbeck, Germany)
Rating
[?]

Book Description AV Akademikerverlag Nov 2012, 2012. Taschenbuch. Book Condition: Neu. This item is printed on demand - Print on Demand Neuware - The grid exploration problem consists in finding a shortest possible tour which visits every cell of a grid at least once. Solutions to this problem can be applied in scenarios where an autonomous robot must perform tasks such as mowing the lawn or cleaning a room. We distinguish two variants of grid exploration. In the offline variant, the entire grid is given as input, whereas in the online variant the robot has limited visibility and must acquire information about the initially unknown grid as it explores it. We provide an overview of currently known results for offline and online grid exploration. We also develop new techniques to prove bounds for the length of shortest exploration tours and show how to combine them to get stronger bounds. Previous results for the online variant assume that the robot is initially located at the boundary of the grid. We give a new algorithm which does not make this assumption and achieves the same competitive ratio. 80 pp. Englisch. Bookseller Inventory # 9783639459340

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 43.70
Convert Currency

Add to Basket

Shipping: US$ 34.77
From Germany to U.S.A.
Destination, Rates & Speeds