55,545 research outputs found
Multi-objective trajectory optimization of Space Maneuver Vehicle using adaptive differential evolution and modified game theory
Highly constrained trajectory optimization for Space Manoeuvre Vehicles (SMV) is a challenging problem. In practice, this problem becomes more difficult when multiple mission requirements are taken into account. Because of the nonlinearity in the dynamic model and even the objectives, it is usually hard for designers to generate a compromised trajectory without violating strict path and box constraints. In this paper, a new multi-objective SMV optimal control model is formulated and parameterized using combined shooting-collocation technique. A modified game theory approach, coupled with an adaptive differential evolution algorithm, is designed in order to generate the pareto front of the multi-objective trajectory optimization problem. In addition, to improve the quality of obtained solutions, a control logic is embedded in the framework of the proposed approach. Several existing multi-objective evolutionary algorithms are studied and compared with the proposed method. Simulation results indicate that without driving the solution out of the feasible region, the proposed method can perform better in terms of convergence ability and convergence speed than its counterparts. Moreover, the quality of the pareto set generated using the proposed method is higher than other multi-objective evolutionary algorithms, which means the newly proposed algorithm is more attractive for solving multi-criteria SMV trajectory planning problem
Multi-criteria Evolution of Neural Network Topologies: Balancing Experience and Performance in Autonomous Systems
Majority of Artificial Neural Network (ANN) implementations in autonomous
systems use a fixed/user-prescribed network topology, leading to sub-optimal
performance and low portability. The existing neuro-evolution of augmenting
topology or NEAT paradigm offers a powerful alternative by allowing the network
topology and the connection weights to be simultaneously optimized through an
evolutionary process. However, most NEAT implementations allow the
consideration of only a single objective. There also persists the question of
how to tractably introduce topological diversification that mitigates
overfitting to training scenarios. To address these gaps, this paper develops a
multi-objective neuro-evolution algorithm. While adopting the basic elements of
NEAT, important modifications are made to the selection, speciation, and
mutation processes. With the backdrop of small-robot path-planning
applications, an experience-gain criterion is derived to encapsulate the amount
of diverse local environment encountered by the system. This criterion
facilitates the evolution of genes that support exploration, thereby seeking to
generalize from a smaller set of mission scenarios than possible with
performance maximization alone. The effectiveness of the single-objective
(optimizing performance) and the multi-objective (optimizing performance and
experience-gain) neuro-evolution approaches are evaluated on two different
small-robot cases, with ANNs obtained by the multi-objective optimization
observed to provide superior performance in unseen scenarios
An evolutionary algorithm for online, resource constrained, multi-vehicle sensing mission planning
Mobile robotic platforms are an indispensable tool for various scientific and
industrial applications. Robots are used to undertake missions whose execution
is constrained by various factors, such as the allocated time or their
remaining energy. Existing solutions for resource constrained multi-robot
sensing mission planning provide optimal plans at a prohibitive computational
complexity for online application [1],[2],[3]. A heuristic approach exists for
an online, resource constrained sensing mission planning for a single vehicle
[4]. This work proposes a Genetic Algorithm (GA) based heuristic for the
Correlated Team Orienteering Problem (CTOP) that is used for planning sensing
and monitoring missions for robotic teams that operate under resource
constraints. The heuristic is compared against optimal Mixed Integer Quadratic
Programming (MIQP) solutions. Results show that the quality of the heuristic
solution is at the worst case equal to the 5% optimal solution. The heuristic
solution proves to be at least 300 times more time efficient in the worst
tested case. The GA heuristic execution required in the worst case less than a
second making it suitable for online execution.Comment: 8 pages, 5 figures, accepted for publication in Robotics and
Automation Letters (RA-L
A Hierarchal Planning Framework for AUV Mission Management in a Spatio-Temporal Varying Ocean
The purpose of this paper is to provide a hierarchical dynamic mission
planning framework for a single autonomous underwater vehicle (AUV) to
accomplish task-assign process in a limited time interval while operating in an
uncertain undersea environment, where spatio-temporal variability of the
operating field is taken into account. To this end, a high level reactive
mission planner and a low level motion planning system are constructed. The
high level system is responsible for task priority assignment and guiding the
vehicle toward a target of interest considering on-time termination of the
mission. The lower layer is in charge of generating optimal trajectories based
on sequence of tasks and dynamicity of operating terrain. The mission planner
is able to reactively re-arrange the tasks based on mission/terrain updates
while the low level planner is capable of coping unexpected changes of the
terrain by correcting the old path and re-generating a new trajectory. As a
result, the vehicle is able to undertake the maximum number of tasks with
certain degree of maneuverability having situational awareness of the operating
field. The computational engine of the mentioned framework is based on the
biogeography based optimization (BBO) algorithm that is capable of providing
efficient solutions. To evaluate the performance of the proposed framework,
firstly, a realistic model of undersea environment is provided based on
realistic map data, and then several scenarios, treated as real experiments,
are designed through the simulation study. Additionally, to show the robustness
and reliability of the framework, Monte-Carlo simulation is carried out and
statistical analysis is performed. The results of simulations indicate the
significant potential of the two-level hierarchical mission planning system in
mission success and its applicability for real-time implementation
All Sky Survey Mission Observing Scenario Strategy
This paper develops a general observing strategy for missions performing
all-sky surveys, where a single spacecraft maps the celestial sphere subject to
realistic constraints. The strategy is flexible such that targeted observations
and variable coverage requirements can be achieved. This paper focuses on
missions operating in Low Earth Orbit, where the thermal and stray-light
constraints due to the Sun, Earth, and Moon result in interacting and dynamic
constraints. The approach is applicable to broader mission classes, such as
those that operate in different orbits or that survey the Earth. First, the
instrument and spacecraft configuration is optimized to enable visibility of
the targeted observations throughout the year. Second, a constraint-based
high-level strategy is presented for scheduling throughout the year subject to
a simplified subset of the constraints. Third, a heuristic-based scheduling
algorithm is developed to assign the all-sky observations over short planning
horizons. The constraint-based approach guarantees solution feasibility. The
approach is applied to the proposed SPHEREx mission, which includes coverage of
the North and South Celestial Poles, Galactic plane, and a uniform coverage
all-sky survey, and the ability to achieve science requirements demonstrated
and visualized. Visualizations demonstrate the how the all-sky survey achieves
its objectives
- …