scholarly journals Trajectory estimation and position correction for hopping robot navigation using monocular camera

2020 ◽  
Vol 7 (1) ◽  
Author(s):  
Gabor Kovacs ◽  
Yasuharu Kunii ◽  
Takao Maeda ◽  
Hideki Hashimoto
2014 ◽  
Vol 34 (2) ◽  
pp. 160-168 ◽  
Author(s):  
Robert Schmitt ◽  
Yu Cai

Purpose – Automated robotic assembly on a moving workpiece, referred to as assembly in motion, demands that an assembly robot is synchronised in all degrees of freedom to the moving workpiece, on which assembly parts are installed. Currently, this requirement cannot be met due to the lack of robust estimation of 3D positions and the trajectory of the moving workpiece. The purpose of this paper is to develop a camera system that measures the 3D trajectory of the moving workpiece for robotic assembly in motion. Design/methodology/approach – For the trajectory estimation, an assembly robot-guided, monocular camera system is developed. The motion trajectory of a workpiece is estimated, as the trajectory is considered as a linear combination of trajectory bases, such as discrete cosine transform bases. Findings – The developed camera system for trajectory estimation is tested within the robotic assembly of a cylinder block in motion. The experimental results show that the proposed method is able to reconstruct arbitrary trajectories of an assembly point on a workpiece moving in 3D space. Research limitations/implications – With the developed technology, a point trajectory can be recovered offline only after all measurement images are acquired. For practical assembly tasks in real production, this method should be extended to determine the trajectory online during the motion of a workpiece. Practical implications – For practical, robotic assembly in motion, such as assembling tires, wheels and windscreens on conveyed vehicle bodies, the developed technology can be used for positioning a moving workpiece, which is in the distant field of an assembly robot. Originality/value – Besides laser trackers, indoor global positioning systems and stereo cameras, this paper provides a solution of trajectory estimation by using a monocular camera system.


ETRI Journal ◽  
2018 ◽  
Vol 40 (4) ◽  
pp. 446-457 ◽  
Author(s):  
Young-Joong Han ◽  
In-Seok Kim ◽  
Young-Dae Hong

2020 ◽  
Vol 16 (8) ◽  
pp. 1215
Author(s):  
Kan Xiu ◽  
He Jia ◽  
Xi Zhenghao

Author(s):  
Diego Gabriel Gomes Rosa ◽  
Carlos Luiz Machado de souza junior ◽  
Marco Antonio Meggiolaro ◽  
Luiz Fernando Martha

Author(s):  
Jia-Bao Liu ◽  
Muhammad Faisal Nadeem ◽  
Mohammad Azeem

Aims and Objective: The idea of partition and resolving sets plays an important role in various areas of engineering, chemistry and computer science such as robot navigation, facility location, pharmaceutical chemistry, combinatorial optimization, networking, and mastermind game. Method: In a graph to obtain the exact location of a required vertex which is unique from all the vertices, several vertices are selected this is called resolving set and its generalization is called resolving partition, where selected vertices are in the form of subsets. Minimum number of partitions of the vertices into sets is called partition dimension. Results: It was proved that determining the partition dimension a graph is nondeterministic polynomial time (NP) problem. In this article, we find the partition dimension of convex polytopes and provide their bounds. Conclusion: The major contribution of this article is that, due to the complexity of computing the exact partition dimension we provides the bounds and show that all the graphs discussed in results have partition dimension either less or equals to 4, but it cannot been be greater than 4.


1990 ◽  
Vol 2 (1) ◽  
pp. 35 ◽  
Author(s):  
R.A. Lotufo ◽  
A.D. Morgan ◽  
E.L. Dagless ◽  
D.J. Milford ◽  
J.F. Morrissey ◽  
...  

2019 ◽  
Vol 17 (1) ◽  
pp. 1303-1309 ◽  
Author(s):  
Ghulam Abbas ◽  
Usman Ali ◽  
Mobeen Munir ◽  
Syed Ahtsham Ul Haq Bokhary ◽  
Shin Min Kang

Abstract Classical applications of resolving sets and metric dimension can be observed in robot navigation, networking and pharmacy. In the present article, a formula for computing the metric dimension of a simple graph wihtout singleton twins is given. A sufficient condition for the graph to have the exchange property for resolving sets is found. Consequently, every minimal resolving set in the graph forms a basis for a matriod in the context of independence defined by Boutin [Determining sets, resolving set and the exchange property, Graphs Combin., 2009, 25, 789-806]. Also, a new way to define a matroid on finite ground is deduced. It is proved that the matroid is strongly base orderable and hence satisfies the conjecture of White [An unique exchange property for bases, Linear Algebra Appl., 1980, 31, 81-91]. As an application, it is shown that the power graphs of some finite groups can define a matroid. Moreover, we also compute the metric dimension of the power graphs of dihedral groups.


Sign in / Sign up

Export Citation Format

Share Document