Search

Lower-limb exoskeletons (LLEs) can provide rehabilitation training and walking assistance for individuals with lower-limb dysfunction or those in need of functionality enhancement. Adapting and personalizing the LLEs is crucial for them to form an intelligent human–machine system (HMS). However, numerous LLEs lack thorough consideration of individual differences in motion planning, leading to subpar human performance. Prioritizing human physiological response is a critical objective of trajectory optimization for the HMS. This paper proposes a human-in-the-loop (HITL) motion planning method that utilizes surface electromyography signals as biofeedback for the HITL optimization. The proposed method combines offline trajectory optimization with HITL trajectory selection. Based on the derived hybrid dynamical model of the HMS, the offline trajectory is optimized using a direct collocation method, while HITL trajectory selection is based on Thompson sampling. The direct collocation method optimizes various gait trajectories and constructs a gait library according to the energy optimality law, taking into consideration dynamics and walking constraints. Subsequently, an optimal gait trajectory is selected for the wearer using Thompson sampling. The selected gait trajectory is then implemented on the LLE under a hybrid zero dynamics control strategy. Through the HITL optimization and control experiments, the effectiveness and superiority of the proposed method are verified. [ABSTRACT FROM AUTHOR]

The recent technology advancements in miniaturizing the primary components of spacecraft allow the classic CubeSats to be considered as a valid option in the design of a deep space scientific mission, not just to support a main typical interplanetary spacecraft. In this context, the proposed ESA M-ARGO mission, whose launch is currently planned in 2026, will use the electric thruster installed onboard of a 12U CubeSat to transfer the small satellite from the Sun–Earth second Lagrangian point to the orbit of a small and rapidly spinning asteroid. Starting from the surrogate model of the M-ARGO propulsion system proposed in the recent literature, this paper analyzes a simplified thrust vector model that can be used to study the heliocentric optimal transfer trajectory with a classical indirect approach. This simplified thrust model is a variation of the surrogate one used to complete the preliminary design of the trajectory of the M-ARGO mission, and it allows to calculate, in an analytical form, the typical Euler–Lagrange equations without singularities. The thrust model is then used to study the performance of a M-ARGO-type CubeSat (MTC) in a different scenario (compared to that of the real mission), in which the small satellite moves along a circular heliocentric orbit in the context of a classic phasing maneuver. In this regard, the work discusses a simplified study of the optimal constrained MTC transfer towards one of the two Sun–Earth triangular Lagrangian points. Therefore, the contributions of this paper are essentially two: the first is the simplified thrust model that can be used to analyze the heliocentric trajectory of a MTC; the second is a novel mission application of a CubeSat, equipped with an electric thruster, moving along a circular heliocentric orbit in a phasing maneuver. [ABSTRACT FROM AUTHOR]

Drone technology has undoubtedly become an integral part of our everyday life in recent years. The business and industrial use of unmanned aerial vehicles (UAVs) can provide advantageous solutions in many areas of life, and they are also optimal for emergency situations and for accessing hard-to-reach places. However, their application poses numerous technological and regulatory challenges to be overcome. One of the weak links in the operation of UAVs is the limited availability of energy. In order to address this issue, the authors developed a novel trajectory planning method for UAVs to optimize energy consumption during flight. First, an "energy map" was created, which was the basis for trajectory planning, i.e., determining the energy consumption of the individual components. This was followed by configuring the 3D environment including partitioning of the work space (WS), i.e., defining the free spaces, occupied spaces (obstacles), and semi-occupied/free spaces. Then, the corresponding graph-like path(s) were generated on the basis of the partitioned space, where a graph search-based heuristic trajectory planning was initiated, taking into account the most important wind conditions including velocity and direction. Finally, in order to test the theoretical results, some sample environments were created to test and analyze the proposed path generations. The method eventually proposed was able to determine the optimal path in terms of energy consumption. [ABSTRACT FROM AUTHOR]

We consider a complex control problem: making a monopod accurately reach a target with a single jump. The monopod can jump in any direction at different elevations of the terrain. This is a paradigm for a much larger class of problems, which are extremely challenging and computationally expensive to solve using standard optimization-based techniques. Reinforcement learning (RL) is an interesting alternative, but an end-to-end approach in which the controller must learn everything from scratch can be non-trivial with a sparse-reward task like jumping. Our solution is to guide the learning process within an RL framework leveraging nature-inspired heuristic knowledge. This expedient brings widespread benefits, such as a drastic reduction of learning time, and the ability to learn and compensate for possible errors in the low-level execution of the motion. Our simulation results reveal a clear advantage of our solution against both optimization-based and end-to-end RL approaches. [ABSTRACT FROM AUTHOR]

Trajectory optimization is a method of finding the optimal route connecting a start and end point. The suitability of a trajectory depends on not intersecting any obstacles, as well as predefined performance metrics. In the context of unmanned aerial vehicles (UAVs), the goal is to minimize the route cost, in terms of energy or time, while avoiding restricted flight zones. Artificial intelligence techniques, including evolutionary computation, have been applied to trajectory optimization with varying degrees of success. This work explores the use of genetic programming (GP) for 3D trajectory optimization by developing a novel GP algorithm to optimize trajectories in a 3D space by encoding 3D geographic trajectories as function trees. The effects of parameterization are also explored and discussed, demonstrating the advantages and drawbacks of custom parameter settings along with additional evolutionary computational techniques. The results demonstrate the effectiveness of the proposed algorithm, which outperforms existing methods in terms of speed, automaticity, and robustness, highlighting the potential for GP-based algorithms to be applied to other complex optimization problems in science and engineering. [ABSTRACT FROM AUTHOR]

Vibration problems have become one of the most important factors affecting robot performance. To this end, a terminal residual vibration suppression method based on joint trajectory optimization is proposed to improve the accuracy and stability of robot motion. Firstly, based on the characteristics of the friction nonlinearity due to joint coupling and physical feasibility of dynamic parameters, a semidefinite programming method is used to identify dynamic parameters with actual physical meaning, thereby obtaining an accurate dynamic model. Then, based on the result of the residual vibration time domain analysis, a joint trajectory optimization model with the goal of minimizing joint tracking error is established. The Chebyshev collocation method is used to discretize the optimization model. The dynamic model is used as the optimization constraint, and barycentric interpolation is used to obtain the optimized joint motion trajectory. Finally, industrial robot experiments prove that the vibration suppression method proposed in this article can reduce the maximum acceleration amplitude of residual vibration by 62% and the vibration duration by 71%. Compared with the input shaping method, the method proposed in this paper can reduce the terminal residual vibration more effectively and ensure the consistency of running time and trajectory. [ABSTRACT FROM AUTHOR]

This paper presents a comprehensive framework for optimising vehicle performance, integrating advanced simulation techniques with optimisation methodologies. The aim is to find the best racing line, as well as the optimal combination of parameters and control inputs to make a car as fast as possible around a given track, with a focus on energy deployment and recovery, active torque distribution and active aerodynamics. The problem known as the Minimum Lap Time Problem is solved using optimal control methods and direct collocation. The solution covers the modelling of the track, vehicle dynamics, active aerodynamics, and a comprehensive representation of the powertrain including motor, engine, transmission, and drivetrain components. This integrated simulator allows for the exploration of different vehicle configurations and track layouts, providing insights into optimising vehicle design and vehicle control simultaneously for improved performance and energy efficiency. Test results demonstrate the effect of active torque distribution on performance under various conditions, enhanced energy efficiency and performance through regenerative braking, and the added value of including parameter optimisation within the optimisation framework. Notably, the simulations revealed interesting behaviours similar to lift-and-coast strategies, depending on the importance of energy saving, thereby highlighting the effectiveness of the proposed control strategies. Also, results demonstrate the positive effect of active torque distribution on performance under various conditions, attributed to the higher utilization of available adherence. Furthermore, unlike a simpler single-track model, the optimal solution required fine control of the active aerodynamic systems, reflecting the complex interactions between different subsystems that the simulation can capture. Finally, the inclusion of parameter optimisation while considering all active systems, further improves performance and provides valuable insights into the impact of design choices. [ABSTRACT FROM AUTHOR]

The benchmarking of CO2 emissions serves as the foundation for the accurate assessment of the environmental impact of air traffic. To calculate the environmental benchmarks of arrival traffic flows with Point Merge System (PMS) patterns, this study proposes a 4D trajectory optimization method that combines data-driven and optimal control models. First, the predominant arrival routes of traffic flows are identified using the trajectory spectral clustering method, which provides the horizontal reference for 4D trajectory optimization. Second, an optimal control model for vertical profiles with point merging topology is established, with the objective of minimizing the fuel–time cost. Finally, considering the complex structure of the PMS, a flexible and adaptable genetic algorithm-based vertical profile nonlinear optimization model is created. The experimental results demonstrate that the proposed method is adaptable to variations in aircraft type and cost index parameters, enabling the generation of different 4D trajectories. The results also indicate an environmental efficiency gap of approximately 10% between the actual CO2 emissions of the arrival traffic flow example and the obtained benchmark. With this benchmark trajectory generation methodology, the environmental performance of PMSs and associated arrival aircraft scheduling designs can be assessed on the basis of reliable data. [ABSTRACT FROM AUTHOR]

Data mining has achieved great success in air traffic management as a technology for learning knowledge from historical data that benefits people. However, data mining can rarely be embedded into the trajectory optimization process since regular optimization algorithms cannot utilize the functional and implicit knowledge extracted from historical data in a general paradigm. To tackle this issue, this research proposes a novel data mining-based trajectory generation method that is compatible with existing optimization algorithms. Firstly, the proposed method generates trajectories by combining various maneuvers learned from operation data instead of reconstructing trajectories with generative models. In such a manner, data mining-based trajectory optimization can be achieved by solving a combinatorial optimization problem. Secondly, the proposed method introduces a majorization–minimization-based adversarial training paradigm to train the generation model with more general loss functions, including non-differentiable flight performance constraints. A case study on Guangzhou Baiyun International Airport was conducted to validate the proposed method. The results illustrate that the trajectory generation model can generate trajectories with high fidelity, diversity, and flyability. [ABSTRACT FROM AUTHOR]

Trajectory optimization is an essential tool for the high-fidelity planning of missions in aerospace engineering in order to increase their safety. Robust optimal control methods are utilized in the present study to address environmental or system uncertainties. To improve robustness, holistic approaches for robust trajectory optimization using sensitivity minimization with system feedback and predicted feedback are presented. Thereby, controller gains to handle uncertainty influences are optimized. The proposed method is demonstrated in an application for UAV trajectories. The resulting trajectories are less prone to unknown factors, which increases mission safety. [ABSTRACT FROM AUTHOR]

This document provides a summary of a book that explores the challenges and advancements in the guidance, navigation, and control (GNC) of autonomous and transport vehicles. It emphasizes the need for vehicles to operate autonomously and efficiently in congested city environments and discusses the development of collaborative GNC for capabilities like platooning. The document also mentions the impact of policies on GNC, such as the authorization of eVTOL and drone operations by the FAA in the United States. It highlights the growing research areas in vehicle navigation and control, including sensor fusion, trajectory optimization, and control challenges. The document concludes by encouraging readers to explore the publications in the Special Issue to gain a deeper understanding of the emerging research priorities in GNC for a diverse range of vehicles. [Extracted from the article]

With the growth of global trade, port shipping is becoming more and more important. In this paper, an analysis of a ship's inbound and outbound track characteristics is conducted using the OD–Hausdorff distance. The accuracy and efficiency of trajectory data analysis have been enhanced through clustering analysis. Trajectories are arranged in a time sequence, and representative port segments are selected. An improved OD–Hausdorff distance method is employed to capture the dynamic characteristics of a ship's movements, such as speed and heading. Additionally, the DBSCAN algorithm is utilized for clustering, allowing for the processing of multidimensional AIS data. Data cleaning and preprocessing have ensured the reliability of the AIS data, and the Douglas–Peucker algorithm is used for trajectory simplification. Significant improvements in the accuracy and efficiency of trajectory clustering have been observed. Therefore, the main channel of the Guan River and the right side of Yanwei Port are usually followed by ships greater than 60 m in length, with a lateral Relative Mean Deviation (RMD) of 7.06%. Vessels shorter than 60 m have been shown to have greater path variability, with a lateral RMD of 7.94%. Additionally, a crossing pattern at Xiangshui Port is exhibited by ships shorter than 60 m due to the extension of berths and their positions at turns. Enhanced clustering accuracy has provided more precise trajectory patterns, which aids in better channel management. [ABSTRACT FROM AUTHOR]

Ship path planning is the core problem of autonomous driving of smart ships and the basis for avoiding obstacles and other ships reasonably. To achieve this goal, this study improved the traditional A* algorithm to propose a new method for ship collision avoidance path planning by combining the multi-target point artificial potential field algorithm (MPAPF). The global planning path was smoothed and segmented into multi-target sequence points with the help of an improved A* algorithm and fewer turning nodes. The improved APF algorithm was used to plan the path of multi-target points locally, and the ship motion constraints were considered to generate a path that was more in line with the ship kinematics. In addition, this method also considered the collision avoidance situation when ships meet, carried out collision avoidance operations according to the International Regulations for Preventing Collisions at Sea (COLREGs), and introduced the collision risk index (CRI) to evaluate the collision risk and obtain a safe and reliable path. Through the simulation of a static environment and ship encounter, the experimental results show that the proposed method not only has good performance in a static environment but can also generate a safe path to avoid collision in more complex encounter scenarios. [ABSTRACT FROM AUTHOR]

This study proposes a receding horizon optimization-based docking control method to address the autonomy and safety challenge of underwater docking between manned submersibles and unmanned vehicles, facilitating the integration of docking trajectory generation and tracking control. A novel approach for optimizing and generating reference trajectory is proposed to construct a docking corridor that satisfies safe collision-free and visual guidance effective regions. It generates dynamically feasible and continuously smooth docking trajectories by rolling optimization. Subsequently, a docking trajectory tracking control method based on nonlinear model predictive control (NMPC) is designed, which is specifically tailored to address thruster saturation and system state constraints while ensuring the feasibility and stability of the control system. The control performance and robustness of underwater docking were validated through simulation experiments. The optimized trajectory generated is continuous, smooth, and complies with the docking constraints. The control system demonstrates superior tracking accuracy than backstepping control, even under conditions where the model has a 40% error and bounded disturbances from currents are present. The research findings presented in this study contribute significantly to enhancing safety and efficiency in deep-sea development. [ABSTRACT FROM AUTHOR]

In the rapidly evolving field of unmanned aerial vehicle (UAV) applications, the complexity of task planning and trajectory optimization, particularly in high-dimensional operational environments, is increasingly challenging. This study addresses these challenges by developing the Adaptive Distortion Suppression Correlation Filter Cooperative Optimization (ARCF-ICO) algorithm, designed for high-dimensional UAV task allocation and trajectory planning. The ARCF-ICO algorithm combines advanced correlation filter technologies with multi-objective optimization techniques, enhancing the precision of trajectory planning and efficiency of task allocation. By incorporating weather conditions and other environmental factors, the algorithm ensures robust performance at low altitudes. The ARCF-ICO algorithm improves UAV tracking stability and accuracy by suppressing distortions, facilitating optimal path selection and task execution. Experimental validation using the UAV123@10fps and OTB-100 datasets demonstrates that the ARCF-ICO algorithm outperforms existing methods in Area Under the Curve (AUC) and Precision metrics. Additionally, the algorithm's consideration of battery consumption and endurance further validates its applicability to current UAV technologies. This research advances UAV mission planning and sets new standards for UAV deployment in both civilian and military applications, where adaptability and accuracy are critical. [ABSTRACT FROM AUTHOR]

Providing safe, smooth, and efficient trajectories for autonomous vehicles has long been a question of great interest in the field of autopiloting. In dynamic and ever-changing urban environments, safe and efficient trajectory planning is fundamental to achieving autonomous driving. Nevertheless, the complexity of environments with multiple constraints poses challenges for trajectory planning. It is possible that behavior planners may not successfully obtain collision-free trajectories in complex urban environments. Herein, this paper introduces spatio–temporal joint optimization-based trajectory planning (SJOTP) with multi-constraints for complex urban environments. The behavior planner generates initial trajectory clusters based on the current state of the vehicle, and a topology-guided hybrid A* algorithm applied to an inflated map is utilized to address the risk of collisions between the initial trajectories and static obstacles. Taking into consideration obstacles, road surface adhesion coefficients, and vehicle dynamics constraints, multi-constraint multi-objective coordinated trajectory planning is conducted, using both differential-flatness vehicle models and point-mass vehicle models. Taking into consideration longitudinal and lateral coupling in trajectory optimization, a spatio–temporal joint optimization solver is used to obtain the optimal trajectory. The simulation verification was conducted on a multi-agent simulation platform. The results demonstrate that this methodology can obtain optimal trajectories safely and efficiently in complex urban environments. [ABSTRACT FROM AUTHOR]

The focus of this study was the investigation of how the total pressure of reactants and ammonia flow rate influence the growth morphology of aluminum–gallium nitride layers crystallized by Halide Vapor Phase Epitaxy. It was established how these two critical parameters change the supersaturation levels of gallium and aluminum in the growth zone, and subsequently the morphology of the produced layers. A halide vapor phase epitaxy reactor built in-house was used, allowing for precise control over the growth conditions. Results demonstrate that both total pressure and ammonia flow rate significantly affect the nucleation and crystal growth processes which have an impact on the alloy composition, surface morphology and structural quality of aluminum–gallium nitride layers. Reducing the total pressure and adjusting the ammonia flow rate led to a notable enhancement in the homogeneity and crystallographic quality of the grown layers, along with increased aluminum incorporation. This research contributes to a deeper understanding of the growth mechanisms involved in the halide vapor phase epitaxy of aluminum–gallium nitride, and furthermore it suggests a trajectory for the optimization of growth parameters so as to obtain high-quality materials for advanced optoelectronic and electronic applications. [ABSTRACT FROM AUTHOR]

As a kind of space robot, the two-arm cascade combination system (TACCS) has been applied to perform auxiliary operations at different locations outside space cabins. The motion coupling relation of two arms and complex surrounding obstacles make the collision-free trajectory planning optimization of TACCS more difficult, which has become an urgent problem to be solved. For the above problem, this paper proposed collision-free and time–energy–minimum trajectory planning optimization algorithms, considering the motion coupling of two arms. In this method, the screw-based inverse kinematics (IK) model of TACCS is established to provide the basis for the motion planning in joint space by decoupling the whole IK problem into two IK sub-problems of two arms; the minimum distance calculation model is established based on the hybrid geometric enveloping way and basic distance functions, which can provide the efficient and accurate data basis for the obstacle-avoidance constraint condition of the trajectory optimization. Moreover, the single and bi-layer optimization algorithms are presented by taking motion time and energy consumption as objectives and considering obstacle-avoidance and kinematics constraints. Finally, through example cases, the results indicate that the bi-layer optimization has higher convergence efficiency under the premise of ensuring the optimization effect by separating variables and constraint terms. This work can provide theoretical and methodological support for the efficient and intelligent applications of TACCS in the space arena. [ABSTRACT FROM AUTHOR]

The high mobility of unmanned aerial vehicles (UAVs) enables them to improve system throughput by establishing line-of-sight (LoS) links. Nevertheless, in urban environments, these LoS links can be disrupted by complex urban structures, leading to potential interference issues. Reconfigurable intelligent surfaces (RIS) provide an innovative approach to enhance communication performance by intelligently reflecting incident signals. Recent studies suggest that utilizing multi-antenna transmission can increase system efficiency, while single-antenna transmission may be more prone to interference. To address these challenges, this article introduces a RIS-assisted multiple-input single-output (MISO) UAV communication system. Our objective is to optimize the minimum user rate, thereby guaranteeing equitable communication for all users. Nevertheless, the non-convexity inherent in this optimization problem complicates the pursuit of a direct solution. Hence, we decompose the problem into four subproblems: user scheduling optimization, RIS phase-shift optimization, UAV trajectory optimization, and UAV transmit beamforming optimization. To obtain suboptimal solutions, we have developed an alternating iterative optimization algorithm for addressing the four subproblems. Numerical results demonstrate that our algorithm effectively boosts the minimum user rate of the entire system. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a cell-free massive multiple-input multiple-output (CF-mMIMO) system with a reconfigurable intelligent surface (RIS) carried by an unmanned aerial vehicle (UAV), called the UAV-RIS. Compared with the RIS located on the ground, the UAV-RIS has a wider coverage that can reflect all signals from access points (APs) and user equipment (UE). By correlating the UAV location with the Rician K-factor, we derive a closed-form approximation of the UE achievable downlink rate. Based on this, we obtain the optimal UAV location and RIS phase shift that can maximize the UE sum rate through an alternating optimization method. Simulation results have verified the accuracy of the derived approximation and shown that the UE sum rate can be significantly improved with the obtained optimal UAV location and RIS phase shift. Moreover, we find that with a uniform UE distribution, the UAV-RIS should fly to the center of the system, while with an uneven UE distribution, the UAV-RIS should fly above the area where UEs are gathered. In addition, we also design the best trajectory for the UAV-RIS to fly from its initial location to the optimal destination while maintaining the maximum UE sum rate per time slot during the flight. [ABSTRACT FROM AUTHOR]

The recently introduced coati optimization algorithm suffers from drawbacks such as slow search velocity and weak optimization precision. An enhanced coati optimization algorithm called CMRLCCOA is proposed. Firstly, the Sine chaotic mapping function is used to initialize the CMRLCCOA as a way to obtain better-quality coati populations and increase the diversity of the population. Secondly, the generated candidate solutions are updated again using the convex lens imaging reverse learning strategy to expand the search range. Thirdly, the Lévy flight strategy increases the search step size, expands the search range, and avoids the phenomenon of convergence too early. Finally, utilizing the crossover strategy can effectively reduce the search blind spots, making the search particles constantly close to the global optimum solution. The four strategies work together to enhance the efficiency of COA and to boost the precision and steadiness. The performance of CMRLCCOA is evaluated on CEC2017 and CEC2019. The superiority of CMRLCCOA is comprehensively demonstrated by comparing the output of CMRLCCOA with the previously submitted algorithms. Besides the results of iterative convergence curves, boxplots and a nonparametric statistical analysis illustrate that the CMRLCCOA is competitive, significantly improves the convergence accuracy, and well avoids local optimal solutions. Finally, the performance and usefulness of CMRLCCOA are proven through three engineering application problems. A mathematical model of the hypersonic vehicle cruise trajectory optimization problem is developed. The result of CMRLCCOA is less than other comparative algorithms and the shortest path length for this problem is obtained. [ABSTRACT FROM AUTHOR]

This paper proposes an enhanced multi-strategy sparrow search algorithm to optimize the trajectory of a six-axis industrial robot, addressing issues of low efficiency and high vibration impact on joints during operation. Initially, the improved D-H parametric method is employed to establish both forward and inverse kinematic models of the robot. Subsequently, a 3-5-3 mixed polynomial interpolation trajectory planning approach is applied to the robot. Building upon the conventional sparrow algorithm, a two-dimensional Logistic chaotic system initializes the population. Additionally, a Levy flight strategy and nonlinear adaptive weighting are introduced to refine the discoverer position update operator, while an inverse learning strategy enhances the vigilante position update operator. These modifications boost both the local and global search capabilities of the algorithm. The improved sparrow algorithm, based on 3-5-3 hybrid polynomial trajectory planning, is then used for the time-optimal trajectory planning of the robot. This is compared with traditional sparrow search algorithm and particle swarm algorithm optimization results. The findings indicate that the proposed enhanced sparrow search algorithm outperforms both the standard sparrow algorithm and the particle swarm algorithm in terms of convergence speed and accuracy for robot trajectory optimization. This can lead to the increased work efficiency and performance of the robot. [ABSTRACT FROM AUTHOR]

This article presents a trajectory design problem concerning the exploration of potentially hazardous near-Earth asteroids (PHAs) with reusable probes from cislunar space. A total of 20 probes, making round trips departing from and returning to a service space station in a lunar distant retrograde orbit, are expected to explore as many PHAs as possible by means of close flyby within a 10-year time window. The trajectory design problem was released in the 12th edition of China's Trajectory Optimization Competition on 20 August 2022, and a total of 10 sets of trajectory solutions were submitted. As the authors who proposed the competition problem, we present in this article the problem descriptions, trajectory analysis, and design, as well as an impressive trajectory solution in which a total of 105 PHAs are explored. It is concluded that taking advantage of reusable probes from cislunar space is a promising option to efficiently explore large numbers of PHAs. [ABSTRACT FROM AUTHOR]

In dynamic environments, real-time trajectory planners are required to generate smooth trajectories. However, trajectory planners based on real-time sampling often produce jerky trajectories that necessitate post-processing steps for smoothing. Existing local smoothing methods may result in trajectories that collide with obstacles due to the lack of a direct connection between the smoothing process and trajectory optimization. To address this limitation, this paper proposes a novel trajectory-smoothing method that considers obstacle constraints in real time. By introducing virtual attractive forces from original trajectory points and virtual repulsive forces from obstacles, the resultant force guides the generation of smooth trajectories. This approach enables parallel execution with the trajectory-planning process and requires low computational overhead. Experimental validation in different scenarios demonstrates that the proposed method not only achieves real-time trajectory smoothing but also effectively avoids obstacles. [ABSTRACT FROM AUTHOR]

Efficient navigation is crucial for intelligent mobile robots in complex environments. This paper introduces an innovative approach that seamlessly integrates advanced machine learning techniques to enhance mobile robot communication and path planning efficiency. Our method combines supervised and unsupervised learning, utilizing spline interpolation to generate smooth paths with minimal directional changes. Experimental validation with a differential drive mobile robot demonstrates exceptional trajectory control efficiency. We also explore Motion Planning Networks (MPNets), a neural planner that processes raw point-cloud data from depth sensors. Our tests demonstrate MPNet's ability to create optimal paths using the Probabilistic Roadmap (PRM) method. We highlight the importance of correctly setting parameters for reliable path planning with MPNet and evaluate the algorithm on various path types. Our experiments confirm that the trajectory control algorithm works effectively, consistently providing precise and efficient trajectory control for the robot. [ABSTRACT FROM AUTHOR]

Goal-conditioned Reinforcement Learning (RL) holds promise for addressing intricate control challenges by enabling agents to learn and execute desired skills through separate decision modules. However, the irregular occurrence of required skills poses a significant challenge to effective learning. In this paper, we demonstrate the detrimental effects of this imbalanced skill (sub-goal) distribution and propose a novel training approach, Classified Experience Replay (CER), designed to mitigate this challenge. We demonstrate that adapting our method to conventional RL methods significantly enhances the performance of the RL agent. Considering the challenges inherent in tasks such as driving, characterized by biased occurrences of required sub-goals, our study demonstrates the improvement in trained outcomes facilitated by the proposed method. In addition, we introduce a specialized framework tailored for self-driving tasks on highways, integrating model predictive control into our RL trajectory optimization training paradigm. Our approach, utilizing CER with the suggested framework, yields remarkable advancements in trajectory optimization for RL agents operating in highway environments. [ABSTRACT FROM AUTHOR]

With the increasing utilization of sampling-based path planning methods in the field of mobile robots, the RRT* algorithm faces challenges in complex indoor scenes, including high sampling randomness and slow convergence speed. To tackle these issues, this paper presents an improved RRT* path-planning algorithm based on the generalized Voronoi diagram with an adaptive bias strategy. Firstly, the algorithm leverages the properties of the generalized Voronoi diagram (GVD) to obtain heuristic paths, and a sampling region with target bias is constructed, increasing the purposefulness of the sampling process. Secondly, the node expansion process incorporates an adaptive bias strategy, dynamically adjusting the step size and expanding direction. This strategy allows the algorithm to adapt to the local environment leading to improved convergence speed. To ensure the generation of smooth paths, the paper employs the cubic spline curve interpolation algorithm for trajectory optimization to ensure that the mobile robotic can obtain the best trajectory. Finally, the proposed algorithm is experimentally compared with existing algorithms, including the RRT* and Informed-RRT* algorithms, to verify the feasibility and stability. [ABSTRACT FROM AUTHOR]

This article presents a hierarchical control framework for autonomous vehicle trajectory planning and tracking, addressing the challenge of accurately following high-speed, at-limit maneuvers. The proposed time-optimal trajectory planning and tracking (TOTPT) framework utilizes a hierarchical control structure, with an offline trajectory optimization (TRO) module and an online nonlinear model predictive control (NMPC) module. The TRO layer generates minimum-lap-time trajectories using a direct collocation method, which optimizes the vehicle's path, velocity, and control inputs to achieve the fastest possible lap time, while respecting the vehicle dynamics and track constraints. The NMPC layer is responsible for precisely tracking the reference trajectories generated by the TRO in real time. The NMPC also incorporates a preview algorithm that utilizes the predicted future travel distance to estimate the optimal reference speed and curvature for the next time step, thereby improving the overall tracking performance. Simulation results on the Catalunya circuit demonstrated the framework's capability to accurately follow the time-optimal raceline at an average speed of 116 km/h, with a maximum lateral error of 0.32 m. The NMPC module uses an acados solver with a real-time iteration (RTI) scheme, to achieve a millisecond-level computation time, making it possible to implement it in real time in autonomous vehicles. [ABSTRACT FROM AUTHOR]

Space exploration presents vast prospects for scientific, industrial, and economic progress. This paper introduces the MeSat mission as a pioneering approach to Mars exploration. The MeSat aims to deepen our understanding of Martian conditions and resources by employing an optimized Earth-to-Mars trajectory, enabling a comprehensive study of the Martian atmosphere and surface. The mission comprises a cargo microsatellite hosting three 6U CubeSats and two 3U CubeSats, deployed into four separate Mars orbits to form a constellation. Each CubeSat carries distinct payloads: a THz radiometer for Martian water vapor atmospheric observation, a high-resolution surface camera, a high-tech spectrometer, and a Fourier transform spectrometer (FTS) for wind speed readings. This paper includes the majority of the key parameters; however, we focus our discussion more on two aspects of this pioneering mission: the first aspect contains the proposal of four distinct payloads for the study of Mars' atmosphere and the second aspect proposes an optimal mission design algorithm that analyzes a fuel-efficient low-thrust trajectory from Earth to Mars. Regarding the payloads, the THz radiometer requires a specific design; hence, we explain this payload in more depth; the rest of the payloads, we suggest utilizing commercially available elements for the cost-effective manufacture of a whole system. For mission trajectory optimization, the study employs a dual-step hybrid optimization algorithm (PSO-homotopy) to analyze fuel-efficient low-thrust trajectories from Earth to Mars, incorporating the ephemeris dynamics model to account for gravitational perturbations in the entire Solar System. In practical mission design, crucial factors like hyperbolic excess velocity, diverse opportunities for Earth launch and Mars rendezvous, varied propulsion systems, and time of flight (TOF) play vital roles in trajectory optimization. In summary, for the MeSat mission, we propose a comprehensive Mars environmental mission design. We consider all aspects of the mission from trajectory design to engineering detail design, since we would like to inspire future Mars missions with a complete report. [ABSTRACT FROM AUTHOR]

The presence of abundant spatio-temporal information based on the location of mobile objects in publicly accessible GPS mobile devices makes it crucial to collect, analyze, and mine such information. Therefore, it is necessary to index a large volume of trajectory data to facilitate efficient trajectory retrieval and access. It is difficult for existing indexing methods that primarily rely on data-driven indexing structures (such as R-Tree) or space-driven indexing structures (such as Quadtree) to support efficient analysis and computation of data based on spatio-temporal range queries as a service basis, especially when applied to massive trajectory data. In this study, we propose a massive GPS data storage and indexing method based on uneven spatial segmentation and trajectory optimization segmentation. Primarily, the method divides GPS trajectories in a large spatio-temporal data space into multiple MBR sequences by greedy algorithm. Then, a hybrid indexing model for segmented trajectories is constructed to form a global spatio-temporal segmentation scheme, called HHBITS index, to achieve hierarchical organization of trajectory data. Eventually, a spatio-temporal range query processing method is proposed based on this index. This paper implements and evaluates the index in MongoDB and compares it with two other spatio-temporal composite indexes for performing spatio-temporal range queries efficiently. The experimental results show that the method in this paper has high performance in responding to spatio-temporal queries on large-scale trajectory data. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) are required to pass through multiple important waypoints as quickly as possible in courier delivery, enemy reconnaissance and other tasks to eventually reach the target position. There are two important problems to be solved in such tasks: constraining the trajectory to pass through intermediate waypoints and optimizing the flight time between these waypoints. A constrained parameterized differential dynamic programming (C-PDDP) algorithm is proposed for meeting multiple waypoint constraints and free-time constraints between waypoints to deal with these two issues. By considering the intermediate waypoint constraints as a kind of path state constraint, the penalty function method is adopted to constrain the trajectory to pass through the waypoints. For the free-time constraints, the flight times between waypoints are converted into time-invariant parameters and updated at the trajectory instants corresponding to the waypoints. The effectiveness of the proposed C-PDDP algorithm under waypoint constraints and free-time constraints is verified through numerical simulations of the UAV multi-point reconnaissance problem with five different waypoints. After comparing the proposed algorithm with fixed-time constrained DDP (C-DDP), it is found that C-PDDP can optimize the flight time of the trajectory with three segments to 7.35 s, 9.50 s and 6.71 s, respectively. In addition, the maximum error of the optimized trajectory waypoints of the C-PDDP algorithm is 1.06 m, which is much smaller than that (7 m) of the C-DDP algorithm used for comparison. A total of 500 Monte Carlo tests were simulated to demonstrate how the proposed algorithm remains robust to random initial guesses. [ABSTRACT FROM AUTHOR]

Being able to express broad families of equivariant or invariant attributed graph functions is a popular measuring stick of whether graph neural networks should be employed in practical applications. However, it is equally important to find deep local minima of losses (i.e., produce outputs with much smaller loss values compared to other minima), even when architectures cannot express global minima. In this work we introduce the architectural property of attracting optimization trajectories to local minima as a means of achieving smaller loss values. We take first steps in satisfying this property for losses defined over attributed undirected unweighted graphs with an architecture called universal local attractor (ULA). This refines each dimension of end-to-end-trained node feature embeddings based on graph structure to track the optimization trajectories of losses satisfying some mild conditions. The refined dimensions are then linearly pooled to create predictions. We experiment on 11 tasks, from node classification to clique detection, on which ULA is comparable with or outperforms popular alternatives of similar or greater theoretical expressive power. [ABSTRACT FROM AUTHOR]

Path planning (PP) is fundamental in the decision-making and control processes of computer numerical control (CNC) machines, playing a critical role in smart manufacturing research. Apart from improving optimization in PP, enhancing efficiency while decreasing CNC machine cycle time is important in manufacturing. Many methods have been offered in the literature to improve the cycle time for obtaining optimal trajectories in toolpath optimization, but these methods are mostly considered for improvements in path length or machining time in optimal PP. This study demonstrates a method for creating a smoothing path. It aims to minimize both cycle time and toolpath length, while demonstrating that the non-dominated sorting genetic algorithm (NSGA-II) is efficient in addressing the multi-objective PP problems within static situations. Pareto optimality for performance comparisons with multi-objective genetic algorithms (MOGAs) is presented in order to highlight the positive features of the non-dominant solving generated by the NSGA-II. According to the comprehensive analysis results, the optimization of the path carried out with the NSGA-II emphasizes its shorter and smoother attributes, with the optimal trajectory achieving approximately 30% and 7% reductions in path length and machining cycle time, respectively. [ABSTRACT FROM AUTHOR]

Effective emission control technologies and eco-friendly propulsion systems have been developed to decrease exhaust particle emissions. However, more work must be conducted on non-exhaust traffic-related sources such as tyre wear. The advent of automated vehicles (AVs) enables researchers and automotive manufacturers to consider ways to further decrease tyre wear, as vehicles will be controlled by the system rather than by the driver. In this direction, this work presents the formulation of an optimal control problem for the trajectory optimisation of automated articulated vehicles for tyre wear minimisation. The optimum velocity profile is sought for a predefined road path from a specific starting point to a final one to minimise tyre wear in fixed time cases. Specific boundaries and constraints are applied to the problem to ensure the vehicle's stability and the feasibility of the solution. According to the results, a small increase in the journey time leads to a significant decrease in the mass loss due to tyre wear. The employment of articulated vehicles with low powertrain capabilities leads to greater tyre wear, while excessive increases in powertrain capabilities are not required. The conclusions pave the way for AV researchers and manufacturers to consider tyre wear in their control modules and come closer to the zero-emission goal. [ABSTRACT FROM AUTHOR]

With the rapid development of the intelligent driving technology, achieving accurate path planning for unmanned vehicles has become increasingly crucial. However, path planning algorithms face challenges when dealing with complex and ever-changing road conditions. In this paper, aiming at improving the accuracy and robustness of the generated path, a global programming algorithm based on optimization is proposed, while maintaining the efficiency of the traditional A* algorithm. Firstly, turning penalty function and obstacle raster coefficient are integrated into the search cost function to increase the adaptability and directionality of the search path to the map. Secondly, an efficient search strategy is proposed to solve the problem that trajectories will pass through sparse obstacles while reducing spatial complexity. Thirdly, a redundant node elimination strategy based on discrete smoothing optimization effectively reduces the total length of control points and paths, and greatly reduces the difficulty of subsequent trajectory optimization. Finally, the simulation results, based on real map rasterization, highlight the advanced performance of the path planning and the comparison among the baselines and the proposed strategy showcases that the optimized A* algorithm significantly enhances the security and rationality of the planned path. Notably, it reduces the number of traversed nodes by 84%, the total turning angle by 39%, and shortens the overall path length to a certain extent. [ABSTRACT FROM AUTHOR]

Motorcycle motion is largely influenced by the road geometry, which alters the allowable accelerations in longitudinal and lateral directions and influences the vertical wheel loads. Recently, a method for three-dimensional road reconstruction and its incorporation into transient and quasi-steady-state (QSS) minimum lap time simulations (MLTSs) has been proposed. The main purpose of this work is to demonstrate how significantly different results from a minimum lap time optimal control problem can be obtained when using inappropriate elevation data sources in the track reconstruction problem, and how the road model reconstructed using poor input data can lead to misleading conclusions when analyzing real vehicle and driver performances. Two road models derived from high- and low-resolution digital elevation models (DEMs) are compared and their impact on the optimal maneuver of a racing motorcycle is examined. The essentials of track identification are presented, as well as vehicle positioning on the 3D road and the generalized QSS motorcycle model. Obtained 3D and 2D road models are analyzed in detail, on a case example of the Road Atlanta racetrack, and used in minimum lap time simulations, which are validated by the experimental data recorded on the Supersport motorcycle. The comparative analysis showed that great care should be taken when selecting the elevation dataset in the track reconstruction process, and that the 1 m resolution local DEMs seem to be sufficient to obtain MLTS results close to the measured ones. The example of using the 3D free-trajectory QSS minimum lap time problem to localize the track segments where real driver actions can be improved is also presented. The differences between simulation results on different road models of the same racetrack can be large and influence the interpretation of optimal maneuver. [ABSTRACT FROM AUTHOR]

The goal of this study is to address the challenges associated with identifying and planning a mobile land robot's path to optimize its speed in a stationary environment. Our focus was on devising routes that navigate around obstacles in various spatial arrangements. To achieve this, we employed MATLAB R2023b for trajectory simulation and optimization. On-board data processing was conducted, while obstacle detection relied on the omnidirectional video processing system integrated into the robot. Odometry was facilitated by engine encoders and optical flow sensors. Additionally, an external video system was utilized to verify the experimental data pertaining to the robot's movement. Last but not least, the algorithms and hardware equipment used enabled the robot to go along the path at greater speeds. Limiting the amount of time and energy required to travel allowed us to avoid obstacles. [ABSTRACT FROM AUTHOR]

This article develops two metaheuristics optimization techniques, Grey Wolf Optimizer (GWO) and Harris Hawks Optimization (HHO), to handle multi-objective optimal power flow (MOOPF) issues. Multi Objective GWO (MOGWO) and Multi Objective HHO (MOHHO) are the names of the developed techniques. By combining these optimization techniques with Pareto techniques, the non-dominated solution set can be obtained. These developed approaches are characterized by simplicity and have few control parameters. Fuel cost, emissions, real power losses, and voltage deviation were the four objective functions considered. The theories used to determine the best compromise solution and organize the Pareto front options are the fuzzy membership equation and the crowding distance approach, respectively. To validate and evaluate the performance of the presented techniques, two standard IEEE bus systems—30-bus and 57-bus power systems—were proposed. Bi, Tri, and Quad objective functions with 21 case studies are the types of objective functions and the scenarios that were applied in this paper. As compared to the results of the most recent optimization techniques documented in the literature, the comparative analysis results for the proposed methodologies demonstrated the superiority and robustness of MOGWO and MOHHO. [ABSTRACT FROM AUTHOR]

High vertical jumping motion, which enables a humanoid robot to leap over obstacles, is a direct reflection of its extreme motion capabilities. This article proposes a single sequential kino-dynamic trajectory optimization method to solve the whole-body motion trajectory for high vertical jumping motion. The trajectory optimization process is decomposed into two sequential optimization parts: optimization computation of centroidal dynamics and coherent whole-body kinematics. Both optimization problems converge on the common variables (the center of mass, momentum, and foot position) using cost functions while allowing for some tolerance in the consistency of the foot position. Additionally, complementarity conditions and a pre-defined contact sequence are implemented to constrain the contact force and foot position during the launching and flight phases. The whole-body trajectory, including the launching and flight phases, can be efficiently solved by a single sequential optimization, which is an efficient solution for the vertical jumping motion. Finally, the whole-body trajectory generated by the proposed optimized method is demonstrated on a real humanoid robot platform, and a vertical jumping motion of 0.5 m in height (foot lifting distance) is achieved. [ABSTRACT FROM AUTHOR]

Ensuring pedestrian safety is one of the most significant challenges for autonomous driving systems in urban scenarios due to the non-cooperative and unpredictable nature of pedestrian movements. To tackle this problem, firstly, we propose a collision avoidance strategy based on entropy-increasing risk perception in a vehicle–pedestrian reaction space. Our approach combines a limited range of reaction space regions with entropy to quantify the risk of pedestrian–vehicle collision. Then, multi-vehicle candidate trajectories are generated using the path and speed sequence method, and the uncertain states of pedestrians are predicted based on the social force model and Markov model accordingly. Finally, to determine the optimal collision avoidance trajectory, we use quantitative reaction-space entropy as a new "cost function" to measure potential risk and perform multi-objective trajectory optimization based on the elitist non-dominated-sorting genetic algorithm region-focused (NSGA-RF) approach. Simulation results show that our proposed strategy can enhance the safety of the planned trajectory interaction between vehicles and pedestrians for autonomous driving under normal and emergency conditions. [ABSTRACT FROM AUTHOR]

This paper presents the path planning and motion control of a self-reconfigurable mobile robot system, focusing on module-to-module autonomous docking and alignment tasks. STORM, which stands for Self-configurable and Transformable Omni-Directional Robotic Modules, features a unique mode-switching ability and novel docking mechanism design. This enables the modules that make up STORM to dock with each other and form a variety configurations in or to perform a large array of tasks. The path planning and motion control presented here consists of two parallel schemes. A Lyapunov function-based precision controller is proposed to align the target docking mechanisms in a small range of the target position. Then, an optimization-based path planning algorithm is proposed to help find the fastest path and determine when to switch its locomotion mode in a much larger range. Both numerical simulations and real-world experiments were carried out to validate these proposed controllers. [ABSTRACT FROM AUTHOR]

This study introduces a decision support framework that integrates aircraft trajectory optimization and arrival scheduling to facilitate efficient management of descent operations for arriving aircraft within terminal maneuvering areas. The framework comprises three modules designed to tackle specific challenges in the descent process. The first module formulates and solves a trajectory optimization problem, generating a range of candidate descent trajectories for each arriving aircraft. The options for descent operations include step-down descent operation, Continuous Descent Operation (CDO), and CDO with a lateral path stretching strategy. The second module addresses the assignment of conflict-free trajectories to aircraft, determining precise arrival times at each waypoint. This is achieved by solving an aircraft arrival scheduling problem. To overcome computational complexities, a novel variable neighborhood search algorithm is proposed as the solution approach. This algorithm utilizes three neighborhood structures within an extended relaxing and solving framework, and incorporates a tabu search algorithm to enhance the efficiency of the search process in the solution space. The third module focuses on comparing the total cost incurred from flight delays and fuel consumption across the three descent operations, enabling the selection of the most suitable operation for the descent process. The decision support framework is evaluated using real air traffic data from Guangzhou Baiyun International Airport. Experimental results demonstrate that the framework effectively supports air traffic controllers by scheduling more cost-efficient descent operations for arrival aircraft. [ABSTRACT FROM AUTHOR]

Increased performance with reduced overall cost, and precise design and optimization of launch systems are critical to affordability. In this respect, the use of hybrid motors has increased to ease handling based on motor selection. In the current study, the launch vehicle's performance is enhanced by incorporating a hybrid rocket motor into the last stage and optimized using particle swarm optimization to develop a six-degrees-of-freedom tool. This modification aims to increase payload placement flexibility, facilitate handling, and reduce costs. Thanks to the interactive subsystems within this research, this innovative study more comprehensively considers the launch vehicle trajectory design problem, allowing the simultaneous consideration of the effect of launch vehicle geometry along with other parameters in the system. In this context, the proposed method is applied to the Minotaur-I launch vehicle, and contributions of the detailed design and optimization are presented. Optimization results show that the percentage differences between these models for the original vehicle were observed to be 11.55% in velocity and 8.02% in altitude. However, there were differences of 10.06% and 48.8%, 15.8% and 23.2%, and 19.5% and 78.9% in altitudes and velocities when the center of gravity and moment of inertia changes were neglected, and constant aerodynamic coefficients were assumed, respectively. In all these cases, it was observed that the flight path angle was not close to zero. Moreover, the same mission was achieved by the launch vehicle with the optimized hybrid last stage and the propulsion performance was increased by about 7.64% based on the specific impulse and total impulse-over-weight ratio. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) are becoming increasingly valuable as a new type of mobile communication device and autonomous decision-making device in many application areas, including the Internet of Things (IoT). UAVs have advantages over other stationary devices in terms of high flexibility. However, a UAV, as a mobile device, still faces some challenges in optimizing its trajectory for data collection. Firstly, the high complexity of the movement action and state space of the UAV's 3D trajectory is not negligible. Secondly, in unknown urban environments, a UAV must avoid obstacles accurately in order to ensure a safe flight. Furthermore, without a priori wireless channel characterization and ground device locations, a UAV must reliably and safely complete the data collection from the ground devices under the threat of unknown interference. All of these require the proposing of intelligent and automatic onboard trajectory optimization techniques. This paper transforms the trajectory optimization problem into a Markov decision process (MDP), and deep reinforcement learning (DRL) is applied to the data collection scenario. Specifically, the double deep Q-network (DDQN) algorithm is designed to address intelligent UAV trajectory planning that enables energy-efficient and safe data collection. Compared with the traditional algorithm, the DDQN algorithm is much better than the traditional Q-Learning algorithm, and the training time of the network is shorter than that of the deep Q-network (DQN) algorithm. [ABSTRACT FROM AUTHOR]

During the process of reverse parking, it is difficult to achieve the ideal reference trajectory while avoiding collision. In this study, with the aim of establishing reference trajectory optimization for automatic reverse parking that smooths and shortens the trajectory length and ensures the berthing inclination angle is small enough, an improved immune moth–flame optimization method based on gene correction is proposed. Specifically, based on the standard automatic parking plane system, a reasonable high-quality reference trajectory optimization model for automatic parking is constructed by combining the cubic spline-fitting method and a boundary-crossing solution based on gene correction integrated into moth–flame optimization. To enhance the model's global optimization performance, nonlinear decline strategies, including crossover and variation probability and weight coefficient, and a high-quality solution-set maintenance mechanism based on fusion distance are also designed. Taking garage No.160 of the Dalian Shell Museum located in Dalian, Xinghai Square, as the experimental site, experiments on automatic parking reference trajectory optimization and tracking control were carried out. The results show that the proposed optimization algorithm provides higher accuracy for reference trajectory optimization and can achieve better tracking control of the reference trajectory. [ABSTRACT FROM AUTHOR]

Trading off the allocation of limited computational resources between front-end path generation and back-end trajectory optimization plays a key role in improving the efficiency of unmanned aerial vehicle (UAV) motion planning. In this paper, a sampling-based kinodynamic planning method that can reduce the computational cost as well as the risks of UAV flight is proposed. Firstly, an initial trajectory connecting the start and end points without considering obstacles is generated. Then, a spherical space is constructed around the topological vertices of the environment, based on the intersections of the trajectory with the obstacles. Next, some unnecessary sampling points, as well as node rewiring, are discarded by the designed position-checking strategy to minimize the computational cost and reduce the risks of UAV flight. Finally, in order to make the planning framework adaptable to complex scenarios, the strategies for selecting different attraction points according to the environment are designed, which further ensures the safe flight of the UAV while improving the success rate of the front-end trajectory. Simulations and real-world experiment comparisons are conducted on a vision-based platform to verify the performance of the proposed method. [ABSTRACT FROM AUTHOR]

When humanoid robots work in human environments, they are prone to falling. However, when there are objects around that can be utilized, humanoid robots can leverage them to achieve balance. To address this issue, this paper established the state equation of a robot using a variable height-inverted pendulum model and implemented online trajectory optimization using model predictive control. For the arms' optimal joint angles during movement, this paper took the distributed polygon method to calculate the arm postures. To ensure that the robot reached the target position smoothly and rapidly during its motion, this paper adopts a whole-body motion control approach, establishing a cost function for multi-objective constraints on the robot's movement. These constraints include whole-body dynamics, center of mass constraints, arm's end effector constraints, friction constraints, and center of pressure constraints. In the simulation, four sets of methods were compared, and the experimental results indicate that compared to free fall motion, adopting the method proposed in this paper reduces the maximum acceleration of the robot when it touches the wall to 69.1 m/s2, effectively reducing the impact force upon landing. Finally, in the actual experiment, we positioned the robot 0.85 m away from the wall and applied a forward pushing force. We observed that the robot could stably land on the wall, and the impact force was within the range acceptable to the robot, confirming the practical effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Hybrid airships, combining aerodynamic lift and buoyant lift, are efficient near-space aircraft for scientific exploration, observation, and surveillance. Compared to conventional airplanes and airships, hybrid airships offer unique advantages, including stationary hovering and rapid deployment. Due to the different task requirements and strong coupling between flight and environment, trajectory-optimization methods for traditional aircraft are difficult to apply to hybrid airships directly. We propose a trajectory-optimization model based on the variational method to calculate the optimal time and energy paths under weak, uniform, and latitudinal linear wind fields. Our model shows that the influencing factors for the optimization path can be categorized into three types: airship design parameters, wind field parameters, and departure parameters. The result indicates that the optimal time paths are generally straight lines, and the optimal energy paths are piecewise curves with a 24-h cycle under typical hybrid airship design parameters. This work has provided new insight into the trajectory optimization and parameter design of future hybrid airships. [ABSTRACT FROM AUTHOR]

Recent literature indicates that the diffractive sail concept is an interesting alternative to the more conventional reflective solar sail, which converts solar radiation pressure into a (deep space) thrust using a thin, lightweight highly reflective membrane, usually metalized. In particular, a diffractive sail, which uses a metamaterial-based membrane to diffract incoming solar rays, is able to generate a steerable thrust vector even when the sail nominal plane is perpendicular to the Sun–spacecraft line. This paper analyzes the optimal transfer performance of a diffractive-sail-based spacecraft in a challenging heliocentric scenario that is consistent with the proposed Solar Polar Imager mission concept. In this case, the spacecraft must reach a near-circular (heliocentric) orbit with a high orbital inclination with respect to the Ecliptic in order to observe and monitor the Sun's polar regions. Such a specific heliocentric scenario, because of the high velocity change it requires, is a mission application particularly suited for a propellantless propulsion system such as the classical solar sail. However, as shown in this work, the same transfer can be accomplished using a diffractive sail as the primary propulsion system. The main contribution of this paper is the analysis of the spacecraft transfer trajectory using a near-optimal strategy by dividing the entire flight into an approach phase to a circular orbit of the same radius as the desired final orbit but with a smaller inclination, and a subsequent cranking phase until the desired (orbital) inclination is reached. The numerical simulations show that the proposed strategy is sufficiently simple to implement and can provide solutions that differ by only a few percentage points from the optimal results obtainable with a classical indirect approach. [ABSTRACT FROM AUTHOR]

With the development of the Internet of Things (IoT) technology, massive amounts of sensor data in applications such as fire monitoring need to be transmitted to edge servers for timely processing. However, there is an energy-hole phenomenon in transmitting data only through terrestrial multi-hop networks. In this study, we focus on the data collection task in an unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) network, where a UAV is deployed as the mobile data collector for the ground sensor nodes (SNs) to ensure high information freshness. Meanwhile, the UAV is equipped with an edge server for data caching. We first establish a rigorous mathematical model in which the age of information (AoI) is used as a measure of information freshness, related to both the data collection time and the UAV's flight time. Then a mixed-integer non-convex optimization problem is formulated to minimize the peak AoI of the collected data. To solve the problem efficiently, we propose an iterative two-step algorithm named the AoI-minimized association and trajectory planning (AoI-MATP) algorithm. In each iteration, the optimal SN–collection point (CP) associations and CP locations for the parameter ε are first obtained by the affinity propagation clustering algorithm. The optimal UAV trajectory is found using an improved elite genetic algorithm. Simulation results show that based on the optimized ε , the AoI-MATP algorithm can achieve a balance between data collection time and flight time, reducing the peak AoI of the collected data. [ABSTRACT FROM AUTHOR]