scholarly journals Odor Markers Detection System for Mobile Robot Navigation

2012 ◽  
Vol 47 ◽  
pp. 1442-1445 ◽  
Author(s):  
Piotr Batog ◽  
Andrzej Wołczowski
Author(s):  
Saurabh Sarkar ◽  
Manish Kumar

The paper presents a swarm based lane detection system which uses cooperating agents acting on different regions of the images obtained from an onboard robot camera. These agents act on the image and communicate with each other to find out the possible location of the lane in the image. The swarm agents finalize their locations based on a set of rules which includes each other’s relative position and their previous locations. The swarm agents place themselves on the lane and generate a guidance path for the robot. This proposed lane detection method is is fast and robust to noises in the image. It is faster than the regression methods commonly used and can overcome the problem of noisy image to a good extent.


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

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

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Kun-Lin Wu ◽  
Ting-Jui Ho ◽  
Sean A. Huang ◽  
Kuo-Hui Lin ◽  
Yueh-Chen Lin ◽  
...  

In this paper, mobile robot navigation on a 3D terrain with a single obstacle is addressed. The terrain is modelled as a smooth, complete manifold with well-defined tangent planes and the hazardous region is modelled as an enclosing circle with a hazard grade tuned radius representing the obstacle projected onto the terrain to allow efficient path-obstacle intersection checking. To resolve the intersections along the initial geodesic, by resorting to the geodesic ideas from differential geometry on surfaces and manifolds, we present a geodesic-based planning and replanning algorithm as a new method for obstacle avoidance on a 3D terrain without using boundary following on the obstacle surface. The replanning algorithm generates two new paths, each a composition of two geodesics, connected via critical points whose locations are found to be heavily relying on the exploration of the terrain via directional scanning on the tangent plane at the first intersection point of the initial geodesic with the circle. An advantage of this geodesic path replanning procedure is that traversability of terrain on which the detour path traverses could be explored based on the local Gauss-Bonnet Theorem of the geodesic triangle at the planning stage. A simulation demonstrates the practicality of the analytical geodesic replanning procedure for navigating a constant speed point robot on a 3D hill-like terrain.


Sign in / Sign up

Export Citation Format

Share Document