Grid Exploration: Theory and algorithms - Dino Wernli
-40% koodiga BOOKS
Saadetis 12-18 tööpäeva jooksul
30-päevane tagastamisõigus
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 ro ... Täielik kirjeldus
Võib-olla meeldib sulle ka
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-40% koodiga BOOKS
Meie tarnija laos
TOP
The 21st Century Brain: Cutting edge neuroscience to help us navigate the future
-40% koodiga BOOKS
Meie tarnija laos
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-40% koodiga BOOKS
Meie tarnija laos
TOP
AI Engineering: Building Applications with Foundation Models
-40% koodiga BOOKS
Meie tarnija laos
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-40% koodiga BOOKS
Meie tarnija laos
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-40% koodiga BOOKS
Meie tarnija laos
TOP
How To Think About AI: A Guide For The Perplexed
-40% koodiga BOOKS
Meie tarnija laos
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-40% koodiga BOOKS
Meie tarnija laos
TOP
Why Machines Learn: The Elegant Math Behind Modern AI
-40% koodiga BOOKS
Meie tarnija laos
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-40% koodiga BOOKS
Meie tarnija laos
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-40% koodiga BOOKS
Meie tarnija laos
TOP
The Art of Game Design: A Book of Lenses
-40% koodiga BOOKS
Meie tarnija laos
TOP
How Linux Works: What Every Superuser Should Know
-40% koodiga BOOKS
Meie tarnija laos
TOP
Hands-On Large Language Models: Language Understanding and Generation
Maarten Grootendorst, Jay Alammar
-40% koodiga BOOKS
Meie tarnija laos
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-40% koodiga BOOKS
Meie tarnija laos
TOP
Slanted 47 Digital Tools: Slanted Magazine
-40% koodiga BOOKS
Meie tarnija laos
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-40% koodiga BOOKS
Meie tarnija laos
TOP
Deep Learning: Foundations and Concepts
Christopher M. Bishop, Hugh Bishop
-40% koodiga BOOKS
Meie tarnija laos
Kirjeldus
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.
Lisateave
| Autor | Dino Wernli |
|---|---|
| Kirjastaja | AV Akademikerverlag |
| Väljalaskeaasta | 2012 |
| Kaanetüüp | Pehme kaanega |
| EAN | 9783639459340 |