Kenth robin (8 résultats)
Langue : anglais
Edité par Pippet Sky, 2026
- Couverture souple
Vendeur : CreativeCenters, Peoria, IL, Etats-UnisCreativeCenters
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 27,10
EUR 4,75 expéditionExpédition nationale : Etats-UnisQuantité disponible : 1 disponible(s)
Ajouter au panierpaperback. Etat : New.

Edité par Indy Pub, 2026
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-UniPBShop.store UK
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 32,12
EUR 3,84 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000.

- Couverture souple
- impression à la demande
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-UnisGrand Eagle Retail
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 33,06
Frais de port gratuitsExpédition nationale : Etats-UnisQuantité disponible : 1 disponible(s)
Paperback. Etat : new. Paperback. Autonomous mobile robots are becoming an essential component of modern computing, industrial automation, intelligent transportation, warehouse management, environmental monitoring, and space exploration. As multi-robot systems continue to evolve, efficient algorithms for robot dispersion, graph…exploration, and distributed coordination have become increasingly important. Dispersion-the process of relocating robots so that each occupies a distinct position in a graph-is closely related to graph exploration, load balancing, distributed computing, and cooperative robotics, making it a fundamental problem in algorithm design and autonomous systems.Robot Computational Dispersion and Exploration on Graph Topologies and Performance Indices presents a comprehensive study of computational techniques that enable autonomous robots to efficiently disperse and explore graph-based environments. The book introduces readers to the mathematical foundations of graph theory, distributed algorithms, computational models, and robotic coordination before examining how different graph topologies influence robot movement, communication, and task execution. It provides a detailed understanding of anonymous graphs, trees, grids, rings, meshes, and complex network structures that commonly appear in distributed robotic applications.The book explains the principles of robot dispersion, graph exploration, navigation strategies, and cooperative decision-making in both synchronous and asynchronous computational environments. Readers learn how autonomous robots coordinate their movements, exchange information, avoid conflicts, minimize redundant exploration, and achieve efficient coverage of unknown environments. Various deterministic and distributed algorithms are discussed to illustrate how computational efficiency can be improved while reducing communication overhead, memory usage, and execution time.Special emphasis is placed on the analysis of performance indices that evaluate the effectiveness of robotic algorithms. The book examines important evaluation metrics including computational complexity, execution time, memory requirements, communication cost, energy consumption, scalability, fault tolerance, path efficiency, exploration coverage, and load balancing. Readers gain practical insight into selecting appropriate algorithms for different robotic applications based on performance objectives and operational constraints. Robot Computational Dispersion and Exploration on Graph Topologies and Performance Indices explores distributed algorithms, graph theory, and autonomous robot coordination. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Edité par Indy Pub Jul 2026, 2026
- Couverture souple
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 40,00
EUR 60,92 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 2 disponible(s)
Taschenbuch. Etat : Neu. Neuware.

- Couverture souple
- impression à la demande
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AllemagneBuchWeltWeit Ludwig Meier e.K.
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 37,30
EUR 23,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 2 disponible(s)
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Autonomous mobile robots are becoming an essential component of modern computing, industrial automation, intelligent transportation, warehouse management, environmental monitoring, and space exploration. As multi-robot systems continue…to evolve, efficient algorithms for robot dispersion, graph exploration, and distributed coordination have become increasingly important. Dispersion-the process of relocating robots so that each occupies a distinct position in a graph-is closely related to graph exploration, load balancing, distributed computing, and cooperative robotics, making it a fundamental problem in algorithm design and autonomous systems.Robot Computational Dispersion and Exploration on Graph Topologies and Performance Indices presents a comprehensive study of computational techniques that enable autonomous robots to efficiently disperse and explore graph-based environments. The book introduces readers to the mathematical foundations of graph theory, distributed algorithms, computational models, and robotic coordination before examining how different graph topologies influence robot movement, communication, and task execution. It provides a detailed understanding of anonymous graphs, trees, grids, rings, meshes, and complex network structures that commonly appear in distributed robotic applications.The book explains the principles of robot dispersion, graph exploration, navigation strategies, and cooperative decision-making in both synchronous and asynchronous computational environments. Readers learn how autonomous robots coordinate their movements, exchange information, avoid conflicts, minimize redundant exploration, and achieve efficient coverage of unknown environments. Various deterministic and distributed algorithms are discussed to illustrate how computational efficiency can be improved while reducing communication overhead, memory usage, and execution time.Special emphasis is placed on the analysis of performance indices that evaluate the effectiveness of robotic algorithms. The book examines important evaluation metrics including computational complexity, execution time, memory requirements, communication cost, energy consumption, scalability, fault tolerance, path efficiency, exploration coverage, and load balancing. Readers gain practical insight into selecting appropriate algorithms for different robotic applications based on performance objectives and operational constraints. 128 pp. Englisch.

- Couverture souple
- impression à la demande
Vendeur : CitiRetail, Stevenage, Royaume-UniCitiRetail
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 36,10
EUR 43,24 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Paperback. Etat : new. Paperback. Autonomous mobile robots are becoming an essential component of modern computing, industrial automation, intelligent transportation, warehouse management, environmental monitoring, and space exploration. As multi-robot systems continue to evolve, efficient algorithms for robot dispersion, graph…exploration, and distributed coordination have become increasingly important. Dispersion-the process of relocating robots so that each occupies a distinct position in a graph-is closely related to graph exploration, load balancing, distributed computing, and cooperative robotics, making it a fundamental problem in algorithm design and autonomous systems.Robot Computational Dispersion and Exploration on Graph Topologies and Performance Indices presents a comprehensive study of computational techniques that enable autonomous robots to efficiently disperse and explore graph-based environments. The book introduces readers to the mathematical foundations of graph theory, distributed algorithms, computational models, and robotic coordination before examining how different graph topologies influence robot movement, communication, and task execution. It provides a detailed understanding of anonymous graphs, trees, grids, rings, meshes, and complex network structures that commonly appear in distributed robotic applications.The book explains the principles of robot dispersion, graph exploration, navigation strategies, and cooperative decision-making in both synchronous and asynchronous computational environments. Readers learn how autonomous robots coordinate their movements, exchange information, avoid conflicts, minimize redundant exploration, and achieve efficient coverage of unknown environments. Various deterministic and distributed algorithms are discussed to illustrate how computational efficiency can be improved while reducing communication overhead, memory usage, and execution time.Special emphasis is placed on the analysis of performance indices that evaluate the effectiveness of robotic algorithms. The book examines important evaluation metrics including computational complexity, execution time, memory requirements, communication cost, energy consumption, scalability, fault tolerance, path efficiency, exploration coverage, and load balancing. Readers gain practical insight into selecting appropriate algorithms for different robotic applications based on performance objectives and operational constraints. Robot Computational Dispersion and Exploration on Graph Topologies and Performance Indices explores distributed algorithms, graph theory, and autonomous robot coordination. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

- Couverture souple
- impression à la demande
Vendeur : AussieBookSeller, Truganina, VIC, AustralieAussieBookSeller
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 50,33
EUR 31,95 expéditionExpédition depuis Australie vers Etats-UnisQuantité disponible : 1 disponible(s)
Paperback. Etat : new. Paperback. Autonomous mobile robots are becoming an essential component of modern computing, industrial automation, intelligent transportation, warehouse management, environmental monitoring, and space exploration. As multi-robot systems continue to evolve, efficient algorithms for robot dispersion, graph…exploration, and distributed coordination have become increasingly important. Dispersion-the process of relocating robots so that each occupies a distinct position in a graph-is closely related to graph exploration, load balancing, distributed computing, and cooperative robotics, making it a fundamental problem in algorithm design and autonomous systems.Robot Computational Dispersion and Exploration on Graph Topologies and Performance Indices presents a comprehensive study of computational techniques that enable autonomous robots to efficiently disperse and explore graph-based environments. The book introduces readers to the mathematical foundations of graph theory, distributed algorithms, computational models, and robotic coordination before examining how different graph topologies influence robot movement, communication, and task execution. It provides a detailed understanding of anonymous graphs, trees, grids, rings, meshes, and complex network structures that commonly appear in distributed robotic applications.The book explains the principles of robot dispersion, graph exploration, navigation strategies, and cooperative decision-making in both synchronous and asynchronous computational environments. Readers learn how autonomous robots coordinate their movements, exchange information, avoid conflicts, minimize redundant exploration, and achieve efficient coverage of unknown environments. Various deterministic and distributed algorithms are discussed to illustrate how computational efficiency can be improved while reducing communication overhead, memory usage, and execution time.Special emphasis is placed on the analysis of performance indices that evaluate the effectiveness of robotic algorithms. The book examines important evaluation metrics including computational complexity, execution time, memory requirements, communication cost, energy consumption, scalability, fault tolerance, path efficiency, exploration coverage, and load balancing. Readers gain practical insight into selecting appropriate algorithms for different robotic applications based on performance objectives and operational constraints. Robot Computational Dispersion and Exploration on Graph Topologies and Performance Indices explores distributed algorithms, graph theory, and autonomous robot coordination. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

- Couverture souple
- impression à la demande
Vendeur : preigu, Osnabrück, Allemagnepreigu
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 37,70
EUR 70,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 5 disponible(s)
Taschenbuch. Etat : Neu. Robot Computational Dispersion and Exploration on Graph Topologies and Performance Indices | Robin Kenth | Taschenbuch | Englisch | 2026 | Pippet Sky | EAN 9798256227463 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on De…mand.