Look-Compute-Move Robots

For more info about our services contact : help@bestpfe.com

Table of contents

1 Introduction 
1.1 Context and State of the Art
1.1.1 Distributed Systems
1.1.2 Related Research Fields
1.1.3 The Tasks and Model Considered throughout this Thesis
1.1.4 Another Model: Look-Compute-Move Robots
1.2 Contributions
2 Model 
2.1 The Environment of the Mobile Agents
2.1.1 Modeling Time
2.1.2 Modeling Space
2.1.3 Defining the Whole Environment
2.2 Execution of an Algorithm by a Distributed System of Mobile Agents
2.2.1 Initialization
2.2.2 Progress of the Execution: Abilities of the Mobile Agents
2.3 Tasks Specifications and Efficiency of an Algorithm
2.4 Notations
3 Strong Rendezvous in Finite Graphs 
3.1 Introduction
3.1.1 Related Work
3.1.2 Contribution
3.1.3 Roadmap
3.2 Preliminaries
3.3 The Algorithm and its Analysis
3.4 Discussion of Alternative Scenarios
3.5 Conclusion
4 Asynchronous Approach in the Plane 
4.1 Introduction
4.1.1 Related Work
4.1.2 Model and Reduction from Asynchronous Approach in the Plane to Weak Rendezvous in the Infinite Grid
4.1.3 Contribution
4.1.4 Roadmap
4.2 Preliminaries
4.3 Idea of the Algorithm
4.3.1 Informal Description in a Nutshell
4.3.2 Under the Hood
4.4 Basic Patterns
4.4.1 Pattern Seed
4.4.2 Pattern RepeatSeed
4.4.3 Pattern Berry
4.4.4 Pattern CloudBerry
4.5 Main Algorithm
4.6 Proof of Correctness and Cost Analysis
4.6.1 Properties of the Basic Patterns
4.6.2 Agents Synchronizations
4.6.3 Correctness of Procedure AsyncGridRV
4.6.4 Cost Analysis
4.7 Conclusion
5 Byzantine Gathering in Finite Graphs 
5.1 Introduction
5.1.1 Introduction and Related Work
5.1.2 Model
5.1.3 Contribution
5.1.4 Roadmap
5.2 Preliminaries
5.3 Building Blocks
5.3.1 Procedure Group
5.3.2 Procedure Merge
5.4 The Positive Result
5.4.1 Intuition
5.4.2 Formal Description
5.4.3 Proof and Analysis
5.5 The Negative Result
5.6 Conclusion
6 Treasure Hunt in the Plane with Angular Hints 
6.1 Introduction
6.1.1 Model and Task Formulation
6.1.2 Contribution
6.2 Preliminaries
6.3 Angles at most
6.3.1 High Level Idea of the Algorithm
6.3.2 Algorithm and Analysis
6.4 Angles Bounded by < 2
6.4.1 High Level Idea
6.4.2 Algorithm and Analysis
6.5 Arbitrary Angles
6.6 Conclusion
7 Conclusion of the Thesis 
7.1 Sum up of the Main Parts
7.2 Perspectives of the Thesis
Bibliography