Abstract: In this paper, we introduce the problem of view planning with combined view and traveling cost, denoted by traveling VPP. It refers to planning a sequence of sensing actions with minimum total cost by a robot-sensor system to completely inspect the surfaces of objects in a known workspace.
Abstract—In this paper, we introduce the problem of view planning with combined view and traveling cost, denoted by. Traveling VPP. It refers to planning a ...
In this paper, we introduce the problem of view planning with combined view and traveling cost, denoted by traveling VPP. It refers to planning a sequence ...
The focus of this paper is to design an approximation algorithm that guarantees worst-case performance and proposes a linear program based rounding ...
The cost to minimize is a combination of the view cost, proportional to the number of viewpoints planned, and the traveling cost for the robot to realize them.
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta: View Planning Problem with Combined View and Traveling Cost. ICRA 2007: 711-716. manage site settings.
In this paper, we introduce the problem of view planning with combined view and traveling cost, denoted by traveling VPP. It refers to planning a sequence of ...
View Planning Problem with Combined View and Traveling Cost. Wang P., Krishnamurti R., Gupta K. Expand. Publication type: Proceedings Article.
View planning with combined view and travel cost. ... 97 6.2.1 Problem assumptions 6.2.2 Problem definition .
This paper considers the problem where a point robot in a 2D or 3D environment equipped with an omnidirectional range sensor of finite range D is asked to ...