Author of the publication

Multi-goal pathfinding in ubiquitous environments: modeling and exploiting knowledge to satisfy goals.

, , and . WI, page 1147-1150. ACM, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Modélisation d'une pertubation sur un réseau de transport : le modèle Incident.. INFORSID, page 210-228. (2000)A Tree-Based Context Model to Optimize Multiagent Simulation., , and . MATES, volume 8732 of Lecture Notes in Computer Science, page 251-265. Springer, (2014)Agent Information Server: A Middleware for Traveler Information., , and . ESAW, volume 3963 of Lecture Notes in Computer Science, page 14-28. Springer, (2005)Environment as Active Support of Interaction., , and . E4MAS, volume 4389 of Lecture Notes in Computer Science, page 87-105. Springer, (2006)On the Use of Symbolic Data Analysis to Model Communication Environments., and . CIA, volume 5180 of Lecture Notes in Computer Science, page 234-248. Springer, (2008)Collaborative Search for Multi-goal Pathfinding in Ubiquitous Environments., , and . MATES, volume 10413 of Lecture Notes in Computer Science, page 72-88. Springer, (2017)Approches multiagents pour l'allocation de courses à une flotte de taxis autonomes., , and . Rev. d'Intelligence Artif., 32 (2): 223-247 (2018)Decentralized Insertion Heuristic with Runtime Optimization for On-demand Transport Scheduling., , , and . ATT@ECAI, volume 2701 of CEUR Workshop Proceedings, page 9-15. CEUR-WS.org, (2020)Un modèle agent générique pour la comparaison d'approches d'allocation de ressources dans le domaine du transport à la demande., , , and . JFSMA, page 127-136. Cépaduès, (2021)Collaborative Agents for Modeling Traffic Regulation Systems., , , and . IAT, page 7-13. IEEE Computer Society, (2011)978-0-7695-4513-4.