首页|Findings from National Institute of Applied Science (INSA) Lyon Provide New Insights into Robotics (Non-crossing Anonymous Mapf for Tethered Robots)
Findings from National Institute of Applied Science (INSA) Lyon Provide New Insights into Robotics (Non-crossing Anonymous Mapf for Tethered Robots)
扫码查看
点击上方二维码区域,可以放大扫码查看
原文链接
NETL
NSTL
Investigators publish new report on Robotics. According to news originating from Villeurbanne, France, by NewsRx correspondents, research stated, "This paper deals with the anonymous multi-agent path finding (MAPF) problem for a team of tethered robots. The goal is to find a set of non-crossing paths such that the makespan is minimal." Financial support for this research came from European Commission Joint Research Centre. Our news journalists obtained a quote from the research from the National Institute of Applied Science (INSA) Lyon, "A difficulty comes from the fact that a safety distance must be maintained between two robots when they pass through the same subpath, to avoid collisions and cable entanglements. Hence, robots must be synchronized and waiting times must be added when computing the makespan. We show that bounds can be efficiently computed by solving linear assignment problems. We introduce a variable neighborhood search method to improve upper bounds, and a Constraint Programming model to compute optimal solutions." According to the news editors, the research concluded: "We experimentally evaluate our approach on three different kinds of instances."
VilleurbanneFranceEuropeEmerging TechnologiesMachine LearningNano-robotRoboticsNational Institute of Applied Science (INSA) Lyon