Survey on the View Planning Problem for Reverse Engineering and Automated Control Applications

2021 ◽  
pp. 103094
Author(s):  
Manon Peuzin-Jubert ◽  
Arnaud Polette ◽  
Dominique Nozais ◽  
Jean-Luc Mari ◽  
Jean-Philippe Pernot
2010 ◽  
Vol 20 (02) ◽  
pp. 119-146 ◽  
Author(s):  
PENGPENG WANG ◽  
RAMESH KRISHNAMURTI ◽  
KAMAL GUPTA

In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) and a set of discrete viewpoints on the planned route such that every point on the polygon boundary is visible from at least one viewpoint. Each planned viewpoint has some associated cost. The total cost to minimize is a weighted sum of the view cost, proportional to the number of viewpoints, and the travel cost, the total length of the route. We call this problem the Generalized Watchman Route Problem or the GWRP. We tackle a restricted nontrivial (it remains NP-hard and log-inapproximable) version of GWRP where each polygon edge is entirely visible from at least one planned viewpoint. We call it Whole Edge Covering GWRP. The algorithm we propose first constructs a graph that connects O(n12) number of sample viewpoints in the polygon, where n is the number of polygon vertices; and then solves the corresponding View Planning Problem with Combined View and Traveling Cost, using an LP-relaxation based algorithm we introduced in [27, 29]. We show that our algorithm has an approximation ratio in the order of either the view frequency, defined as the maximum number of sample viewpoints that cover a polygon edge, or a polynomial of log n, whichever is smaller.


2020 ◽  
Vol 6 (3) ◽  
pp. 225-245
Author(s):  
Rui Zeng ◽  
Yuhui Wen ◽  
Wang Zhao ◽  
Yong-Jin Liu

Abstract Rapid development of artificial intelligence motivates researchers to expand the capabilities of intelligent and autonomous robots. In many robotic applications, robots are required to make planning decisions based on perceptual information to achieve diverse goals in an efficient and effective way. The planning problem has been investigated in active robot vision, in which a robot analyzes its environment and its own state in order to move sensors to obtain more useful information under certain constraints. View planning, which aims to find the best view sequence for a sensor, is one of the most challenging issues in active robot vision. The quality and efficiency of view planning are critical for many robot systems and are influenced by the nature of their tasks, hardware conditions, scanning states, and planning strategies. In this paper, we first summarize some basic concepts of active robot vision, and then review representative work on systems, algorithms and applications from four perspectives: object reconstruction, scene reconstruction, object recognition, and pose estimation. Finally, some potential directions are outlined for future work.


1994 ◽  
Vol 27 (1) ◽  
pp. 133-134
Author(s):  
Michael A. Henson ◽  
Martin Pottmann ◽  
Babatunde A. Ogunnaike ◽  
James S. Schwaber

2008 ◽  
Vol 45 ◽  
pp. 161-176 ◽  
Author(s):  
Eduardo D. Sontag

This paper discusses a theoretical method for the “reverse engineering” of networks based solely on steady-state (and quasi-steady-state) data.


2004 ◽  
Author(s):  
Gloria L. Calhoun ◽  
John V. Fontejon ◽  
Mark H. Draper ◽  
Heath A. Ruff ◽  
Brian J. Guilfoos
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document