SFr. 35.50
€ 38.34
BTC 0.0006
LTC 0.623
ETH 0.0123


bestellen

Artikel-Nr. 33238528


Diesen Artikel in meine
Wunschliste
Diesen Artikel
weiterempfehlen
Diesen Preis
beobachten

Weitersagen:



Autor(en): 
  • Christiane Schmidt
  • Algorithms for Mobile Agents with Limited Capabilities 
     

    (Buch)
    Dieser Artikel gilt, aufgrund seiner Grösse, beim Versand als 2 Artikel!


    Übersicht

    Auf mobile öffnen
     
    Lieferstatus:   i.d.R. innert 5-10 Tagen versandfertig
    Veröffentlichung:  Juli 2011  
    Genre:  Schulbücher 
    ISBN:  9783869558295 
    EAN-Code: 
    9783869558295 
    Verlag:  Cuvillier 
    Einband:  Kartoniert  
    Sprache:  English  
    Dimensionen:  H 210 mm / B 148 mm / D 9 mm 
    Gewicht:  214 gr 
    Seiten:  158 
    Zus. Info:  Paperback 
    Bewertung: Titel bewerten / Meinung schreiben
    Inhalt:
    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.

      



    Wird aktuell angeschaut...
     

    Zurück zur letzten Ansicht


    AGB | Datenschutzerklärung | Mein Konto | Impressum | Partnerprogramm
    Newsletter | 1Advd.ch RSS News-Feed Newsfeed | 1Advd.ch Facebook-Page Facebook | 1Advd.ch Twitter-Page Twitter
    Forbidden Planet AG © 1999-2024
    Alle Angaben ohne Gewähr
     
    SUCHEN

     
     Kategorien
    Im Sortiment stöbern
    Genres
    Hörbücher
    Aktionen
     Infos
    Mein Konto
    Warenkorb
    Meine Wunschliste
     Kundenservice
    Recherchedienst
    Fragen / AGB / Kontakt
    Partnerprogramm
    Impressum
    © by Forbidden Planet AG 1999-2024