Time-space Viewpoint Planning for Guard Robot with Chance Constraint

Ardiyanto, Igi; Miura, Jun

doi:10.1007/s11633-018-1146-7

Cited by 6 publications

(1 citation statement)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Osswald et al [126] used the inverse reachability map combined with the NBV algorithm to improve robot poses and viewpoint planning problems by filtering possible view candidates. Ardiyanto and Miura [127] presented a visibility coverage based on polygon search using skeletonization technique to generate coverage viewpoints and improve the viewpoint planner further to minimize the energy consumptions of the robot's movement, thus, maintaining visibility of a moving target [128]. However, the robot may fail to track if an occlusion occurred.…”

Section: ) View Planning and Motion Planningmentioning

confidence: 99%

A Comprehensive Review of Coverage Path Planning in Robotics Using Classical and Heuristic Algorithms

Tan

Mohd‐Mokhtar²,

Arshad

2021

IEEE Access

View full text Add to dashboard Cite

The small battery capacities of the mobile robot and the un-optimized planning efficiency of the industrial robot bottlenecked the time efficiency and productivity rate of coverage tasks in terms of speed and accuracy, putting a great constraint on the usability of the robot applications in various planning strategies in specific environmental conditions. Thus, it became highly desirable to address the optimization problems related to exploration and coverage path planning (CPP). In general, the goal of the CPP is to find an optimal coverage path with generates a collision-free trajectory by reducing the travel time, processing speed, cost energy, and the number of turns along the path length, as well as low overlapped rate, which reflect the robustness of CPP. This paper reviews the principle of CPP and discusses the development trend, including design variations and the characteristic of optimization algorithms, such as classical, heuristic, and most recent deep learning methods. Then, we compare the advantages and disadvantages of the existing CPP-based modeling in the area and target coverage. Finally, we conclude numerous open research problems of the CPP and make suggestions for future research directions to gain insights. INDEX TERMSCoverage path planning, exploration, heuristic algorithm, deep reinforcement learning.

show abstract

Section: ) View Planning and Motion Planningmentioning

confidence: 99%