Trajectory tracking method based on the circulation of feasible path planning.
Ontology highlight
ABSTRACT:
SUBMITTER: Yu Y
PROVIDER: S-EPMC8184157 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Several approaches have been proposed to assist humans in co-manipulation and teleoperation tasks given demonstrated trajectories. However, these approaches are not applicable when the demonstrations are suboptimal or when the generalization capabilities of the learned models cannot cope with the changes in the environment. Nevertheless, in real co-manipulation and teleoperation tasks, the original demonstrations will often be suboptimal and a learning system must be able to cope with new situations. This paper presents a reinforcement learning algorithm that can be applied to such problems. The proposed algorithm is initialized with a probability distribution of demonstrated trajectories and is based on the concept of relevance functions. We show in this paper how the relevance of trajectory parameters to optimization objectives is connected with the concept of Pearson correlation. First, we demonstrate the efficacy of our algorithm by addressing the assisted teleoperation of an object in a static virtual environment. Afterward, we extend this algorithm to deal with dynamic environments by utilizing Gaussian Process regression. The full framework is applied to make a point particle and a 7-DoF robot arm autonomously adapt their movements to changes in the environment as well as to assist the teleoperation of a 7-DoF robot arm in a dynamic environment.
| S-EPMC7806068 | biostudies-literature
Project description:Due to the curvature of the bone marrow cavity, the intramedullary nail used in long bone fracture fixation can be deformed, causing displacement of the locking holes. In this study, an algorithm using only one C-arm image to determine the center positions and axial directions of locking holes was developed for drilling guidance. Based on conventional method that the axial direction of locking hole would be identified when locking hole contour is presented as a circle, the proposed method can locate the circle contour centroid by using one C-arm image including two elliptical contours. Then the two distal locking holes' axial direction and centers would be determined. Three experiments were conducted to verify the performance of the proposed algorithm, which are (1) computer simulation, (2) use of real intramedullary nails, and (3) actual drilling test with the bone model. The experimental results showed that the average error of the axial direction and center position were 0.62?±?0.6°, 0.73?±?0.53?mm (simulation) and 3.16?±?1.36°, 1.10?±?0.50?mm (actual nail), respectively. The last ten drilling test sets were completed successfully (with an average duration of 48 seconds). Based on the experimental results, the proposed algorithm was feasible for clinic applications.
| S-EPMC5989302 | biostudies-literature
Project description:A camera-based dark-field imaging system can effectively detect defects of microns on large optics by scanning and stitching sub-apertures with a small field of view. However, conventional stitching methods encounter problems of mismatches and location deviations, since few defects exist on the tested fine surface. In this paper, a highly efficient stitching method is proposed, based on a simplified target-tracking and adaptive scanning path correction. By increasing the number of sub-apertures and switching to camera perspective, the defects can be regarded as moving targets. A target-tracking procedure is firstly performed to obtain the marked targets. Then, the scanning path is corrected by minimizing the sum of deviations. The final stitching results are updated by re-using the target-tracking method. An experiment was carried out on an inspection of our specially designed testing sample. Subsequently, 118 defects were identified out of 120 truly existing defects, without stitching mismatches. The experiment results show that this method can help to reduce mismatches and location deviations of defects, and it was also effective in increasing the detectability for weak defects.
| S-EPMC7013512 | biostudies-literature
Project description:The tsscds method, recently developed in our group, discovers chemical reaction mechanisms with minimal human intervention. It employs accelerated molecular dynamics, spectral graph theory, statistical rate theory and stochastic simulations to uncover chemical reaction paths and to solve the kinetics at the experimental conditions. In the present review, its application to solve mechanistic/kinetics problems in different research areas will be presented. Examples will be given of reactions involved in photodissociation dynamics, mass spectrometry, combustion chemistry and organometallic catalysis. Some planned improvements will also be described.
| S-EPMC6321347 | biostudies-other
Project description:Unmanned Aerial Vehicles are useful tools for many applications. However, autonomous path planning for Unmanned Aerial Vehicles in unfamiliar environments is a challenging problem when facing a series of problems such as poor consistency, high influence by the native controller of the Unmanned Aerial Vehicles. In this paper, we investigate reinforcement learning-based autonomous local path planning methods for Unmanned Aerial Vehicles with high autonomous decision-making capability and locally high portability. We propose an autonomous local path planning algorithm based on the TD3 strategy to solve the problem of local obstacle avoidance and path planning in unfamiliar environments using autonomous decision-making of Unmanned Aerial Vehicles. The simulation results on Gazebo show that our method can effectively realize the autonomous local path planning task for Unmanned Aerial Vehicles, the success rate of path planning with our method can reach 93% under the interference of no obstacles, and 92% in the environment with obstacles. Finally, our method can be used for autonomous path planning of Unmanned Aerial Vehicles in unfamiliar environments.
| S-EPMC10774288 | biostudies-literature
Project description:Effective logistics distribution paths are crucial in enhancing the fundamental competitiveness of an enterprise. This research introduces the genetic algorithm for logistics routing to address pertinent research issues, such as suboptimal scheduling of time-sensitive orders and reverse distribution of goods. It proposes an enhanced scheme integrating the Metropolis criterion. To address the limited local search ability of the genetic algorithm, this study combines the simulated annealing algorithm's powerful local optimization capability with the genetic algorithm, thereby developing a genetic algorithm with the Metropolis criterion. The proposed method preserves the optimal chromosome in each generation population and accepts inferior chromosomes with a certain probability, thereby enhancing the likelihood of finding an optimal local solution and achieving global optimization. A comparative study is conducted with the Ant Colony Optimization, Artificial Bee Colony, and Particle Swarm Optimization algorithms, and empirical findings demonstrate that the proposed genetic algorithm effectively achieves excellent results over these algorithms.
| S-EPMC10280545 | biostudies-literature
Project description:Path planning is one of the most critical issues in many related fields including UAVs. Many researchers have addressed this problem according to different conditions and limitations, but modelling the 3-D space and routing with an evolutional algorithm in such spaces is an open issue. So, in this paper, we first, introduce a method to grids the environment using geometrical shapes. This can reduce the random states of cell decomposition and increases the computational speed. We then propose an effective routing algorithm based on the butterfly optimization algorithm (BOA). It can simultaneously optimize multiple path planning objectives. It uses an objective function to compute the shortest path, based on obstacle avoidance and the UAV's operational power minimization. A novel concept, the intelligent throwing agent, used in this algorithm prevents getting stuck in local optima and increases the network coverage in path planning. The throwing agent prevents the collision of the UAV with the obstacles using geometrical techniques and contour lines. The simulation results show that BOA has the least and second-least cost in best-case and worst-case scenarios in comparison with ant colony and particle swarm. Its run time and the optimal value of the fitting function are also better than the two other algorithms.
| S-EPMC11303821 | biostudies-literature
Project description:PURPOSE:Robotic stabilization of a therapeutic radiation beam with respect to a dynamically moving tumor target can be accomplished either by moving the radiation source, the patient, or both. As the treatment beam is on during this process, the primary goal is to minimize exposure of normal tissue to radiation as much as possible when moving the target back to the desired position. Due to the complex mechanical structure of 6 degree-of-freedom (6DoF) robots, it is not intuitive as to what 6 dimensional (6D) correction trajectory is optimal in achieving such a goal. With proportional-integrative-derivative (PID) and other controls, the potential exists that the controller may generate a trajectory that is highly curved, slow, or suboptimal in that it leads to unnecessary exposure of healthy tissue to radiation. This work investigates a novel feedback planning method that takes into account a robot's mechanical joint structure, patient safety tolerances, and other system constraints, and performs real-time optimization to search the entire 6D trajectory space in each time cycle so it can respond with an optimal 6D correction trajectory. METHODS:Computer simulations were created for two 6DoF robotic patient support systems: a Stewart-Gough platform for moving a patient's head in frameless maskless stereotactic radiosurgery, and a linear accelerator treatment table for moving a patient in prostate cancer radiation therapy. Motion planning was formulated as an optimization problem and solved at real-time speeds using the L-BFGS algorithm. Three planning methods were investigated, moving the platform as fast as possible (platform-D), moving the target along a straight-line (target-S), and moving the target based on the fastest descent of position error (target-D). Both synthetic motion and prior recorded human motion were used as input data and output results were analyzed. RESULTS:For randomly generated 6D step-like and sinusoidal synthetic input motion, target-D planning demonstrated the smallest net trajectory error in all cases. On average, optimal planning was found to have a 45% smaller target trajectory error than platform-D control, and a 44% smaller target trajectory error than target-S planning. For patient head motion compensation, only target-D planning was able to maintain a ?0.5mm and ?0.5deg clinical tolerance objective for 100% of the treatment time. For prostate motion, both target-S planning and target-D planning outperformed platform-D control. CONCLUSIONS:A general 6D target trajectory optimization framework for robotic patient motion compensation systems was investigated. The method was found to be flexible as it allows control over various performance requirements such as mechanical limits, velocities, acceleration, or other system control objectives.
| S-EPMC6329492 | biostudies-literature
Project description:In 2009 a novel pandemic H1N1 influenza virus (H1N1pdm09) emerged as the first official influenza pandemic of the 21st century. Early genomic sequence analysis pointed to the swine origin of the virus. Here we report a novel computational approach to determine the evolutionary trajectory of viral sequences that uses data-driven estimations of nucleotide substitution rates to track the gradual accumulation of observed sequence alterations over time. Phylogenetic analysis and multiple sequence alignments show that sequences belonging to the resulting evolutionary trajectory of the H1N1pdm09 lineage exhibit a gradual accumulation of sequence variations and tight temporal correlations in the topological structure of the phylogenetic trees. These results suggest that our evolutionary trajectory analysis (ETA) can more effectively pinpoint the evolutionary history of viruses, including the host and geographical location traversed by each segment, when compared against either BLAST or traditional phylogenetic analysis alone.
| S-EPMC4257861 | biostudies-literature
Project description:Deep reinforcement learning (DRL) has excellent performance in continuous control problems and it is widely used in path planning and other fields. An autonomous path planning model based on DRL is proposed to realize the intelligent path planning of unmanned ships in the unknown environment. The model utilizes the deep deterministic policy gradient (DDPG) algorithm, through the continuous interaction with the environment and the use of historical experience data; the agent learns the optimal action strategy in a simulation environment. The navigation rules and the ship's encounter situation are transformed into a navigation restricted area, so as to achieve the purpose of planned path safety in order to ensure the validity and accuracy of the model. Ship data provided by ship automatic identification system (AIS) are used to train this path planning model. Subsequently, the improved DRL is obtained by combining DDPG with the artificial potential field. Finally, the path planning model is integrated into the electronic chart platform for experiments. Through the establishment of comparative experiments, the results show that the improved model can achieve autonomous path planning, and it has good convergence speed and stability.
| S-EPMC7013856 | biostudies-literature