Multi-agent Systems and R-Trees for Dynamic ...
Type de document :
Communication dans un congrès avec actes
Titre :
Multi-agent Systems and R-Trees for Dynamic and Optimised Ridesharing
Auteur(s) :
Fèvre, Corwin [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Centrale Lille
Zgaya-Biau, Hayfa [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Centrale Lille
Mathieu, Philippe [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Université de Lille
Hammadi, Slim [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Centrale Lille
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Centrale Lille
Zgaya-Biau, Hayfa [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Centrale Lille
Mathieu, Philippe [Auteur]

Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Université de Lille
Hammadi, Slim [Auteur]

Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Centrale Lille
Titre de la manifestation scientifique :
IEEE International Conference on Systems, Man, and Cybernetics (SMC'2021)
Ville :
Melbourne
Pays :
Australie
Date de début de la manifestation scientifique :
2021-10-17
Date de publication :
2021
Discipline(s) HAL :
Informatique [cs]/Système multi-agents [cs.MA]
Informatique [cs]/Intelligence artificielle [cs.AI]
Computer Science [cs]/Operations Research [math.OC]
Informatique [cs]/Intelligence artificielle [cs.AI]
Computer Science [cs]/Operations Research [math.OC]
Résumé en anglais : [en]
In this paper, we study the multi-hop on-demand ridesharing between riders and drivers which are represented as autonomous and rational agents. The goal is to reach the best balance between ridesharing supply and demand. ...
Lire la suite >In this paper, we study the multi-hop on-demand ridesharing between riders and drivers which are represented as autonomous and rational agents. The goal is to reach the best balance between ridesharing supply and demand. In this context, each agent has its own dynamic perception represented by a bounding box and computed according to its respective constraints and preferences. These perceptions are stored in a spatial R-Tree index allowing users to perform perception overlap queries and identify possible trip shares. The evaluation and selection of optimal path shares is performed by the rider agent based on its objective function. We perform experiments by varying the detour factor of the drivers and demonstrate the validity of our model. We point out the need for optimization on the selection of the optimal transfer node. Finally, we prove the efficiency of our multi-agent based multi-hop ridesharing in terms of service rate and saved distance.Lire moins >
Lire la suite >In this paper, we study the multi-hop on-demand ridesharing between riders and drivers which are represented as autonomous and rational agents. The goal is to reach the best balance between ridesharing supply and demand. In this context, each agent has its own dynamic perception represented by a bounding box and computed according to its respective constraints and preferences. These perceptions are stored in a spatial R-Tree index allowing users to perform perception overlap queries and identify possible trip shares. The evaluation and selection of optimal path shares is performed by the rider agent based on its objective function. We perform experiments by varying the detour factor of the drivers and demonstrate the validity of our model. We point out the need for optimization on the selection of the optimal transfer node. Finally, we prove the efficiency of our multi-agent based multi-hop ridesharing in terms of service rate and saved distance.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :