scholarly journals Trajectory Planner CDT-RRT* for Car-Like Mobile Robots toward Narrow and Cluttered Environments

Sensors ◽  
2021 ◽  
Vol 21 (14) ◽  
pp. 4828
Author(s):  
Hyunki Kwon ◽  
Donggeun Cha ◽  
Jihoon Seong ◽  
Jinwon Lee ◽  
Woojin Chung

In order to achieve the safe and efficient navigation of mobile robots, it is essential to consider both the environmental geometry and kinodynamic constraints of robots. We propose a trajectory planner for car-like robots on the basis of the Dual-Tree RRT (DT-RRT). DT-RRT utilizes two tree structures in order to generate fast-growing trajectories under the kinodynamic constraints of robots. A local trajectory generator has been newly designed for car-like robots. The proposed scheme of searching a parent node enables the efficient generation of safe trajectories in cluttered environments. The presented simulation results clearly show the usefulness and the advantage of the proposed trajectory planner in various environments.

2010 ◽  
Vol 166-167 ◽  
pp. 161-166
Author(s):  
Ionut Dinulescu ◽  
Dorin Popescu ◽  
Mircea Nitulescu ◽  
Alice Predescu

Recent advances in the domains of social and life artificial intelligence have constituted the basis for a new discipline that studies cooperation in multi-robot systems and its utility in applications where some tasks cannot be carried out by a single robot. This paper introduces a trajectory generator which is used for determination of the most appropriate trajectory which a robot needs to track in order to perform different tasks specific to cooperative robots, such as moving in a given formation or pushing an object to a given destination. Different algorithms are described in this paper, starting from simple polyline and circular paths to complex Bezier trajectories. Simulation results of the proposed path generation system are also provided, along with the description of its implementation on real mobile robots. An implementation of real robots is also presented in this paper.


2011 ◽  
Vol 403-408 ◽  
pp. 4718-4726 ◽  
Author(s):  
Muhannad Mujahed ◽  
Hussein Jaddu

This paper addresses further enhancements of the earlier developed Smooth Nearness-Diagram Navigation (SND) method for mobile robots moving in complex and cluttered environments. The enhanced method, entitled SSND, improves the safety of paths generated by the SND and solves the problem of trapping the robot in narrow corridors, where the difference in the number of threats on its sides is high. This is achieved by adjusting the difference in the number of obstacles on the two sides of the robot heading direction. The power of our method is demonstrated by simulation results.


2019 ◽  
Author(s):  
Abhishek Verma ◽  
Virender Ranga

Relay node placement in wireless sensor networks for constrained environment is a critical task due to various unavoidable constraints. One of the most important constraints is unpredictable obstacles. Handling obstacles during relay node placement is complicated because of complexity involved to estimate the shape and size of obstacles. This paper presents an Obstacle-resistant relay node placement strategy (ORRNP). The proposed solution not only handles the obstacles but also estimates best locations for relay node placement in the network. It also does not involve any additional hardware (mobile robots) to estimate node locations thus can significantly reduce the deployment costs. Simulation results show the effectiveness of our proposed approach.


2017 ◽  
Vol 36 (12) ◽  
pp. 1363-1386 ◽  
Author(s):  
Patrick McGarey ◽  
Kirk MacTavish ◽  
François Pomerleau ◽  
Timothy D Barfoot

Tethered mobile robots are useful for exploration in steep, rugged, and dangerous terrain. A tether can provide a robot with robust communications, power, and mechanical support, but also constrains motion. In cluttered environments, the tether will wrap around a number of intermediate ‘anchor points’, complicating navigation. We show that by measuring the length of tether deployed and the bearing to the most recent anchor point, we can formulate a tethered simultaneous localization and mapping (TSLAM) problem that allows us to estimate the pose of the robot and the positions of the anchor points, using only low-cost, nonvisual sensors. This information is used by the robot to safely return along an outgoing trajectory while avoiding tether entanglement. We are motivated by TSLAM as a building block to aid conventional, camera, and laser-based approaches to simultaneous localization and mapping (SLAM), which tend to fail in dark and or dusty environments. Unlike conventional range-bearing SLAM, the TSLAM problem must account for the fact that the tether-length measurements are a function of the robot’s pose and all the intermediate anchor-point positions. While this fact has implications on the sparsity that can be exploited in our method, we show that a solution to the TSLAM problem can still be found and formulate two approaches: (i) an online particle filter based on FastSLAM and (ii) an efficient, offline batch solution. We demonstrate that either method outperforms odometry alone, both in simulation and in experiments using our TReX (Tethered Robotic eXplorer) mobile robot operating in flat-indoor and steep-outdoor environments. For the indoor experiment, we compare each method using the same dataset with ground truth, showing that batch TSLAM outperforms particle-filter TSLAM in localization and mapping accuracy, owing to superior anchor-point detection, data association, and outlier rejection.


2011 ◽  
Vol 55-57 ◽  
pp. 1195-1199 ◽  
Author(s):  
Min Zuo ◽  
Guang Ping Zeng ◽  
Xu Yan Tu

Trajectory-tracking problem of wheeled mobile robots is investigated. Adaptive control scheme utilized has only one control signal. The control input gives out the velocity increments which will be utilized to adjust the pose of WMR so as to track the desired trajectories. The controller adopted is simple to realize and easy to tune the parameters, which is benefit to real applications. Numerical simulation results show that the control scheme is valid.


2020 ◽  
Vol 65 (3) ◽  
pp. 1-17
Author(s):  
Brian F. Eberle ◽  
Jonathan D. Rogers

Autorotation maneuvers inherently offer little margin for error in execution and induce high pilot workload, particularly as the aircraft nears the ground in an autorotative flare. Control augmentation systems may potentially reduce pilot workload while simultaneously improving the likelihood of a successful landing by offering the pilot appropriate cues. This paper presents an initial investigation of a real-time trajectory generation scheme for autorotative flare based on time-to-contact theory. The algorithm exhibits deterministic runtime performance and provides a speed trajectory that can be tracked by a pilot or inner-loop controller to bring the vehicle to a desired landing point at the time of touchdown. A low-order model of the helicopter dynamics in autorotation is used to evaluate dynamic feasibility of the generated trajectories. By generating and evaluating trajectories to an array of candidate landing points, the set of reachable landing points in front of the aircraft is determined. Simulation results are presented in which the trajectory generator is coupled with a previously derived autorotation controller. Example cases and trade studies are conducted in a six degree-of-freedom simulation environment to demonstrate overall performance as well as robustness of the algorithm to variations in target landing point, helicopter gross weight, and winds. The robustness of the reachability determination portion of the algorithm is likewise evaluated through trade studies examining off-nominal flare entry conditions and the effects of winds.


Robotica ◽  
1990 ◽  
Vol 8 (3) ◽  
pp. 185-194 ◽  
Author(s):  
Jihong Lee ◽  
Zeungnam Bien

SUMMARYA collision-free trajectory control for multiple robots is proposed. The proposed method is based on the concept of neural optimization network. The positions or configurations of robots are taken as the variables of the neural circuit, and the energy of network is determined by combining various functions, in which one function is to make each robot approach to its goal and another helps each robot from colliding with other robots or obstacles. Also a differential equation of the circuit which tends to minimize the energy is derived. A new method for describing collision between articulated arms is presented and some heuristic method to improve the feasibility and the safety of the trajectory is proposed. Also illustrative simulation results for mobile robots and articulated robot arms are presented.


Author(s):  
Jonathan Fink ◽  
Peng Cheng ◽  
Vijay Kumar

In this paper, we address the cooperative towing of payloads by multiple mobile robots in the plane. Robots are attached via cables to a planar object or a pallet carrying a payload. Coordinated motion by the robots allow the payload to be manipulated through a planar, warehouse-like environment. We formulate a quasi-static model for manipulation and derive equations of motion that yield the motion of the payload for a prescribed motion of the robots in the presence of dry friction and tension constraints. We present experimental and simulation results that demonstrate the basic concepts.


2018 ◽  
Vol 160 ◽  
pp. 01007
Author(s):  
Wu Xiaobin ◽  
Xu Shihua ◽  
Zhao Hui ◽  
Zhang Wei

In order to solve the problem of single-phase grounding fault judgment in non-solid-earthed distribution network, the power flow in non-solid-earthed distribution is analyzed. A single-phase grounding fault judgment method based on mutation current logic matrix is proposed. The minimum fault judgment area model is constructed by the parent and child nodes. The feeder mutation current matrix is generated by the feeder real-time current matrix and the feeder history current matrix. The feeder mutation current matrix is transformed into the feeder mutation current logic matrix by the capacitance current threshold, and the non-zero elements of the feeder mutation current logic matrix are extracted into the mutation current logic sequence list. Then the single-phase grounding fault can be determined in the minimum fault judgment area of the last element of the mutation current logic sequence list as the parent node. The detailed calculation formulas are given. This method is also applicable to the non-solid-earthed distribution network containing distributed generation. The simulation results show that the method proposed in this paper has a good adaptability to the permanent grounding fault and it is worth popularizing.


Robotica ◽  
2015 ◽  
Vol 34 (9) ◽  
pp. 2140-2150 ◽  
Author(s):  
Andre G. S. Conceicao ◽  
Mariane D. Correia ◽  
Luciana Martinez

SUMMARYIn this study, a model for wheeled mobile robots that includes a static friction model in the force balance at the robot's center of mass is presented. Additionally, a least-squares method to linearly combine functions is proposed to estimate the friction coefficients. The experimental and simulation results are discussed to demonstrate the effectiveness of this approach in indoor environments for two floor types.


Sign in / Sign up

Export Citation Format

Share Document