MinPosGlouton) : version parallélisée, p.83 ,
114 8.5.1 Temporisation de l'affectation des cibles redondantes, p.116 ,
Motor Schema ??? Based Mobile Robot Navigation, The International Journal of Robotics Research, vol.32, issue.4, pp.92-112, 1989. ,
DOI : 10.1093/brain/34.2-3.102
Towards heterogeneous robot teams for disaster mitigation: Results and performance metrics from RoboCup rescue, Journal of Field Robotics, vol.19, issue.11-12, pp.11-12, 2007. ,
DOI : 10.1017/CBO9780511546877
Numerical potential field techniques for robot path planning, Advanced Robotics Unstructured Environments', 91 ICAR., Fifth International Conference on, pp.1012-1017, 1991. ,
Inevitable Collision States: A probabilistic perspective, 2010 IEEE International Conference on Robotics and Automation, pp.4022-4027, 2010. ,
DOI : 10.1109/ROBOT.2010.5509233
URL : https://hal.archives-ouvertes.fr/inria-00546366
MinPos : A Novel Frontier Allocation Algorithm for Multi-robot Exploration, ICIRA'12 Proceedings of the 5th international conference on Intelligent Robotics and Applications, pp.496-508, 2012. ,
DOI : 10.1007/978-3-642-33515-0_49
URL : https://hal.archives-ouvertes.fr/hal-00757960
Strat??gie d'exploration multirobot fond??e sur les champs de potentiels arti???ciels, Revue d'intelligence artificielle, vol.26, issue.5, pp.523-542, 2012. ,
DOI : 10.3166/ria.26.523-542
Merging Occupancy Grid Maps From Multiple Robots, Proceedings of the IEEE, vol.94, issue.7, pp.1384-1397, 2006. ,
DOI : 10.1109/JPROC.2006.876965
Contributions to Localization, Mapping and Navigation in Mobile Robotics, 2009. ,
A linear algorithm for incremental digital display of cirucular arcs, Communications of the ACM, vol.20, issue.2, pp.100-106, 1977. ,
DOI : 10.1145/359423.359432
A robust layered control system for a mobile robot, IEEE Journal on Robotics and Automation, vol.2, issue.1, 1985. ,
DOI : 10.1109/JRA.1986.1087032
Collaborative Exploration of Unknown Environments with Teams of Mobile Robots, Plan-Based Control of Robotic Agents, Volume 2466 of Lecture Notes in Computer Science, 2002. ,
DOI : 10.1007/3-540-37724-7_4
Coordinated multi-robot exploration, IEEE Transactions on Robotics, vol.21, issue.3, pp.376-386, 2005. ,
DOI : 10.1109/TRO.2004.839232
Planning for multi-robot exploration with multiple objective utility functions, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp.3254-3259, 2011. ,
DOI : 10.1109/IROS.2011.6095165
Dynamic role assignment for cooperative robots, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292), pp.293-298, 2002. ,
DOI : 10.1109/ROBOT.2002.1013376
Position referencing and consistent world modeling for mobile robots, Proceedings. 1985 IEEE International Conference on Robotics and Automation, pp.138-145, 1985. ,
DOI : 10.1109/ROBOT.1985.1087373
Navigation for an intelligent mobile robot Robotics and Automation, IEEE Journal, vol.1, issue.1, pp.31-41, 1985. ,
Selection of rendezvous points for multi-robot exploration in dynamic environments, International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2010. ,
Decentralized path planning for multi-agent teams with complex constraints, Autonomous Robots, vol.7, issue.5, pp.385-403, 2012. ,
DOI : 10.1109/TWC.2007.060889
A frontier-void-based approach for autonomous exploration in 3d, Safety, Security, and Rescue Robotics (SSRR), 2011 IEEE International Symposium on, pp.351-356, 2011. ,
Using HMMs for Discriminating Mobile from Static Objects in a 3D Occupancy Grid, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence, pp.170-176, 2011. ,
DOI : 10.1109/ICTAI.2011.188
URL : https://hal.archives-ouvertes.fr/hal-00654041
Experiments in evidence based localisation for a mobile robot, Proceedings of the AISB Workshop on Spatial Reasoning in Mobile Robots and Animals, 1997. ,
Using occupancy grids for mobile robot perception and navigation, Computer, vol.22, issue.6, pp.46-57, 1989. ,
DOI : 10.1109/2.30720
Goal assignment using distance cost in multirobot exploration, Intelligent Robots and Systems (IROS), 2012 IEEE/RSJ International Conference on, pp.3741-3746, 2012. ,
Adaptive Mobile Robot Navigation and Mapping, The International Journal of Robotics Research, vol.18, issue.7, pp.650-668, 1999. ,
DOI : 10.1023/A:1007436523611
URL : http://groups.csail.mit.edu/marine/pub/Feder99ijrr.pdf
Les systèmes multi-agents, vers une intelligence collective, 1995. ,
The Sensor-based Random Graph Method for Cooperative Robot Exploration, IEEE/ASME Transactions on Mechatronics, vol.14, issue.2, pp.163-175, 2009. ,
DOI : 10.1109/TMECH.2009.2013617
The player/stage project : Tools for multirobot and distributed sensor systems, Proceedings of the 11th International Conference on Advanced Robotics, pp.317-323, 2003. ,
Self-organization of patrollingant algorithms, Self-Adaptive and Self-Organizing Systems, 2009. SASO'09. Third IEEE International Conference on, pp.61-70, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00429571
Navigation Strategies for Exploring Indoor Environments, The International Journal of Robotics Research, vol.21, issue.10-11, pp.10-11, 2002. ,
DOI : 10.1177/02783640122067435
Frontier-Graph Exploration for Multi-robot Systems in an Unknown Indoor Environment, Distributed Autonomous Robotic Systems, pp.51-60, 2006. ,
DOI : 10.1007/4-431-35881-1_6
Evaluating the efficiency of frontierbased exploration strategies, Robotics (ISR), 2010 41st International Symposium on and 2010 6th German Conference on Robotics (ROBOTIK), pp.1-8, 2010. ,
Multi-robot Simultaneous Localization and Mapping using Particle Filters, The International Journal of Robotics Research, vol.94, issue.7, pp.1243-1256, 2006. ,
DOI : 10.1177/0278364904045479
Mobile Sensor Network Deployment using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem, Proceedings of the 6th International Symposium on Distributed Autonomous Robotics Systems (DARS02), pp.299-308, 2002. ,
DOI : 10.1007/978-4-431-65941-9_30
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots, The International Journal of Robotics Research, vol.5, issue.1, pp.90-98, 1986. ,
DOI : 10.1109/TSMC.1983.6313112
A practical, decisiontheoretic approach to multi-robot mapping and exploration, Intelligent Robots and Systems Proceedings. 2003 IEEE/RSJ International Conference on, pp.3232-3238, 2003. ,
Efficient and inefficient ant coverage methods, Annals of Mathematics and Artificial Intelligence, vol.31, issue.1/4, pp.41-76, 2001. ,
DOI : 10.1023/A:1016665115585
Real-time heuristic search, Artificial Intelligence, vol.42, issue.2-3, pp.189-211, 1990. ,
DOI : 10.1016/0004-3702(90)90054-4
URL : http://ircl.cs.ualberta.ca/files/webfm/games/pubs/geramifard06-aiide.pdf
The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955. ,
DOI : 10.2140/pjm.1953.3.369
Modeling Spatial Knowledge*, Cognitive Science, vol.10, issue.2, pp.129-153, 1978. ,
DOI : 10.1126/science.171.3972.701
A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations, Robotics and Autonomous Systems, vol.8, issue.1-2, pp.47-63, 1991. ,
DOI : 10.1016/0921-8890(91)90014-C
Coopération dans les systèmes multi-robots : Contribution au maintien de la connectivié etàetà l'allocation dynamique de rôles, 2010. ,
An algorithm for planning collision-free paths among polyhedral obstacles, Communications of the ACM, vol.22, issue.10, pp.560-570, 1979. ,
DOI : 10.1145/359156.359164
Slam-o-matic : Slam algorithm based on global search of local minima, 2011. ,
An experiment in integrated exploration, IEEE/RSJ International Conference on Intelligent Robots and System, pp.534-539, 2002. ,
DOI : 10.1109/IRDS.2002.1041445
Generation of unknown environment maps by cooperative low-cost robots, 1997. ,
Improving the precision on multi robot localization by using a series of filters hierarchically distributed, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2007. ,
DOI : 10.1109/IROS.2007.4399043
Energy-efficient mobile robot exploration, Robotics and Automation IEEE International Conference on, pp.505-511, 2006. ,
High resolution maps from wide angle sonar, Proceedings. 1985 IEEE International Conference on Robotics and Automation, pp.116-121, 1985. ,
DOI : 10.1109/ROBOT.1985.1087316
A new global optimization strategy for coordinated multi-robot exploration: Development and comparative evaluation, Robotics and Autonomous Systems, vol.59, issue.9, pp.635-653, 2011. ,
DOI : 10.1016/j.robot.2011.05.004
Multi-robot collaboration for robust exploration, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065), pp.1-4, 2001. ,
DOI : 10.1109/ROBOT.2000.845150
Multi-robot exploration of an unknown environment, efficiently reducing the odometry error, IJCAI'97 : Proceedings of the Fifteenth international joint conference on Artifical intelligence, pp.1340-1345, 1997. ,
Distributed coverage control for a multi-robot team in a non-convex environment, IEEE IROS 09 3rd Workshop on Planning, Perception and Navigation for Intelligent Vehicles, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00428075
Collaborative robot exploration and rendezvous : Algorithms, performance bounds and observations, Autonomous Robots, vol.11, issue.2, pp.117-136, 2001. ,
DOI : 10.1023/A:1011219024159
Coordination for multi-robot exploration and mapping, Proceedings of the AAAI National Conference on Artificial Intelligence, 2000. ,
On the Representation and Estimation of Spatial Uncertainty, The International Journal of Robotics Research, vol.5, issue.4, pp.56-68, 1986. ,
DOI : 10.1109/ROBOT.1985.1087373
On actively closing loops in grid-based FastSLAM, Advanced Robotics, vol.19, issue.10, 2005. ,
DOI : 10.1163/156855305774662181
Efficient exploration of unknown indoor environments using a team of mobile robots, Annals of Mathematics and Artificial Intelligence, vol.7, issue.2, pp.2-4, 2008. ,
DOI : 10.1007/BF00240651
Distance transform computation for digital distance functions, Theoretical Computer Science, vol.448, issue.0, pp.80-93, 2012. ,
DOI : 10.1016/j.tcs.2012.05.010
URL : https://hal.archives-ouvertes.fr/hal-00717825
Distributed multirobot exploration maintaining a mobile network, 2004 2nd International IEEE Conference on 'Intelligent Systems'. Proceedings (IEEE Cat. No.04EX791), pp.113-118, 2004. ,
DOI : 10.1109/IS.2004.1344863
Distributed covering by ant-robots using evaporating traces, IEEE Transactions on Robotics and Automation, vol.15, issue.5, pp.918-933, 1999. ,
DOI : 10.1109/70.795795
URL : http://www.cs.technion.ac.il/~wagner/index_files/tra_oct99.pdf
Coordinated multi-robot exploration using a segmentation of the environment, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2008. ,
DOI : 10.1109/IROS.2008.4650734
A frontier-based approach for autonomous exploration, Proceedings 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation CIRA'97. 'Towards New Computational Principles for Robotics and Automation', pp.146-151, 1997. ,
DOI : 10.1109/CIRA.1997.613851
Frontier-based exploration using multiple robots, Proceedings of the second international conference on Autonomous agents , AGENTS '98, pp.47-53, 1998. ,
DOI : 10.1145/280765.280773
URL : http://www.cs.cmu.edu/~motionplanning/papers/sbp_papers/integrated1/yamauchi_frontier_based_explor.pdf
Efficient GPU-based Construction of Occupancy Girds Using several Laser Range-finders, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp.105-110, 2006. ,
DOI : 10.1109/IROS.2006.281817
Multi-robot exploration controlled by a market economy, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292), pp.3016-3023, 2002. ,
DOI : 10.1109/ROBOT.2002.1013690
CoSLAM: Collaborative Visual SLAM in Dynamic Environments, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.35, issue.2, pp.354-366, 2013. ,
DOI : 10.1109/TPAMI.2012.104
Coordination implicite : trois robots sortent d'un couloir exploré et se répartissent demanì eré equilibrée dans les trois couloirs qui s'offrentàoffrentà eux. Lesfrontì eres sont de couleur rouge, les robots de couleur bleu. Chaque robot se dirige vers lafrontì ere la plus proche, p.42 ,
MinDist : tous les robots sont assignésassignésà la mêmefrontì ere ; en bas : avec l'affectation souhaitée : les robots sontégalementsontégalement répartis entre les deuxfrontì eres 43 ,
affectation gloutonne (` a droite) sur l'environnementécurievironnementécurie . Lesfì eches (en ligne pleine) illustrent l'affectation, celles en pointillé montrent lesdeuxì emesfrontì eres pour lesquelles les robots sont en pre-mì ere position, p.50 ,
dans le sens de lecture) : une section d'hôpital (de Player/Stage)), des bureaux, un labyrinthe, une grillerégulì ere et l'environnementécurieenvironnementécurie, Environnements utilisés pour les expériences, p.59, 2003. ,
Les murs sont de couleur noire. Le robot est illustré par le disque bleu et sa cible est en rouge. Le vert montre lafrontì ere, p.66 ,
propagation de vague (en nombre entier etàetà virgule flottante) pour un nombre croissant de robots sur différents environnements. En haut avec l'environnement labyrinthe : ` a gauche le temps de calcul, ` a droite le nombre de cellules o` u la distancè a lafrontì ere a ´ eté calculée. En bas : ` a gauche l'environnement chambre, p.76 ,
occupation, le niveau de gris illustre la probabilité d'occupation : plus il est clair plus la probabilité est importante. Dans la grille de configuration, le gris montre l'espace de configuration, le bleu et le rouge les cellules interdites le rouge correspondantàcorrespondantà la dilatation des obstacles de trois cellules, p.89 ,
le robot peut atteindre lafrontì ere en vert mais il ne pourra pas l'observer car il n'existe pas de configuration permettant son observation, p.97 ,
Les cellulesfrontì eres sont de couleur orange, l'espace libre est blanc, l'espace inexploré en gris En haut : illustration des cercles de différents rayons centrés sur les cellulesfrontì eres. En bas : pour chaque cellule des cercles discrétisés un accumulateur est incrémenté si le segment entre la cellule du cercle et la cellulefrontì ere considérée n'intersecte pas d'obstacle, p.98 ,