Search

Featured Application: Healthcare, remote sensing, and military. Background: Over the last few decades, telepresence robots (TRs) have drawn significant attention in academic and healthcare systems due to their enormous benefits, including safety improvement, remote access and economics, reduced traffic congestion, and greater mobility. COVID-19 and advancements in the military play a vital role in developing TRs. Since then, research on the advancement of robots has been attracting much attention. Methods: In critical areas, the placement and movement of humans are not safe, and researchers have started looking at the development of robots. Robot development includes many parameters to be analyzed, and trajectory planning and optimization are among them. The main objective of this study is to present a trajectory control and optimization algorithm for a cognitive architecture named auto-MERLIN. Optimization algorithms are developed for trajectory control. Results: The derived work empirically tests the solutions and provides execution details for creating the trajectory design. We develop the trajectory algorithm for the clockwise direction and another one for the clockwise and counterclockwise directions. Conclusions: Experimental results are drawn to support the proposed algorithm. Self-localization, self-driving, and right and left turn trajectories are drawn. All of the experimental results show that the designed TR works properly, with better accuracy and only a slight jitter in the orientation. The jitter is found due to the environmental factor caught by the sensors, which can be filtered easily. The results show that the proposed approach is less complex and provides better trajectory planning accuracy. [ABSTRACT FROM AUTHOR]

In this article, we propose a nonlinear receding horizon game-theoretic planner for autonomous cars in competitive scenarios with other cars. The online planner is specifically formulated for a multiple-car autonomous racing game, in which each car tries to advance along a given track as far as possible with respect to the other cars. The algorithm extends previous work on game-theoretic planning for single-integrator agents to be suitable for autonomous cars in the following ways: 1) by representing the trajectory as a piecewise polynomial; 2) incorporating bicycle kinematics into the trajectory; and 3) enforcing constraints on path curvature and acceleration. The game-theoretic planner iteratively plans a trajectory for the ego vehicle and then the other vehicles in sequence until convergence. Crucially, the trajectory optimization includes a sensitivity term that allows the ego vehicle to reason about how much the other vehicles will yield to the ego vehicle to avoid collisions. The resulting trajectories for the ego vehicle exhibit rich game strategies such as blocking, faking, and opportunistic overtaking. The game-theoretic planner is shown to significantly outperform a baseline planner using model-predictive control, which does not take interaction into account. The performance is validated in high-fidelity numerical simulations with three cars, in experiments with two small-scale autonomous cars, and in experiments with a full-scale autonomous car racing against a simulated vehicle (video is available at https://youtube.com/playlist?list=PLmIcLEh8KMje4rYBqRANDuKvqFvj7LCRp). [ABSTRACT FROM AUTHOR]

The time-optimal trajectory planning problem involves minimizing the time required to follow a path defined in space, subject to kinematic and dynamic constraints. Here, we introduce a novel technique, called the bisection algorithm (BA), which is fully implemented in C++ and extends dynamic programming approaches to the problem. These approaches, which rely on dividing the global problem into a series of simpler subproblems, become increasingly advantageous compared to direct transcription methods as the number of problem constraints increases. In contrast to nearly all other dynamic programming approaches, BA does not rely on finding a maximum-velocity curve or explicitly finding acceleration switching points during the trajectory planning process. Additionally, only one forward and one backward integration are used, during which all constraints are imposed. This approach is made feasible through careful control of the numerical integration process and the use of a bisection algorithm to resolve constraint violations during integration. BA is shown to be significantly simpler, faster, and more robust than recently proposed algorithms: a direct comparison is made for a series of paths to be followed by a serial manipulator, subject to kinematic constraints. The wide applicability of BA is then established by solving the time-optimal problem for a parallel manipulator following a complex path, subject to both kinematic and dynamic constraints. [ABSTRACT FROM AUTHOR]

This article proposes a computational trajectory optimization framework for solving the problem of multiobjective automatic parking motion planning. Constrained automatic parking maneuver problem is usually difficult to solve because of some practical limitations and requirements. This problem becomes more challenging when multiple objectives are required to be optimized simultaneously. The designed approach employs a swarm intelligent algorithm to produce the tradeoff front along the objective space. In order to enhance the local search ability of the algorithm, a gradient operation is utilized to update the solution. In addition, since the evolutionary process tends to be sensitive with respect to the flight control parameters, a novel adaptive parameter controller is designed and incorporated in the algorithm framework such that the proposed method can dynamically balance the exploitation and exploration. The performance of using the designed multiobjective strategy is validated and analyzed by performing a number of simulation and experimental studies. The results indicate that the present approach can provide reliable solutions and it can outperform other existing approaches investigated in this article. [ABSTRACT FROM AUTHOR]

With the exponential growth of data traffic, caching is regarded as a promising solution to combine with unmanned aerial vehicle (UAV)-assisted networks, which can offload cellular traffic and improve the system performance. Moreover, the cache capacity at user side can be leveraged, e.g., through local data storage or device-to-device (D2D) sharing. In this paper, we focus on the performance analysis and trajectory optimization of cache-enabled UAV-assisted networks with underlaid D2D communications. We consider both static and dynamic UAV deployments. For static UAV deployment, we first formulate an optimization problem to design the cache placement in order to maximize the cache hit probability. Then, the successful transfer probability (STP) and sum-rate are analyzed by using stochastic geometry, and their closed-form expressions are derived. For dynamic UAV deployment, the UAV moves over the cell and stops at several path points to serve users. To shorten the time required for the UAV to cover all users, a spiral algorithm is proposed to optimize the UAV trajectory, aiming at minimizing the number of UAV path points. Moreover, since at different locations, the UAV communication will incur different interference on D2D users, we derive the outage probability for the D2D users. Simulation results show the significant performance gain of our proposed probabilistic cache placement over existing strategies. For a given user density, we show that the optimal values for the UAV height which lead to the maximum UAV-STP and sum-rate exist. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the unmanned aerial vehicle (UAV)-aided simultaneous uplink and downlink transmission networks, where one UAV acting as a disseminator is connected to multiple access points (AP), and the other UAV acting as a base station (BS) collects data from numerous sensor nodes (SNs). The goal of this paper is to maximize the system throughput by jointly optimizing the 3D UAV trajectory, communication scheduling, and UAV-AP/SN transmit power. We first consider a special case where the UAV-BS and UAV-AP trajectories are pre-determined. Although the resulting problem is an integer and non-convex optimization problem, a globally optimal solution is obtained by applying the polyblock outer approximation (POA) method based on the problem’s hidden monotonic structure. Subsequently, for the general case considering the 3D UAV trajectory optimization, an efficient iterative algorithm is proposed to alternately optimize the divided sub-problems based on the successive convex approximation (SCA) technique. Numerical results demonstrate that the proposed design is able to achieve significant system throughput gain over the benchmarks. In addition, the SCA-based method can achieve nearly the same performance as the POA-based method with much lower computational complexity. [ABSTRACT FROM AUTHOR]

Avionics and air traffic management (ATM) systems are evolving with the introduction of progressively higher levels of automation, toward attaining the ambitious operational, technical, and safety enhancements required to sustain the present growth of global air traffic. This paper presents novel 4-Dimensional Trajectory (4DT) functionalities that are being developed for integration in ATM and avionics systems to support trajectory based operations (TBO). The 4DT planning process, which is the main focus of the paper, is supported by a custom multiobjective variant of state-of-the-art optimal control algorithms, incorporating various operational, economic, and environmental factors. Capitalizing on the higher theoretical accuracy offered by optimal control algorithms compared to other methods, a key feature of the proposed approach is the introduction of a postprocessing stage to ensure that the mathematically optimal trajectories are translated into a set of standardized 4DT descriptors, which can be flown by state-of-the-art automatic flight control systems. Additionally, to support air-ground 4DT intent negotiation and validation in the TBO context, the 4DT postprocessing ensures that optimal trajectories are synthetically described by a limited number of parameters, minimizing the bandwidth requirements imposed on airborne data links. Simulation-based verification activities addressing operational efficiency improvements and computational performance in the terminal area ATM context support the viability of the proposed 4DT planning functionality for online tactical TBO. [ABSTRACT FROM AUTHOR]

This paper investigates unmanned aerial vehicle (UAV) enabled secure communication systems where a mobile UAV wishes to send confidential messages to multiple ground users. To improve the security performance, a cooperative UAV is additionally considered that transmits the jamming signal. In this system, we maximize the minimum secrecy rate among the ground users by jointly optimizing the trajectory and the transmit power of the UAVs as well as the user scheduling. To efficiently solve this nonconvex problem, we adopt block successive upper bound minimization techniques, which address a sequence of approximated convex problems for each block of variables. Numerical results verify that the proposed algorithm outperforms baseline methods. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) are anticipated to be widely deployed in future wireless communications, due to their advantages of high mobility and easy deployment. However, the broadcast nature of air-to-ground line-of-sight wireless channels brings a new challenge to the information security of UAV-ground communication. This paper tackles such a challenge in the physical layer by exploiting the mobility of UAV via its trajectory design. We consider a UAV-ground communication system with multiple potential eavesdroppers on the ground, where the information on the locations of the eavesdroppers is imperfect. We formulate an optimization problem, which maximizes the average worst case secrecy rate of the system by jointly designing the robust trajectory and transmit power of the UAV over a given flight duration. The nonconvexity of the optimization problem and the imperfect location information of the eavesdroppers make the problem difficult to be solved optimally. We propose an iterative suboptimal algorithm to solve this problem efficiently by applying the block coordinate descent method, $\mathcal {S}$ -procedure, and successive convex optimization method. Simulation results show that the proposed algorithm can improve the average worst case secrecy rate significantly, as compared to two other benchmark algorithms without robust design. [ABSTRACT FROM AUTHOR]

Rockfall is a frequent engineering disaster confronted in the capital construction engineering. The key for preventing rock fall is the evaluation of the rockfall trajectory. After extensive analysis, an innovative calculation method of rockfall trajectory, called segmented cycling algorithm, has been proposed in the paper. According to the contact relationship between the rolling stones and the slope surface, the movement divided into three sections which include the bouncing phase, the rolling (sliding) phase and collision phase, the formulae to calculate the velocity of different phases of motion are proposed respectively by segmented cycling algorithm. A similar model, based on a rock slope in Chongqing-Wanzhou highway, is established to verify the capability and validity of the presented algorithm. Compared with existing algorithm, the new algorithm is simple and clear, easy to use and so on. The algorithm meets the law of the movement of rockfall and can be used to forecast the kinetic feature of rockfall. It is also used as the basis for rockfall disaster prevention. [ABSTRACT FROM AUTHOR]

A method is proposed for identifying five crowd behaviors (bottlenecks, fountainheads, lanes, arches, and blocking) in visual scenes. In the algorithm, a scene is overlaid by a grid of particles initializing a dynamical system defined by the optical flow. Time integration of the dynamical system provides particle trajectories that represent the motion in the scene; these trajectories are used to locate regions of interest in the scene. Linear approximation of the dynamical system provides behavior classification through the Jacobian matrix; the eigenvalues determine the dynamic stability of points in the flow and each type of stability corresponds to one of the five crowd behaviors. The eigenvalues are only considered in the regions of interest, consistent with the linear approximation and the implicated behaviors. The algorithm is repeated over sequential clips of a video in order to record changes in eigenvalues, which may imply changes in behavior. The method was tested on over 60 crowd and traffic videos. [ABSTRACT FROM AUTHOR]

This paper presents an accelerometer-based digital pen for handwritten digit and gesture trajectory recognition applications. The digital pen consists of a triaxial accelerometer, a microcontroller, and an RF wireless transmission module for sensing and collecting accelerations of handwriting and gesture trajectories. The proposed trajectory recognition algorithm composes of the procedures of acceleration acquisition, signal preprocessing, feature generation, feature selection, and feature extraction. The algorithm is capable of translating time-series acceleration signals into important feature vectors. Users can use the pen to write digits or make hand gestures, and the accelerations of hand motions measured by the accelerometer are wirelessly transmitted to a computer for online trajectory recognition. The algorithm first extracts the time- and frequency-domain features from the acceleration signals and, then, further identifies the most important features by a hybrid method: kernel-based class separability for selecting significant features and linear discriminant analysis for reducing the dimension of features. The reduced features are sent to a trained probabilistic neural network for recognition. Our experimental results have successfully validated the effectiveness of the trajectory recognition algorithm for handwritten digit and gesture recognition using the proposed digital pen. [ABSTRACT FROM PUBLISHER]

This paper presents a methodology of calculating the optimal torque and speed commands for the engine–generator system of a series hybrid electric vehicle (HEV). In series HEVs, the engine–generator subsystem provides electrical energy to the dc link. This paper proposes an optimal control strategy of the engine–generator subsystem to generate a desired amount of energy within a given period of time. The optimization algorithm, based on trajectory optimization, determines the torque and speed reference signals for the engine–generator subsystem that achieve maximum efficiency. A simplified version of the controller is also presented for online implementation. The proposed control strategy is compared with nonoptimized control techniques, and simulation results show the improvements in energy efficiency. [ABSTRACT FROM PUBLISHER]

In this paper, we define a discrete dynamical system that governs the evolution of a population of agents. From the dynamical system, a variant of differential evolution (DE) is derived. It is then demonstrated that, under some assumptions on the differential mutation strategy and on the local structure of the objective function, the proposed dynamical system has fixed points toward which it converges with probability one for an infinite number of generations. This property is used to derive an algorithm that performs better than standard DE on some space trajectory optimization problems. The novel algorithm is then extended with a guided restart procedure that further increases the performance, reducing the probability of stagnation in deceptive local minima. [ABSTRACT FROM AUTHOR]

Motivated by recent research on cooperative unmanned aerial vehicles (UAVs), this paper introduces a new cooperative distributed trajectory optimization approach for systems with independent dynamics but coupled objectives and hard constraints. The overall goal is to develop a distributed approach that solves small subproblems while minimizing a fleet-level objective. In the new algorithm, vehicles solve their subproblems in sequence while generating feasible modifications to the prediction of other vehicles' plans. In order to avoid reproducing the global optimization, the decisions of other vehicles are parameterized using a much smaller number of variables than in the centralized formulation. This reduced number of variables is sufficient to improve the cooperation between vehicles without significantly increasing the computational effort involved. The resulting algorithm is shown to be robustly feasible under the action of unknown but bounded disturbances. Furthermore, the fleet objective function is proven to monotonically decrease as the algorithm cycles through the vehicles in the fleet and over the time. The results from simulations and a hardware experiment demonstrate that the proposed algorithm can improve the fleet objective by temporarily having one vehicle sacrifice its individual objective, showing the cooperative behavior. [ABSTRACT FROM PUBLISHER]

The theme of this paper is part of the Astronomy with a Neutrino Telescope and Abyss RESearch (ANTARES) international project, the object of which is to build a submarine neutrino telescope located near Toulon, France. In deep water, a neutrino can interact with a nucleus in a water molecule. The collision generates a luminous flash and an acoustic wave. The goal of this paper is to propose a system able to detect and estimate the initial direction of the particle. We first focus on the detector by comparing some detection methods and choose the one which best corresponds to our problem. Then, position and direction of the neutrino are estimated with a Gauss–Newton derived algorithm. This estimator is based on a wavefront propagation model and on the time detection information given by the telescope hydrophones. Performance of the system is then described. An antenna structure is then proposed and a global simulation finalizes this paper. The use of real underwater sea noise and the results of the simulation validate the work. [ABSTRACT FROM AUTHOR]

Copyright of Revista Tecno Lógicas is the property of Instituto Tecnologico Metropolitano and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Numerical simulations play an essential role in the development and testing of navigation and guidance algorithms, especially when developer must keep the development costs as low as possible. Low budget development focuses mainly on utilization of numerical flight mechanics simulators including optimization and hardware in loop tests. Reliable, high fidelity results can be easily obtained by numerical simulations of flight dynamics utilizing computing power provided by a normal off-the-shelf home PC. However, it still requires a simple, but good and valid model of the aircraft and environment. This paper describes an approach to a numerical simulation of aircraft motion that respects the requirement for a full environment high fidelity model and keeps a good interface for further development of attitude control. The goal is achieved by directly specifying the aerodynamic angles of the vehicle in the simulation environment by the guidance system, which can later be used as input for attitude control algorithms. It is proved how an appropriate selection of reference frames and formulation of laws of motion gives very quick and reliable results by employing large integration time steps that would be difficult to achieve in 6-degree-of-freedom simulations. This paper also investigates the range of applicability, advantages, and drawbacks of this method. An example of an aerodynamic angle-based guidance law for a UAV is explained and demonstrated by figures. [ABSTRACT FROM AUTHOR]

Singularity is a major problem for parallel robots as in these configurations the robot cannot be controlled, and there may be infinite forces/torques in its joints, possibly leading to its breakdown. Hence, such a configuration must usually be avoided, and certifying the absence of singularity within a prescribed workspace or on a given trajectory is essential for a practical use of this type of robots. Singularity conditions are usually quite complex, and therefore a purely analytical analysis is difficult. We present here an algorithm that combines formal and numerical calculations for detecting singularity or closeness to a singularity within an arbitrary workspace or trajectory. This algorithm has the very important advantage of being able to deal with any robot mechanical structure and to manage uncertainties in the robot control and in the robot modeling. [ABSTRACT FROM PUBLISHER]

In recent years, due to the strong mobility, easy deployment, and low cost of unmanned aerial vehicles (UAV), great interest has arisen in utilizing UAVs to assist in wireless communication, especially for on-demand deployment in emergency situations and temporary events. However, UAVs can only provide users with data transmission services through wireless backhaul links established with a ground base station, and the limited capacity of the wireless backhaul link would limit the transmission speed of UAVs. Therefore, this paper designed a UAV-assisted wireless communication system that used cache technology and realized the transmission of multi-user data by using the mobility of UAVs and wireless cache technology. Considering the limited storage space and energy of UAVs, the joint optimization problem of the UAV's trajectory, cache placement, and transmission power was established to minimize the mission time of the UAV. Since this problem was a non-convex problem, it was decomposed into three sub-problems: trajectory optimization, cache placement optimization, and power allocation optimization. An iterative algorithm based on the successive convex approximation and alternate optimization techniques was proposed to solve these three optimization problems. Finally, in the power allocation optimization, the proposed algorithm was improved by changing the optimization objective function. Numerical results showed that the algorithm had good performance and could effectively reduce the task completion time of the UAV. [ABSTRACT FROM AUTHOR]