Comparing Reinforcement Learning Algorithms for a Trip Building Task: a Multi-objective Approach Using Non-Local Information.
Saved in:
| Title: | Comparing Reinforcement Learning Algorithms for a Trip Building Task: a Multi-objective Approach Using Non-Local Information. |
|---|---|
| Authors: | Gobbi, Henrique U.1 hugobbi@inf.ufrgs.br, Dytz dos Santos, Guilherme1 gdsantos@inf.ufrgs.br, Bazzan, Ana L. C.1 bazzan@inf.ufrgs.br |
| Source: | Computer Science & Information Systems. Jan2024, Vol. 21 Issue 1, p291-308. 18p. |
| Subjects: | Stochastic learning models, Machine learning, Reinforcement learning, Travel time (Traffic engineering), Carbon monoxide |
| Abstract: | Using reinforcement learning (RL) to support agents in making decisions that consider more than one objective poses challenges. We formulate the problem of multiple agents learning how to travel from A to B as a reinforcement learning task modeled as a stochastic game, in which we take into account: (i) more than one objective, (ii) non-stationarity, (iii) communication of local and non-local information among the various actors. We use and compare RL algorithms, both for the single objective (Q-learning), as well as for multiple objectives (Pareto Qlearning), with and without non-local communication. We evaluate these methods in a scenario in which hundreds of agents have to learn how to travel from their origins to their destinations, aiming at minimizing their travel times, as well as the carbon monoxide vehicles emit. Results show that the use of non-local communication reduces both travel time and emissions. [ABSTRACT FROM AUTHOR] |
| Copyright of Computer Science & Information Systems is the property of ComSIS Consortium and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 175427944 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Comparing Reinforcement Learning Algorithms for a Trip Building Task: a Multi-objective Approach Using Non-Local Information. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Gobbi%2C+Henrique+U%2E%22">Gobbi, Henrique U.</searchLink><relatesTo>1</relatesTo><i> hugobbi@inf.ufrgs.br</i><br /><searchLink fieldCode="AR" term="%22Dytz+dos+Santos%2C+Guilherme%22">Dytz dos Santos, Guilherme</searchLink><relatesTo>1</relatesTo><i> gdsantos@inf.ufrgs.br</i><br /><searchLink fieldCode="AR" term="%22Bazzan%2C+Ana+L%2E+C%2E%22">Bazzan, Ana L. C.</searchLink><relatesTo>1</relatesTo><i> bazzan@inf.ufrgs.br</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Computer+Science+%26+Information+Systems%22">Computer Science & Information Systems</searchLink>. Jan2024, Vol. 21 Issue 1, p291-308. 18p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Stochastic+learning+models%22">Stochastic learning models</searchLink><br /><searchLink fieldCode="DE" term="%22Machine+learning%22">Machine learning</searchLink><br /><searchLink fieldCode="DE" term="%22Reinforcement+learning%22">Reinforcement learning</searchLink><br /><searchLink fieldCode="DE" term="%22Travel+time+%28Traffic+engineering%29%22">Travel time (Traffic engineering)</searchLink><br /><searchLink fieldCode="DE" term="%22Carbon+monoxide%22">Carbon monoxide</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Using reinforcement learning (RL) to support agents in making decisions that consider more than one objective poses challenges. We formulate the problem of multiple agents learning how to travel from A to B as a reinforcement learning task modeled as a stochastic game, in which we take into account: (i) more than one objective, (ii) non-stationarity, (iii) communication of local and non-local information among the various actors. We use and compare RL algorithms, both for the single objective (Q-learning), as well as for multiple objectives (Pareto Qlearning), with and without non-local communication. We evaluate these methods in a scenario in which hundreds of agents have to learn how to travel from their origins to their destinations, aiming at minimizing their travel times, as well as the carbon monoxide vehicles emit. Results show that the use of non-local communication reduces both travel time and emissions. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Computer Science & Information Systems is the property of ComSIS Consortium and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=175427944 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.2298/CSIS221210072G Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 18 StartPage: 291 Subjects: – SubjectFull: Stochastic learning models Type: general – SubjectFull: Machine learning Type: general – SubjectFull: Reinforcement learning Type: general – SubjectFull: Travel time (Traffic engineering) Type: general – SubjectFull: Carbon monoxide Type: general Titles: – TitleFull: Comparing Reinforcement Learning Algorithms for a Trip Building Task: a Multi-objective Approach Using Non-Local Information. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Gobbi, Henrique U. – PersonEntity: Name: NameFull: Dytz dos Santos, Guilherme – PersonEntity: Name: NameFull: Bazzan, Ana L. C. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Text: Jan2024 Type: published Y: 2024 Identifiers: – Type: issn-print Value: 18200214 Numbering: – Type: volume Value: 21 – Type: issue Value: 1 Titles: – TitleFull: Computer Science & Information Systems Type: main |
| ResultId | 1 |
