Predict-and-Drive: Avatar Motion Adaption in Room-Scale Augmented Reality Telepresence with Heterogeneous Spaces

Avatar-mediated symmetric Augmented Reality (AR) telepresence has emerged with the ability to empower users located in different remote spaces to interact with each other in 3D through avatars. However, different spaces have heterogeneous structures and features, which bring difficulties in synchronizing avatar motions with real user motions and adapting avatar motions to local scenes. To overcome these issues, existing methods generate mutual movable spaces or retarget the placement of avatars. However, these methods limit the telepresence experience in a small sub-area space, fix the positions of users and avatars, or adjust the beginning/ending positions of avatars without presenting smooth transitions. Moreover, the delay between the avatar retargeting and users' real transitions can break the semantic synchronization between users' verbal conversation and perceived avatar motion. In this paper, we first examine the impact of the aforementioned transition delay and explore the preferred transition style with the existence of such delay through user studies. With the results showing a significant negative effect of avatar transition delay and providing the design choice of the transition style, we propose a Predict-and-Drive controller to diminish the delay and present the smooth transition of the telepresence avatar. We also introduce a grouping component as an upgrade to immediately calculate a coarse virtual target once the user initiates a transition, which could further eliminate the avatar transition delay. Once having the coarse virtual target or an exactly predicted target, we find the corresponding target for the avatar according to the pre-constructed mapping of objects of interest between two spaces. The avatar control component maintains an artificial potential field of the space and drives the avatar towards the target while respecting the obstacles in the physical environment. We further conduct ablation studies to evaluate the effectiveness of our proposed components.

Smart Vehicle Path Planning Based on Modified PRM Algorithm

Path planning is a very important step for mobile smart vehicles in complex environments. Sampling based planners such as the Probabilistic Roadmap Method (PRM) have been widely used for smart vehicle applications. However, there exist some shortcomings, such as low efficiency, low reuse rate of the roadmap, and a lack of guidance in the selection of sampling points. To solve the above problems, we designed a pseudo-random sampling strategy with the main spatial axis as the reference axis. We optimized the generation of sampling points, removed redundant sampling points, set the distance threshold between road points, adopted a two-way incremental method for collision detections, and optimized the number of collision detection calls to improve the construction efficiency of the roadmap. The key road points of the planned path were extracted as discrete control points of the Bessel curve, and the paths were smoothed to make the generated paths more consistent with the driving conditions of vehicles. The correctness of the modified PRM was verified and analyzed using MATLAB and ROS to build a test platform. Compared with the basic PRM algorithm, the modified PRM algorithm has advantages related to speed in constructing the roadmap, path planning, and path length.

Sobel Potential Field: Addressing Responsive Demands for UAV Path Planning Techniques

Dealing with the trade-off challenge between computation speed and path quality has been a high-priority research area in the robotic path planning field during the last few years. Obtaining a shorter optimized path requires additional processing since iterative algorithms are adopted to keep enhancing the final optimized path. Therefore, it is a challenging problem to obtain an optimized path in a real-time manner. However, this trade-off problem becomes more challenging when planning a path for an Unmanned Aerial Vehicle (UAV) system since they operate in 3D environments. A 3D map will naturally have more data to be processed compared to a 2D map and thus, processing becomes more expensive and time-consuming. This paper proposes a new 3D path planning technique named the Sobel Potential Field (SPF) technique to deal effectively with the swiftness-quality trade-off. The rationale of the proposed SPF technique is to minimize the processing of potential field methods. Instead of applying the potential field analysis on the whole 3D map which could be a very expensive operation, the proposed SPF technique will tend to focus on obstacle areas. This is done by adopting the Sobel edge detection technique to detect the 3D edges of obstacles. These edges will be the sources of the repulsive forces while the goal point will be emitting an attractive force. Next, a proposed objective function models the strength of the attractive and repulsive forces differently to have various influences on each point on the map. This objective function is then optimized using Particle Swarm Optimization (PSO) to find an obstacle-free path to the destination. Finally, the PSO-based path is optimized further by finding linear shortcuts in the path. Testbed experimental results have proven the effectiveness of the proposed SPF technique and showed superior performance over other meta-heuristic optimization techniques, as well as popular path planning techniques such as A* and PRM.

End-to-end human inspired learning based system for dynamic obstacle avoidance

As a first, the paper proposes modelling and learning of specific behaviors for dynamic obstacle avoidance in end-to-end motion planning. In the literature many end-to-end methods have been used in simulators to drive a car and to apply the learnt strategies to avoid the obstacles using the lane changing, following the vehicle as per the traffic rules, driving in-between the lane boundaries, and many more behaviors. The proposed method is designed to avoid obstacles in the scenarios where a dynamic obstacle is headed directly towards the robot from different directions. To avoid the critical encounter of the dynamic obstacles, we trained a novel deep neural network (DNN) with two specific behavioral obstacle avoidance strategies, namely “head-on collision avoidance” and “stop and move”. These two strategies of obstacle avoidance come from the human behavior of obstacle avoidance. Looking at the current frame only, for a very similar visual display of the scenario, the two strategies have contrasting outputs and overall outcomes that makes learning very difficult. A random data recording over general simulations is unlikely to record the corner cases of both behaviors that rarely occur, and a behavior-specific training used in this paper intensifies the same cases for a better learning of the robot in such corner cases. We calculate the intention of the obstacle, whether it will move or not. This proposed method is compared with three state-of-the-art methods of motion planning, namely Timed-Elastic Band, Dynamic Window Approach and Nonlinear Probabilistic Velocity Obstacle. The proposed method beats all the state-of-the-art methods used for comparisons.

Auto-splitting D* lite path planning for large disaster area

This research introduces a new path planning method for rescue robots in a dynamic and partially known area when the robots are performing tasks in a large area. The path planning of the rescue robots that move in the dynamic area is introduced to solve the issue of unnecessary areas, which are the disadvantages of the existing D*-based algorithms. This paper proposes a method to eliminate unnecessary expanded nodes of the dynamic and partially known environment by segmenting a map with an auto-clustering algorithm, which is able to achieve a faster execution time than conventional algorithms. Furthermore, to show the effectiveness of the proposed algorithms, an expected value of re-planned nodes in the dynamic and partially known area is introduced using a probability-based approach.

Local and Global Path Planning for Autonomous Mobile Robots Using Hierarchized Maps

We are currently facing a “labor crisis,” particularly in the field of logistics, because of reductions in the labor force. Therefore, industries must make their logistics more efficient by utilizing autonomous mobile robotics technologies. This paper proposes a hierarchized map concept that makes unmanned delivery tasks which use multiple autonomous robots more efficiently. Using our proposed concept, an autonomous mobile robot can move automatically on a more efficient path than using current methods. In addition, the management platform for autonomous robots can be used to prevent accidents such as collisions or deadlocks between autonomous robots.

Airspace Geofencing and Flight Planning for Low-Altitude, Urban, Small Unmanned Aircraft Systems

Airspace geofencing is a key capability for low-altitude Unmanned Aircraft System (UAS) Traffic Management (UTM). Geofenced airspace volumes can be allocated to safely contain compatible UAS flight operations within a fly-zone (keep-in geofence) and ensure the avoidance of no-fly zones (keep-out geofences). This paper presents the application of three-dimensional flight volumization algorithms to support airspace geofence management for UTM. Layered polygon geofence volumes enclose user-input waypoint-based 3-D flight trajectories, and a family of flight trajectory solutions designed to avoid keep-out geofence volumes is proposed using computational geometry. Geofencing and path planning solutions are analyzed in an accurately mapped urban environment. Urban map data processing algorithms are presented. Monte Carlo simulations statistically validate our algorithms, and runtime statistics are tabulated. Benchmark evaluation results in a Manhattan, New York City low-altitude environment compare our geofenced dynamic path planning solutions against a fixed airway corridor design. A case study with UAS route deconfliction is presented, illustrating how the proposed geofencing pipeline supports multi-vehicle deconfliction. This paper contributes to the nascent theory and the practice of dynamic airspace geofencing in support of UTM.

Model-Based Slippage Estimation to Enhance Planetary Rover Localization with Wheel Odometry

The exploration of planetary surfaces with unmanned wheeled vehicles will require sophisticated software for guidance, navigation and control. Future missions will be designed to study harsh environments that are characterized by rough terrains and extreme conditions. An accurate knowledge of the trajectory of planetary rovers is fundamental to accomplish the scientific goals of these missions. This paper presents a method to improve rover localization through the processing of wheel odometry (WO) and inertial measurement unit (IMU) data only. By accurately defining the dynamic model of both a rover’s wheels and the terrain, we provide a model-based estimate of the wheel slippage to correct the WO measurements. Numerical simulations are carried out to better understand the evolution of the rover’s trajectory across different terrain types and to determine the benefits of the proposed WO correction method.

Laser-Based People Detection and Obstacle Avoidance for a Hospital Transport Robot

This paper describes the development of a laser-based people detection and obstacle avoidance algorithm for a differential-drive robot, which is used for transporting materials along a reference path in hospital domains. Detecting humans from laser data is an important functionality for the safety of navigation in the shared workspace with people. Nevertheless, traditional methods normally utilize machine learning techniques on hand-crafted geometrical features extracted from individual clusters. Moreover, the datasets used to train the models are usually small and need to manually label every laser scan, increasing the difficulty and cost of deploying people detection algorithms in new environments. To tackle these problems, (1) we propose a novel deep learning-based method, which uses the deep neural network in a sliding window fashion to effectively classify every single point of a laser scan. (2) To increase the speed of inference without losing performance, we use a jump distance clustering method to decrease the number of points needed to be evaluated. (3) To reduce the workload of labeling data, we also propose an approach to automatically annotate datasets collected in real scenarios. In general, the proposed approach runs in real-time and performs much better than traditional methods. Secondly, conventional pure reactive obstacle avoidance algorithms can produce inefficient and oscillatory behaviors in dynamic environments, making pedestrians confused and possibly leading to dangerous reactions. To improve the legibility and naturalness of obstacle avoidance in human crowded environments, we introduce a sampling-based local path planner, similar to the method used in autonomous driving cars. The key idea is to avoid obstacles by switching lanes. We also adopt a simple rule to decrease the number of unnecessary deviations from the reference path. Experiments carried out in real-world environments confirmed the effectiveness of the proposed algorithms.

Hybrid Path Planning Combining Potential Field with Sigmoid Curve for Autonomous Driving

The traditional potential field-based path planning is likely to generate unexpected path by strictly following the minimum potential field, especially in the driving scenarios with multiple obstacles closely distributed. A hybrid path planning is proposed to avoid the unsatisfying path generation and to improve the performance of autonomous driving by combining the potential field with the sigmoid curve. The repulsive and attractive potential fields are redesigned by considering the safety and the feasibility. Based on the objective of the shortest path generation, the optimized trajectory is obtained to improve the vehicle stability and driving safety by considering the constraints of collision avoidance and vehicle dynamics. The effectiveness is examined by simulations in multiobstacle dynamic and static scenarios. The simulation results indicate that the proposed method shows better performance on vehicle stability and ride comfortability than that of the traditional potential field-based method in all the examined scenarios during the autonomous driving.

Exploiting upper-limb functional principal components for human-like motion generation of anthropomorphic robots

BACKGROUND

Human-likeliness of robot movements is a key component to enable a safe and effective human-robot interaction, since it contributes to increase acceptance and motion predictability of robots that have to closely interact with people, e.g. for assistance and rehabilitation purposes. Several parameters have been used to quantify how much a robot behaves like a human, which encompass aspects related to both the robot appearance and motion. The latter point is fundamental to allow the operator to interpret robotic actions, and plan a meaningful reactions. While different approaches have been presented in literature, which aim at devising bio-aware control guidelines, a direct implementation of human actions for robot planning is not straightforward, still representing an open issue in robotics.

METHODS

We propose to embed a synergistic representation of human movements for robot motion generation. To do this, we recorded human upper-limb motions during daily living activities. We used functional Principal Component Analysis (fPCA) to extract principal motion patterns. We then formulated the planning problem by optimizing the weights of a reduced set of these components. For free-motions, our planning method results into a closed form solution which uses only one principal component. In case of obstacles, a numerical routine is proposed, incrementally enrolling principal components until the problem is solved with a suitable precision.

RESULTS

Results of fPCA show that more than 80% of the observed variance can be explained by only three functional components. The application of our method to different meaningful movements, with and without obstacles, show that our approach is able to generate complex motions with a very reduced number of functional components. We show that the first synergy alone accounts for the 96% of cost reduction and that three components are able to achieve a satisfactory motion reconstruction in all the considered cases.

CONCLUSIONS

In this work we moved from the analysis of human movements via fPCA characterization to the design of a novel human-like motion generation algorithm able to generate, efficiently and with a reduced set of basis elements, several complex movements in free space, both in free motion and in case of obstacle avoidance tasks.

Liquid metal droplet solves maze

A room temperature liquid metal features a melting point around room temperature. We use liquid metal gallium due to its non-toxicity. A physical maze is a connected set of Euclidean domains separated by impassable walls. We demonstrate that a maze filled with sodium hydroxide solution is solved by a gallium droplet when direct current is applied between start and destination loci. During the maze solving the droplet stays compact due to its large surface tension, navigates along lines of the highest electrical current density due its high electrical conductivity, and goes around corners of the maze's corridors due to its high conformability. The droplet maze solver has a long life-time due to the negligible vapour tension of liquid gallium and its corrosion resistance and its operation enables computational schemes based on liquid state devices.

ITC: Infused Tangential Curves for Smooth 2D and 3D Navigation of Mobile Robots †

Navigation is an indispensable component of ground and aerial mobile robots. Although there is a plethora of path planning algorithms, most of them generate paths that are not smooth and have angular turns. In many cases, it is not feasible for the robots to execute these sharp turns, and a smooth trajectory is desired. We present 'ITC: Infused Tangential Curves' which can generate smooth trajectories for mobile robots. The main characteristics of the proposed ITC algorithm are: (1) The curves are tangential to the path, thus maintaining G 1 continuity, (2) The curves are infused in the original global path to smooth out the turns, (3) The straight segments of the global path are kept straight and only the sharp turns are smoothed, (4) Safety is embedded in the ITC trajectories and robots are guaranteed to maintain a safe distance from the obstacles, (5) The curvature of ITC curves can easily be controlled and smooth trajectories can be generated in real-time, (6) The ITC algorithm smooths the global path on a part-by-part basis thus local smoothing at one point does not affect the global path. We compare the proposed ITC algorithm with traditional interpolation based trajectory smoothing algorithms. Results show that, in case of mobile navigation in narrow corridors, ITC paths maintain a safe distance from both walls, and are easy to generate in real-time. We test the algorithm in complex scenarios to generate curves of different curvatures, while maintaining different safety thresholds from obstacles in vicinity. We mathematically discuss smooth trajectory generation for both 2D navigation of ground robots, and 3D navigation of aerial robots. We also test the algorithm in real environments with actual robots in a complex scenario of multi-robot collision avoidance. Results show that the ITC algorithm can be generated quickly and is suitable for real-world scenarios of collision avoidance in narrow corridors.

Optimum Velocity Profile of Multiple Bernstein-Bézier Curves Subject to Constraints for Mobile Robots

This article deals with trajectory planning that is suitable for nonholonomic differentially driven wheeled mobile robots. The path is approximated with a spline that consists of multiple Bernstein-Bézier curves that are merged together in a way that continuous curvature of the spline is achieved. The article presents the approach for optimization of velocity profile of Bernstein-Bézier spline subject to velocity and acceleration constraints. For the purpose of optimization, velocity and turning points are introduced. Based on these singularity points, local segments are defined where local velocity profiles are optimized independently of each other. From the locally optimum velocity profiles, the global optimum velocity profile is determined. Since each local velocity profile can be evaluated independently, the algorithm is suitable for concurrent implementation and modification of one part of the curve does not require recalculation of all local velocity profiles. These properties enable efficient implementation of the optimization algorithm. The optimization algorithm is also suitable for the splines that consist of Bernstein-Bézier curves that have substantially different lengths. The proposed optimization approach was experimentally evaluated and validated in simulation environment and on real mobile robots.

Symbiotic Navigation in Multi-Robot Systems with Remote Obstacle Knowledge Sharing

Large scale operational areas often require multiple service robots for coverage and task parallelism. In such scenarios, each robot keeps its individual map of the environment and serves specific areas of the map at different times. We propose a knowledge sharing mechanism for multiple robots in which one robot can inform other robots about the changes in map, like path blockage, or new static obstacles, encountered at specific areas of the map. This symbiotic information sharing allows the robots to update remote areas of the map without having to explicitly navigate those areas, and plan efficient paths. A node representation of paths is presented for seamless sharing of blocked path information. The transience of obstacles is modeled to track obstacles which might have been removed. A lazy information update scheme is presented in which only relevant information affecting the current task is updated for efficiency. The advantages of the proposed method for path planning are discussed against traditional method with experimental results in both simulation and real environments.

On the Relationship between Classical Grid Search and Probabilistic Roadmaps

We present, implement, and analyze a spectrum of closely-related planners, designed to gain insight into the relationship between classical grid search and probabilistic roadmaps (PRMs). Building on the quasi-Monte Carlo sampling literature, we have developed deterministic variants of the PRM that use low-discrepancy and low-dispersion samples, including lattices. Classical grid search is extended using subsampling for collision detection and also the dispersion-optimal Sukharev grid, which can be considered as a kind of lattice-based roadmap to complete the spectrum. Our experimental results show that the deterministic variants of the PRM offer performance advantages in comparison to the original, multiple-query PRM and the single-query, lazy PRM. Surprisingly, even some forms of grid search yield performance that is comparable to the original PRM. Our theoretical analysis shows that all of our deterministic PRM variants are resolution complete and achieve the best possible asymptotic convergence rate, which is shown to be superior to that obtained by random sampling. Thus, in surprising contrast to recent trends, there is both experimental and theoretical evidence that the randomization used in the original PRM is not advantageous.

SHP: Smooth Hypocycloidal Paths with Collision-Free and Decoupled Multi-Robot Path Planning

Generating smooth and continuous paths for robots with collision avoidance, which avoid sharp turns, is an important problem in the context of autonomous robot navigation. This paper presents novel smooth hypocycloidal paths (SHP) for robot motion. It is integrated with collision-free and decoupled multi-robot path planning. An SHP diffuses (i.e., moves points along segments) the points of sharp turns in the global path of the map into nodes, which are used to generate smooth hypocycloidal curves that maintain a safe clearance in relation to the obstacles. These nodes are also used as safe points of retreat to avoid collision with other robots. The novel contributions of this work are as follows: (1) The proposed work is the first use of hypocycloid geometry to produce smooth and continuous paths for robot motion. A mathematical analysis of SHP generation in various scenarios is discussed. (2) The proposed work is also the first to consider the case of smooth and collision-free path generation for a load carrying robot. (3) Traditionally, path smoothing and collision avoidance have been addressed as separate problems. This work proposes integrated and decoupled collision-free multi-robot path planning. ‵Node caching‵ is proposed to improve efficiency. A decoupled approach with local communication enables the paths of robots to be dynamically changed. (4) A novel ‵multi-robot map update‵ in case of dynamic obstacles in the map is proposed, such that robots update other robots about the positions of dynamic obstacles in the map. A timestamp feature ensures that all the robots have the most updated map. Comparison between SHP and other path smoothing techniques and experimental results in real environments confirm that SHP can generate smooth paths for robots and avoid collision with other robots through local communication.

Curvature-Continuous 3D Path-Planning Using QPMI Method

It is impossible to achieve vertex movement and rapid velocity control in aerial robots and aerial vehicles because of momentum from the air. A continuous-curvature path ensures such robots and vehicles can fly with stable and continuous movements. General continuous path-planning methods use spline interpolation, for example B-spline and Bézier curves. However, these methods cannot be directly applied to continuous path planning in a 3D space. These methods use a subset of the waypoints to decide curvature and some waypoints are not included in the planned path. This paper proposes a method for constructing a curvature-continuous path in 3D space that includes every waypoint. The movements in each axis, x, y and z, are separated by the parameter u. Waypoint groups are formed, each with its own continuous path derived using quadratic polynomial interpolation. The membership function then combines each continuous path into one continuous path. The continuity of the path is verified and the curvature-continuous path is produced using the proposed method.

Dynamic Modeling and Nonlinear Position Control of a Quadruped Robot with Theo Jansen Linkage Mechanisms and a Single Actuator

The Theo Jansen mechanism is gaining widespread popularity among the legged robotics community due to its scalable design, energy efficiency, low payload-to-machine-load ratio, bioinspired locomotion, and deterministic foot trajectory. In this paper, we perform for the first time the dynamic modeling and analysis on a four-legged robot driven by a single actuator and composed of Theo Jansen mechanisms. The projection method is applied to derive the equations of motion of this complex mechanical system and a position control strategy based on energy is proposed. Numerical simulations validate the efficacy of the designed controller, thus setting a theoretical basis for further investigations on Theo Jansen based quadruped robots.

An Energy-Driven Motion Planning Method for Two Distant Postures

In this paper, we present a local motion planning algorithm for character animation. We focus on motion planning between two distant postures where linear interpolation leads to penetrations. Our framework has two stages. The motion planning problem is first solved as a Boundary Value Problem (BVP) on an energy graph which encodes penetrations, motion smoothness and user control. Having established a mapping from the configuration space to the energy graph, a fast and robust local motion planning algorithm is introduced to solve the BVP to generate motions that could only previously be computed by global planning methods. In the second stage, a projection of the solution motion onto a constraint manifold is proposed for more user control. Our method can be integrated into current keyframing techniques. It also has potential applications in motion planning problems in robotics.

Sparse roadmap spanners for asymptotically near-optimal motion planning

Asymptotically optimal planners, such as PRM*, guarantee that solutions approach optimal as the number of iterations increases. Roadmaps with this property, however, may grow too large for storing on resource-constrained robots and for achieving efficient online query resolution. By relaxing optimality, asymptotically near-optimal planners produce sparser graphs by not including all edges. The idea stems from graph spanners, which produce sparse subgraphs that guarantee near-optimality. Existing asymptotically optimal and near-optimal planners, however, include all sampled configurations as roadmap nodes, meaning only infinite-size graphs have the desired properties. To address this limitation, this work describes SPARS, an algorithm that returns a sparse roadmap spanner. The method provides the following properties: (a) probabilistic completeness, (b) asymptotic near-optimality and (c) the probability of adding nodes to the spanner converges to zero as iterations increase. The last point suggests that finite-size data structures with asymptotic near-optimality in continuous spaces may indeed exist. The approach builds simultaneously a dense graph similar to PRM* and its roadmap spanner, meaning that upon construction an infinite-size graph is still needed asymptotically. An extension of SPARS is also presented, termed SPARS2, which removes the dependency on building a dense graph for constructing the sparse roadmap spanner and for which it is shown that the same desirable properties hold. Simulations for rigid-body motion planning show that algorithms for constructing sparse roadmap spanners indeed provide small data structures and result in faster query resolution. The rate of node addition is shown to decrease over time and practically the quality of solutions is considerably better than the theoretical bounds. Upon construction, the memory requirements of SPARS2 are significantly smaller but there is a small sacrifice in the size of the final spanner relative to SPARS.

A G2 Continuous Path-smoothing Algorithm Using Modified Quadratic Polynomial Interpolation

Path searching algorithm is one of the main topics in studies on path planning. These algorithms are used to avoiding obstacles and find paths from starting point to target point. There are dynamic problems that must be addressed when these paths are applied in real environments. In order to be applicable in actual situations, the path must be a smooth path. A smooth path is a path that maintains continuity. Continuity is decided by the differential values of the path. In order to be G2 continuous, the secondary differential values of the path must be connected throughout the path. In this paper, the interpolation method is used to construct continuous paths. The quadratic polynomial interpolation is a simple method for obtaining continuous paths about three points. The proposed algorithm makes a connection of three points with curves and the proposed path is rotated using the parametric method in order to make the path optimal and smooth. The polynomials expand to the next three points and they merge into the entire path using the membership functions with G2 continuity.

Support Vector Machine Based Mobile Robot Motion Control and Obstacle Avoidance

Considering the noise effect during the navigation of a two wheeled mobile robot, SVM and LS-SVM based control schemes are discussed under the measured information with uncertainty, and in the different environments. The noise effect is defined as uncertainty in the measured data. One of them focuses on using a potential function and constructing a plane surface for avoiding the local minima in the static environments, where the controller is based on Lyapunov function candidate. Another one addresses to use a potential function and to define a new detouring virtual force for escaping from the local minima in the dynamic environments. Stability of the control system can be guaranteed. However, the motion control of the mobile robot would be affected by the noise effect. The SVM and LS-SVM for function estimation are used for estimating the parameter in the proposed controllers. With the estimated parameter, the noise effect during the navigation of the mobile robot can be reduced.

Heuristic path planning of unmanned aerial vehicle formations

Purpose

The purpose of this research is to propose a novel method to plan paths of unmanned aerial vehicle (UAV) formations. This is to make use of the aerodynamic advantage of formation flight to reduce energy consumption of UAVs.

Design/methodology/approach

The method proposed in this research make use of the fact that, under certain conditions, the regions where if a UAV rendezvous or separates with another UAV would save energy by formation flying can be analytically calculated. The intersections of these regions are used to decide which UAV are to fly in the same formation. This combination of which UAV are to fly together and what order they join/part from the formation is called the topology of the problem.

Findings

The proposed method was proved to be effective in identifying efficient topologies, with the majority of the topologies selected falling below 5 percent error rate in terms of energy.

Originality/value

The originality of this research lies in the fact that the proposed method is completely visualised – all the necessary information to organise formations is visualised in the envelopes. Still, the proposed method was proved to be effective in selecting efficient topologies.

RRT*-SMART: A Rapid Convergence Implementation of RRT*

Many sampling based algorithms have been introduced recently. Among them Rapidly Exploring Random Tree (RRT) is one of the quickest and the most efficient obstacle free path finding algorithm. Although it ensures probabilistic completeness, it cannot guarantee finding the most optimal path. Rapidly Exploring Random Tree Star (RRT*), a recently proposed extension of RRT, claims to achieve convergence towards the optimal solution thus ensuring asymptotic optimality along with probabilistic completeness. However, it has been proven to take an infinite time to do so and with a slow convergence rate. In this paper an extension of RRT*, called as RRT*-Smart, has been prposed to overcome the limitaions of RRT*. The goal of the proposecd method is to accelerate the rate of convergence, in order to reach an optimum or near optimum solution at a much faster rate, thus reducing the execution time. The novel approach of the proposed algorithm makes use of two new techniques in RRT*–Path Optimization and Intelligent Sampling. Simulation results presented in various obstacle cluttered environments along with statistical and mathematical analysis confirm the efficiency of the proposed RRT*-Smart algorithm.

Service-oriented dynamic data driven application systems to urban traffic management in resource-bounded environment

With advance in distributed system technology, data has become ubiquitous and its dynamics has increased. Therefore, in this paper we proposed a new framework to integrate dynamic data driven application systems (DDDAS) with service-oriented architecture (SOA) and web services technology to tackle dynamic data issue in a real-time and resource-bounded environment. Nowadays, traffic management in Intelligent Transportation Systems (ITS) has been widely developed in major cities' urban areas around the world to provide more efficient way for solving traffic congestion problem. However, the problems in dynamic traffic management systems such as system flexibility, data standard common interface, transmission of required information, prediction performance, and real-time measurement data are all important issues but not totally supported. An efficient and effective service-oriented dynamic data-driven framework algorithm is designed in this paper to support prediction strategies for traffic management. The simulation results of vehicle navigation show that our algorithm outperforms the Dijkstra algorithm by improving 24.43% in average vehicle travelling time. On the other hand, the results of traffic signal control also show that our algorithm improves the performance in vehicles average number of stops by 43.7%, and 70.62% in average delay time that is compared with the fixed time control method.

Local Path Planning for an Unmanned Ground Vehicle Based on SVM

To resolve the local path generating problem for unmanned ground vehicles (UGV) in unstructured environments, a method combining a basic path subdivision method for topological maps of local environments and a Support Vector Machine (SVM) is proposed in this paper. Based on the basic path subdivision method, topological maps of local environments can be extracted with little expanded nodes, without the constraints of obstacle representation, so meeting the need for autonomous navigation in unstructured environments. Next, to optimize the candidate routes in topological maps and generate a smoother path, an SVM is introduced. The candidate routes boundary points are defined as positive and negative samples, and SVMs are employed to train the separating surface. An original SVM is extended to satisfy extra constraints such as vehicle position and heading constraints. Experimental results show the effectiveness and advantages of the proposed method.