首页|Findings on Robotics Discussed by Investigators at Liaocheng University (An Impr oved Iterated Greedy Algorithm for Solving Rescue Robot Path Planning Problem Wi th Limited Survival Time)
Findings on Robotics Discussed by Investigators at Liaocheng University (An Impr oved Iterated Greedy Algorithm for Solving Rescue Robot Path Planning Problem Wi th Limited Survival Time)
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
By a News Reporter-Staff News Editor at Robotics & Machine Learning DailyNews - Research findings on Robotics are discussed in a new report. According to news reporting originatingin Liaocheng, People’s Repub lic of China, by NewsRx journalists, research stated, “Effective path planningi s crucial for mobile robots to quickly reach rescue destination and complete res cue tasks in a post-disasterscenario. In this study, we investigated the post-d isaster rescue path planning problem and modeled thisproblem as a variant of th e travel salesman problem (TSP) with life-strength constraints.”
LiaochengPeople’s Republic of ChinaA siaAlgorithmsEmerging TechnologiesMachine LearningRobotRoboticsLiaoc heng University
NETL
NSTL
