Sub-optimal trajectory planning for autonomous navigation of an airship - [Not available for publication]

Author(s):  
S. Hima
2021 ◽  
Vol 13 (3) ◽  
pp. 1233
Author(s):  
Ángel Valera ◽  
Francisco Valero ◽  
Marina Vallés ◽  
Antonio Besa ◽  
Vicente Mata ◽  
...  

Autonomous navigation is a complex problem that involves different tasks, such as location of the mobile robot in the scenario, robotic mapping, generating the trajectory, navigating from the initial point to the target point, detecting objects it may encounter in its path, etc. This paper presents a new optimal trajectory planning algorithm that allows the assessment of the energy efficiency of autonomous light vehicles. To the best of our knowledge, this is the first time in the literature that this is carried out by minimizing the travel time while considering the vehicle’s dynamic behavior, its limitations, and with the capability of avoiding obstacles and constraining energy consumption. This enables the automotive industry to design environmentally sustainable strategies towards compliance with governmental greenhouse gas (GHG) emission regulations and for climate change mitigation and adaptation policies. The reduction in energy consumption also allows companies to stay competitive in the marketplace. The vehicle navigation control is efficiently implemented through a middleware of component-based software development (CBSD) based on a Robot Operating System (ROS) package. It boosts the reuse of software components and the development of systems from other existing systems. Therefore, it allows the avoidance of complex control software architectures to integrate the different hardware and software components. The global maps are created by scanning the environment with FARO 3D and 2D SICK laser sensors. The proposed algorithm presents a low computational cost and has been implemented as a new module of distributed architecture. It has been integrated into the ROS package to achieve real time autonomous navigation of the vehicle. The methodology has been successfully validated in real indoor experiments using a light vehicle under different scenarios entailing several obstacle locations and dynamic parameters.


2021 ◽  
Vol 13 (7) ◽  
pp. 168781402110346
Author(s):  
Yunyue Zhang ◽  
Zhiyi Sun ◽  
Qianlai Sun ◽  
Yin Wang ◽  
Xiaosong Li ◽  
...  

Due to the fact that intelligent algorithms such as Particle Swarm Optimization (PSO) and Differential Evolution (DE) are susceptible to local optima and the efficiency of solving an optimal solution is low when solving the optimal trajectory, this paper uses the Sequential Quadratic Programming (SQP) algorithm for the optimal trajectory planning of a hydraulic robotic excavator. To achieve high efficiency and stationarity during the operation of the hydraulic robotic excavator, the trade-off between the time and jerk is considered. Cubic splines were used to interpolate in joint space, and the optimal time-jerk trajectory was obtained using the SQP with joint angular velocity, angular acceleration, and jerk as constraints. The optimal angle curves of each joint were obtained, and the optimal time-jerk trajectory planning of the excavator was realized. Experimental results show that the SQP method under the same weight is more efficient in solving the optimal solution and the optimal excavating trajectory is smoother, and each joint can reach the target point with smaller angular velocity, and acceleration change, which avoids the impact of each joint during operation and conserves working time. Finally, the excavator autonomous operation becomes more stable and efficient.


Author(s):  
Mingxing Yuan ◽  
Bin Yao ◽  
Dedong Gao ◽  
Xiaocong Zhu ◽  
Qingfeng Wang

Time optimal trajectory planning under various hard constraints plays a significant role in simultaneously meeting the requirements on high productivity and high accuracy in the fields of both machining tools and robotics. In this paper, the problem of time optimal trajectory planning is first formulated. A novel back and forward check algorithm is subsequently proposed to solve the minimum time feed-rate optimization problem. The basic idea of the algorithm is to search the feasible solution in the specified interval using the back or forward operations. Four lemmas are presented to illustrate the calculating procedure of optimal solution and the feasibility of the proposed algorithm. Both the elliptic curve and eight profile are used as case studies to verify the effectiveness of the proposed algorithm.


Sign in / Sign up

Export Citation Format

Share Document