Multiobjective Problem to Find Paths through Swarm Robotics

Rebeca Solis-Ortega, Cindy Calderón-Arce
{"title":"Multiobjective Problem to Find Paths through Swarm Robotics","authors":"Rebeca Solis-Ortega, Cindy Calderón-Arce","doi":"10.1145/3365265.3365275","DOIUrl":null,"url":null,"abstract":"In this paper, we present a scheme to solve the problem to explore, cover and define paths in dangerous environments. The proposal is organized in three phases: exploration, mapping and path planning. Swarm robotics is used in the first phase along with a stigmergy approach for the communication between the agents. The explored cell will be stored in order to create a grid map. In the path planning phase, a multiobjective problem is used to minimize distance and danger, through a graph obtained by an adapted RRG, and a genetic algorithm called modified NSGA-II.","PeriodicalId":358714,"journal":{"name":"Proceedings of the 2019 3rd International Conference on Automation, Control and Robots","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 3rd International Conference on Automation, Control and Robots","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3365265.3365275","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, we present a scheme to solve the problem to explore, cover and define paths in dangerous environments. The proposal is organized in three phases: exploration, mapping and path planning. Swarm robotics is used in the first phase along with a stigmergy approach for the communication between the agents. The explored cell will be stored in order to create a grid map. In the path planning phase, a multiobjective problem is used to minimize distance and danger, through a graph obtained by an adapted RRG, and a genetic algorithm called modified NSGA-II.
基于群机器人的多目标寻径问题
本文提出了一种解决危险环境中路径探索、覆盖和定义问题的方案。该方案分为三个阶段:探索、绘图和路径规划。在第一阶段使用群体机器人,并使用污名化方法在代理之间进行通信。被探索的单元格将被存储以创建网格图。在路径规划阶段,采用多目标问题,通过改进的RRG和改进的NSGA-II遗传算法得到的图来最小化距离和危险。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信