Items related to Algorithms for Mobile Agents with Limited Capabilities
Synopsis
This work deals with geometric problems and the use of limited capability agents for these problems. Exploration and guarding problems have been extensively studied in computational geometry. The basic task is to monitor an environment (a polygon) either with a mobile guard or with a number of sta¬tionary guards (or guards with hard restrictions on the allowed movements). Though all these problems are easy to formulate-and have real-world interpretations that vividly illustrate them-some of these problems (as the classical art gallery problem) are hard to solve. The task of exploring an environment becomes more challenging if the environment is not known in advance, that is, there is no given ground plan and only areas that have already been visibly encountered by the explorer are known. Problems with this kind of uncertainty are called online problems. For offline problems the ground plan of the environment is known in advance. In this work we study one offline exploration problem and one exploration and guarding problem in the offline and online version, where the focus is on the latter. For our problems we do not deal with "almighty" explorers, but face limits on their perceptive capabilities. Other types of geometric problems can exploit this kind of limited agents: We present an exact and fast algorithm for an image analysis task with polyomino-shaped objects on a grid.
"synopsis" may belong to another edition of this title.
Search results for Algorithms for Mobile Agents with Limited Capabilities
Stock Image
Algorithms for Mobile Agents with Limited Capabilities
ISBN 10: 3869558296
ISBN 13: 9783869558295
New
Softcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # I-9783869558295
Stock Image
Algorithms for Mobile Agents with Limited Capabilities
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # L2-9783869558295
Stock Image
Algorithms for Mobile Agents with Limited Capabilities
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # L2-9783869558295
Buy New
£ 23.24
£ 5.87 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Algorithms for Mobile Agents with Limited Capabilities
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This work deals with geometric problems and the use of limited capability agents for these problems. Exploration and guarding problems have been extensively studied in computational geometry. The basic task is to monitor an environment (a polygon) either with a mobile guard or with a number of sta tionary guards (or guards with hard restrictions on the allowed movements). Though all these problems are easy to formulate¿and have real-world interpretations that vividly illustrate them¿some of these problems (as the classical art gallery problem) are hard to solve. The task of exploring an environment becomes more challenging if the environment is not known in advance, that is, there is no given ground plan and only areas that have already been visibly encountered by the explorer are known. Problems with this kind of uncertainty are called online problems. For öine problems the ground plan of the environment is known in advance. In this work we study one öine exploration problem and one exploration and guarding problem in the öine and online version, where the focus is on the latter. For our problems we do not deal with ¿almighty¿ explorers, but face limits on their perceptive capabilities. Other types of geometric problems can exploit this kind of limited agents: We present an exact and fast algorithm for an image analysis task with polyomino-shaped objects on a grid. 158 pp. Englisch. Seller Inventory # 9783869558295
Seller Image
Algorithms for Mobile Agents with Limited Capabilities
Published by
Cuvillier Verlag, 2011
ISBN 10: 3869558296
ISBN 13: 9783869558295
New
Kartoniert / Broschiert
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. KlappentextrnrnThis work deals with geometric problems and the use of limited capability agents for these problems. Exploration and guarding problems have been extensively studied in computational geometry. The basic task is to monitor an enviro. Seller Inventory # 140365917
Buy New
£ 22.73
£ 41.92 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Algorithms for Mobile Agents with Limited Capabilities
Published by
Cuvillier, Cuvillier Jul 2011, 2011
ISBN 10: 3869558296
ISBN 13: 9783869558295
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This work deals with geometric problems and the use of limited capability agents for these problems. Exploration and guarding problems have been extensively studied in computational geometry. The basic task is to monitor an environment (a polygon) either with a mobile guard or with a number of sta tionary guards (or guards with hard restrictions on the allowed movements). Though all these problems are easy to formulate-and have real-world interpretations that vividly illustrate them-some of these problems (as the classical art gallery problem) are hard to solve. The task of exploring an environment becomes more challenging if the environment is not known in advance, that is, there is no given ground plan and only areas that have already been visibly encountered by the explorer are known. Problems with this kind of uncertainty are called online problems. For öine problems the ground plan of the environment is known in advance. In this work we study one öine exploration problem and one exploration and guarding problem in the öine and online version, where the focus is on the latter. For our problems we do not deal with 'almighty' explorers, but face limits on their perceptive capabilities. Other types of geometric problems can exploit this kind of limited agents: We present an exact and fast algorithm for an image analysis task with polyomino-shaped objects on a grid.Cuvillier Verlag, Nonnenstieg 8, 37075 Göttingen 158 pp. Englisch. Seller Inventory # 9783869558295
Seller Image
Algorithms for Mobile Agents with Limited Capabilities
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This work deals with geometric problems and the use of limited capability agents for these problems. Exploration and guarding problems have been extensively studied in computational geometry. The basic task is to monitor an environment (a polygon) either with a mobile guard or with a number of sta tionary guards (or guards with hard restrictions on the allowed movements). Though all these problems are easy to formulate¿and have real-world interpretations that vividly illustrate them¿some of these problems (as the classical art gallery problem) are hard to solve. The task of exploring an environment becomes more challenging if the environment is not known in advance, that is, there is no given ground plan and only areas that have already been visibly encountered by the explorer are known. Problems with this kind of uncertainty are called online problems. For öine problems the ground plan of the environment is known in advance. In this work we study one öine exploration problem and one exploration and guarding problem in the öine and online version, where the focus is on the latter. For our problems we do not deal with ¿almighty¿ explorers, but face limits on their perceptive capabilities. Other types of geometric problems can exploit this kind of limited agents: We present an exact and fast algorithm for an image analysis task with polyomino-shaped objects on a grid. Seller Inventory # 9783869558295
Seller Image
Algorithms for Mobile Agents with Limited Capabilities
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Algorithms for Mobile Agents with Limited Capabilities | Christiane Schmidt | Taschenbuch | Englisch | 2011 | Cuvillier | EAN 9783869558295 | Verantwortliche Person für die EU: Cuvillier Verlag, Nonnenstieg 8, 37075 Göttingen, info[at]cuvillier[dot]de | Anbieter: preigu Print on Demand. Seller Inventory # 120729834