Optimal Lunar Landing Trajectory Design for Hybrid Engine

Directory of Open Access Journals (Sweden)

Dong-Hyun Cho

2015-01-01

Full Text Available The lunar landing stage is usually divided into two parts: deorbit burn and powered descent phases. The optimal lunar landing problem is likely to be transformed to the trajectory design problem on the powered descent phase by using continuous thrusters. The optimal lunar landing trajectories in general have variety in shape, and the lunar lander frequently increases its altitude at the initial time to obtain enough time to reduce the horizontal velocity. Due to the increment in the altitude, the lunar lander requires more fuel for lunar landing missions. In this work, a hybrid engine for the lunar landing mission is introduced, and an optimal lunar landing strategy for the hybrid engine is suggested. For this approach, it is assumed that the lunar lander retrofired the impulsive thruster to reduce the horizontal velocity rapidly at the initiated time on the powered descent phase. Then, the lunar lander reduced the total velocity and altitude for the lunar landing by using the continuous thruster. In contradistinction to other formal optimal lunar landing problems, the initial horizontal velocity and mass are not fixed at the start time. The initial free optimal control theory is applied, and the optimal initial value and lunar landing trajectory are obtained by simulation studies.

Optimal Lunar Landing Trajectory Design for Hybrid Engine

OpenAIRE

Cho, Dong-Hyun; Kim, Donghoon; Leeghim, Henzeh

2015-01-01

The lunar landing stage is usually divided into two parts: deorbit burn and powered descent phases. The optimal lunar landing problem is likely to be transformed to the trajectory design problem on the powered descent phase by using continuous thrusters. The optimal lunar landing trajectories in general have variety in shape, and the lunar lander frequently increases its altitude at the initial time to obtain enough time to reduce the horizontal velocity. Due to the increment in the altitude,...

Computational Approaches to Simulation and Optimization of Global Aircraft Trajectories

Science.gov (United States)

Ng, Hok Kwan; Sridhar, Banavar

2016-01-01

This study examines three possible approaches to improving the speed in generating wind-optimal routes for air traffic at the national or global level. They are: (a) using the resources of a supercomputer, (b) running the computations on multiple commercially available computers and (c) implementing those same algorithms into NASAs Future ATM Concepts Evaluation Tool (FACET) and compares those to a standard implementation run on a single CPU. Wind-optimal aircraft trajectories are computed using global air traffic schedules. The run time and wait time on the supercomputer for trajectory optimization using various numbers of CPUs ranging from 80 to 10,240 units are compared with the total computational time for running the same computation on a single desktop computer and on multiple commercially available computers for potential computational enhancement through parallel processing on the computer clusters. This study also re-implements the trajectory optimization algorithm for further reduction of computational time through algorithm modifications and integrates that with FACET to facilitate the use of the new features which calculate time-optimal routes between worldwide airport pairs in a wind field for use with existing FACET applications. The implementations of trajectory optimization algorithms use MATLAB, Python, and Java programming languages. The performance evaluations are done by comparing their computational efficiencies and based on the potential application of optimized trajectories. The paper shows that in the absence of special privileges on a supercomputer, a cluster of commercially available computers provides a feasible approach for national and global air traffic system studies.

Receding Horizon Trajectory Optimization with Terminal Impact Specifications

Directory of Open Access Journals (Sweden)

Limin Zhang

2014-01-01

Full Text Available The trajectory optimization problem subject to terminal impact time and angle specifications can be reformulated as a nonlinear programming problem using the Gauss pseudospectral method. The cost function of the trajectory optimization problem is modified to reduce the terminal control energy. A receding horizon optimization strategy is implemented to reject the errors caused by the motion of a surface target. Several simulations were performed to validate the proposed method via the C programming language. The simulation results demonstrate the effectiveness of the proposed algorithm and that the real-time requirement can be easily achieved if the C programming language is used to realize it.

Trajectory Optimization Based on Multi-Interval Mesh Refinement Method

Directory of Open Access Journals (Sweden)

Ningbo Li

2017-01-01

Full Text Available In order to improve the optimization accuracy and convergence rate for trajectory optimization of the air-to-air missile, a multi-interval mesh refinement Radau pseudospectral method was introduced. This method made the mesh endpoints converge to the practical nonsmooth points and decreased the overall collocation points to improve convergence rate and computational efficiency. The trajectory was divided into four phases according to the working time of engine and handover of midcourse and terminal guidance, and then the optimization model was built. The multi-interval mesh refinement Radau pseudospectral method with different collocation points in each mesh interval was used to solve the trajectory optimization model. Moreover, this method was compared with traditional h method. Simulation results show that this method can decrease the dimensionality of nonlinear programming (NLP problem and therefore improve the efficiency of pseudospectral methods for solving trajectory optimization problems.

Parallel Aircraft Trajectory Optimization with Analytic Derivatives

Science.gov (United States)

Falck, Robert D.; Gray, Justin S.; Naylor, Bret

2016-01-01

Trajectory optimization is an integral component for the design of aerospace vehicles, but emerging aircraft technologies have introduced new demands on trajectory analysis that current tools are not well suited to address. Designing aircraft with technologies such as hybrid electric propulsion and morphing wings requires consideration of the operational behavior as well as the physical design characteristics of the aircraft. The addition of operational variables can dramatically increase the number of design variables which motivates the use of gradient based optimization with analytic derivatives to solve the larger optimization problems. In this work we develop an aircraft trajectory analysis tool using a Legendre-Gauss-Lobatto based collocation scheme, providing analytic derivatives via the OpenMDAO multidisciplinary optimization framework. This collocation method uses an implicit time integration scheme that provides a high degree of sparsity and thus several potential options for parallelization. The performance of the new implementation was investigated via a series of single and multi-trajectory optimizations using a combination of parallel computing and constraint aggregation. The computational performance results show that in order to take full advantage of the sparsity in the problem it is vital to parallelize both the non-linear analysis evaluations and the derivative computations themselves. The constraint aggregation results showed a significant numerical challenge due to difficulty in achieving tight convergence tolerances. Overall, the results demonstrate the value of applying analytic derivatives to trajectory optimization problems and lay the foundation for future application of this collocation based method to the design of aircraft with where operational scheduling of technologies is key to achieving good performance.

A Time-Regularized, Multiple Gravity-Assist Low-Thrust, Bounded-Impulse Model for Trajectory Optimization

Science.gov (United States)

Ellison, Donald H.; Englander, Jacob A.; Conway, Bruce A.

2017-01-01

The multiple gravity assist low-thrust (MGALT) trajectory model combines the medium-fidelity Sims-Flanagan bounded-impulse transcription with a patched-conics flyby model and is an important tool for preliminary trajectory design. While this model features fast state propagation via Keplers equation and provides a pleasingly accurate estimation of the total mass budget for the eventual flight suitable integrated trajectory it does suffer from one major drawback, namely its temporal spacing of the control nodes. We introduce a variant of the MGALT transcription that utilizes the generalized anomaly from the universal formulation of Keplers equation as a decision variable in addition to the trajectory phase propagation time. This results in two improvements over the traditional model. The first is that the maneuver locations are equally spaced in generalized anomaly about the orbit rather than time. The second is that the Kepler propagator now has the generalized anomaly as its independent variable instead of time and thus becomes an iteration-free propagation method. The new algorithm is outlined, including the impact that this has on the computation of Jacobian entries for numerical optimization, and a motivating application problem is presented that illustrates the improvements that this model has over the traditional MGALT transcription.

Trajectory optimization of multiple quad-rotor UAVs in collaborative assembling task

Directory of Open Access Journals (Sweden)

Chen Yongbo

2016-02-01

Full Text Available A hierarchic optimization strategy based on the offline path planning process and online trajectory planning process is presented to solve the trajectory optimization problem of multiple quad-rotor unmanned aerial vehicles in the collaborative assembling task. Firstly, the path planning process is solved by a novel parallel intelligent optimization algorithm, the central force optimization-genetic algorithm (CFO-GA, which combines the central force optimization (CFO algorithm with the genetic algorithm (GA. Because of the immaturity of the CFO, the convergence analysis of the CFO is completed by the stability theory of the linear time-variant discrete-time systems. The results show that the parallel CFO-GA algorithm converges faster than the parallel CFO and the central force optimization-sequential quadratic programming (CFO-SQP algorithm. Then, the trajectory planning problem is established based on the path planning results. In order to limit the range of the attitude angle and guarantee the flight stability, the optimized object is changed from the ordinary six-degree-of-freedom rigid-body dynamic model to the dynamic model with an inner-loop attitude controller. The results show that the trajectory planning process can be solved by the mature SQP algorithm easily. Finally, the discussion and analysis of the real-time performance of the hierarchic optimization strategy are presented around the group number of the waypoints and the equal interval time.

Parameterization of Fuel-Optimal Synchronous Approach Trajectories to Tumbling Targets

Directory of Open Access Journals (Sweden)

David Charles Sternberg

2018-04-01

Full Text Available Docking with potentially tumbling Targets is a common element of many mission architectures, including on-orbit servicing and active debris removal. This paper studies synchronized docking trajectories as a way to ensure the Chaser satellite remains on the docking axis of the tumbling Target, thereby reducing collision risks and enabling persistent onboard sensing of the docking location. Chaser satellites have limited computational power available to them and the time allowed for the determination of a fuel optimal trajectory may be limited. Consequently, parameterized trajectories that approximate the fuel optimal trajectory while following synchronous approaches may be used to provide a computationally efficient means of determining near optimal trajectories to a tumbling Target. This paper presents a method of balancing the computation cost with the added fuel expenditure required for parameterization, including the selection of a parameterization scheme, the number of parameters in the parameterization, and a means of incorporating the dynamics of a tumbling satellite into the parameterization process. Comparisons of the parameterized trajectories are made with the fuel optimal trajectory, which is computed through the numerical propagation of Euler’s equations. Additionally, various tumble types are considered to demonstrate the efficacy of the presented computation scheme. With this parameterized trajectory determination method, Chaser satellites may perform terminal approach and docking maneuvers with both fuel and computational efficiency.

Gravity-Assist Trajectories to the Ice Giants: An Automated Method to Catalog Mass-or Time-Optimal Solutions

Science.gov (United States)

Hughes, Kyle M.; Knittel, Jeremy M.; Englander, Jacob A.

2017-01-01

This work presents an automated method of calculating mass (or time) optimal gravity-assist trajectories without a priori knowledge of the flyby-body combination. Since gravity assists are particularly crucial for reaching the outer Solar System, we use the Ice Giants, Uranus and Neptune, as example destinations for this work. Catalogs are also provided that list the most attractive trajectories found over launch dates ranging from 2024 to 2038. The tool developed to implement this method, called the Python EMTG Automated Trade Study Application (PEATSA), iteratively runs the Evolutionary Mission Trajectory Generator (EMTG), a NASA Goddard Space Flight Center in-house trajectory optimization tool. EMTG finds gravity-assist trajectories with impulsive maneuvers using a multiple-shooting structure along with stochastic methods (such as monotonic basin hopping) and may be run with or without an initial guess provided. PEATSA runs instances of EMTG in parallel over a grid of launch dates. After each set of runs completes, the best results within a neighborhood of launch dates are used to seed all other cases in that neighborhood---allowing the solutions across the range of launch dates to improve over each iteration. The results here are compared against trajectories found using a grid-search technique, and PEATSA is found to outperform the grid-search results for most launch years considered.

Developing a simulation framework for safe and optimal trajectories considering drivers’ driving style

DEFF Research Database (Denmark)

Gruber, Thierry; Larue, Grégoire S.; Rakotonirainy, Andry

2017-01-01

drivers with the optimal trajectory considering the motorist's driving style in real time. Travel duration and safety are the main parameters used to find the optimal trajectory. A simulation framework to determine the optimal trajectory was developed in which the ego car travels in a highway environment......Advanced driving assistance systems (ADAS) have huge potential for improving road safety and travel times. However, their take-up in the market is very slow; and these systems should consider driver's preferences to increase adoption rates. The aim of this study is to develop a model providing...

The time optimal trajectory planning with limitation of operating task for the Tokamak inspecting manipulator

Energy Technology Data Exchange (ETDEWEB)

Wang, Hesheng; Lai, Yinping [Department of Automation,Shanghai Jiao Tong University, Shanghai (China); Key Laboratory of System Control and Information Processing, Ministry of Education of China (China); Chen, Weidong, E-mail: wdchen@sjtu.edu.cn [Department of Automation,Shanghai Jiao Tong University, Shanghai (China); Key Laboratory of System Control and Information Processing, Ministry of Education of China (China)

2016-12-15

In this paper, a new optimization model of time optimal trajectory planning with limitation of operating task for the Tokamak inspecting manipulator is designed. The task of this manipulator is to inspect the components of Tokamak, the inspecting velocity of manipulator must be limited in the operating space in order to get the clear pictures. With the limitation of joint velocity, acceleration and jerk, this optimization model can not only get the minimum working time along a specific path, but also ensure the imaging quality of camera through the constraint of inspecting velocity. The upper bound of the scanning speed is not a constant but changes according to the observation distance of camera in real time. The relation between scanning velocity and observation distance is estimated by curve-fitting. Experiment has been carried out to verify the feasibility of optimization model, moreover, the Laplace image sharpness evaluation method is adopted to evaluate the quality of images obtained by the proposed method.

The time optimal trajectory planning with limitation of operating task for the Tokamak inspecting manipulator

International Nuclear Information System (INIS)

Wang, Hesheng; Lai, Yinping; Chen, Weidong

2016-01-01

In this paper, a new optimization model of time optimal trajectory planning with limitation of operating task for the Tokamak inspecting manipulator is designed. The task of this manipulator is to inspect the components of Tokamak, the inspecting velocity of manipulator must be limited in the operating space in order to get the clear pictures. With the limitation of joint velocity, acceleration and jerk, this optimization model can not only get the minimum working time along a specific path, but also ensure the imaging quality of camera through the constraint of inspecting velocity. The upper bound of the scanning speed is not a constant but changes according to the observation distance of camera in real time. The relation between scanning velocity and observation distance is estimated by curve-fitting. Experiment has been carried out to verify the feasibility of optimization model, moreover, the Laplace image sharpness evaluation method is adopted to evaluate the quality of images obtained by the proposed method.

Numerical optimization of actuator trajectories for ITER hybrid scenario profile evolution

International Nuclear Information System (INIS)

Dongen, J van; Hogeweij, G M D; Felici, F; Geelen, P; Maljaars, E

2014-01-01

Optimal actuator trajectories for an ITER hybrid scenario ramp-up are computed using a numerical optimization method. For both L-mode and H-mode scenarios, the time trajectory of plasma current, EC heating and current drive distribution is determined that minimizes a chosen cost function, while satisfying constraints. The cost function is formulated to reflect two desired properties of the plasma q profile at the end of the ramp-up. The first objective is to maximize the ITG turbulence threshold by maximizing the volume-averaged s/q ratio. The second objective is to achieve a stationary q profile by having a flat loop voltage profile. Actuator and physics-derived constraints are included, imposing limits on plasma current, ramp rates, internal inductance and q profile. This numerical method uses the fast control-oriented plasma profile evolution code RAPTOR, which is successfully benchmarked against more complete CRONOS simulations for L-mode and H-mode mode ITER hybrid scenarios. It is shown that the optimized trajectories computed using RAPTOR also result in an improved ramp-up scenario for CRONOS simulations using the same input trajectories. Furthermore, the optimal trajectories are shown to vary depending on the precise timing of the L–H transition. (paper)

Implementation of optimal trajectory control of series resonant converter

Science.gov (United States)

Oruganti, Ramesh; Yang, James J.; Lee, Fred C.

1987-01-01

Due to the presence of a high-frequency LC tank circuit, the dynamics of a resonant converter are unpredictable. There is often a large surge of tank energy during transients. Using state-plane analysis technique, an optimal trajectory control utilizing the desired solution trajectory as the control law was previously proposed for the series resonant converters. The method predicts the fastest response possible with minimum energy surge in the resonant tank. The principle of the control and its experimental implementation are described here. The dynamics of the converter are shown to be close to time-optimal.

An Expert System-Driven Method for Parametric Trajectory Optimization During Conceptual Design

Science.gov (United States)

Dees, Patrick D.; Zwack, Mathew R.; Steffens, Michael; Edwards, Stephen; Diaz, Manuel J.; Holt, James B.

2015-01-01

During the early phases of engineering design, the costs committed are high, costs incurred are low, and the design freedom is high. It is well documented that decisions made in these early design phases drive the entire design's life cycle cost. In a traditional paradigm, key design decisions are made when little is known about the design. As the design matures, design changes become more difficult in both cost and schedule to enact. The current capability-based paradigm, which has emerged because of the constrained economic environment, calls for the infusion of knowledge usually acquired during later design phases into earlier design phases, i.e. bringing knowledge acquired during preliminary and detailed design into pre-conceptual and conceptual design. An area of critical importance to launch vehicle design is the optimization of its ascent trajectory, as the optimal trajectory will be able to take full advantage of the launch vehicle's capability to deliver a maximum amount of payload into orbit. Hence, the optimal ascent trajectory plays an important role in the vehicle's affordability posture yet little of the information required to successfully optimize a trajectory is known early in the design phase. Thus, the current paradigm of optimizing ascent trajectories involves generating point solutions for every change in a vehicle's design parameters. This is often a very tedious, manual, and time-consuming task for the analysts. Moreover, the trajectory design space is highly non-linear and multi-modal due to the interaction of various constraints. When these obstacles are coupled with the Program to Optimize Simulated Trajectories (POST), an industry standard program to optimize ascent trajectories that is difficult to use, expert trajectory analysts are required to effectively optimize a vehicle's ascent trajectory. Over the course of this paper, the authors discuss a methodology developed at NASA Marshall's Advanced Concepts Office to address these issues

Enabling Parametric Optimal Ascent Trajectory Modeling During Early Phases of Design

Science.gov (United States)

Holt, James B.; Dees, Patrick D.; Diaz, Manuel J.

2015-01-01

During the early phases of engineering design, the costs committed are high, costs incurred are low, and the design freedom is high. It is well documented that decisions made in these early design phases drive the entire design's life cycle. In a traditional paradigm, key design decisions are made when little is known about the design. As the design matures, design changes become more difficult -- in both cost and schedule -- to enact. Indeed, the current capability-based paradigm that has emerged because of the constrained economic environment calls for the infusion of knowledge acquired during later design phases into earlier design phases, i.e. bring knowledge acquired during preliminary and detailed design into pre-conceptual and conceptual design. An area of critical importance to launch vehicle design is the optimization of its ascent trajectory, as the optimal trajectory will be able to take full advantage of the launch vehicle's capability to deliver a maximum amount of payload into orbit. Hence, the optimal ascent trajectory plays an important role in the vehicle's affordability posture as the need for more economically viable access to space solutions are needed in today's constrained economic environment. The problem of ascent trajectory optimization is not a new one. There are several programs that are widely used in industry that allows trajectory analysts to, based on detailed vehicle and insertion orbit parameters, determine the optimal ascent trajectory. Yet, little information is known about the launch vehicle early in the design phase - information that is required of many different disciplines in order to successfully optimize the ascent trajectory. Thus, the current paradigm of optimizing ascent trajectories involves generating point solutions for every change in a vehicle's design parameters. This is often a very tedious, manual, and time-consuming task for the analysts. Moreover, the trajectory design space is highly non-linear and multi

Coupled Low-thrust Trajectory and System Optimization via Multi-Objective Hybrid Optimal Control

Science.gov (United States)

Vavrina, Matthew A.; Englander, Jacob Aldo; Ghosh, Alexander R.

2015-01-01

The optimization of low-thrust trajectories is tightly coupled with the spacecraft hardware. Trading trajectory characteristics with system parameters ton identify viable solutions and determine mission sensitivities across discrete hardware configurations is labor intensive. Local independent optimization runs can sample the design space, but a global exploration that resolves the relationships between the system variables across multiple objectives enables a full mapping of the optimal solution space. A multi-objective, hybrid optimal control algorithm is formulated using a multi-objective genetic algorithm as an outer loop systems optimizer around a global trajectory optimizer. The coupled problem is solved simultaneously to generate Pareto-optimal solutions in a single execution. The automated approach is demonstrated on two boulder return missions.

Displaced Electric Sail Orbits Design and Transition Trajectory Optimization

Directory of Open Access Journals (Sweden)

Naiming Qi

2014-01-01

Full Text Available Displaced orbits for spacecraft propelled by electric sails are investigated as an alternative to the use of solar sails. The orbital dynamics of electric sails based spacecraft are studied within a spherical coordinate system, which permits finding the solutions of displaced electric sail orbits and optimize transfer trajectory. Transfer trajectories from Earth's orbit to displaced orbit are also studied in an optimal framework, by using genetic algorithm and Gauss pseudospectral method. The initial guesses for the state and control histories used in the Gauss pseudospectral method are interpolated from the best solution of a genetic algorithm. Numerical simulations show that the electric sail is able to perform the transfer from Earth’s orbit to displaced orbit in acceptable time, and the hybrid optimization method has the capability to search the feasible and optimal solution without any initial value guess.

Optimal trajectory generation for mechanical arms. M.S. Thesis

Science.gov (United States)

Iemenschot, J. A.

1972-01-01

A general method of generating optimal trajectories between an initial and a final position of an n degree of freedom manipulator arm with nonlinear equations of motion is proposed. The method is based on the assumption that the time history of each of the coordinates can be expanded in a series of simple time functions. By searching over the coefficients of the terms in the expansion, trajectories which minimize the value of a given cost function can be obtained. The method has been applied to a planar three degree of freedom arm.

Optimal Collision Avoidance Trajectories for Unmanned/Remotely Piloted Aircraft

Science.gov (United States)

2014-12-26

collocation method to solve this problem and then analyzes these results for di↵erent collision avoidance scenarios. iv To my beautiful “ Proverbs 31” wife... le ( d e g ) Optimal Control JOCA Baseline 0 10 20 30 40 50 60 0.8 1 1.2 1.4 N z Control time (sec) N z Optimal Control JOCA Baseline (b...Optimal Control JOCA Baseline (a) Trajectory Deviation 0 10 20 30 40 50 60 70 −20 −10 0 10 20 µ Control time (sec) a n g le ( d e g

Optimization of Low-Thrust Spiral Trajectories by Collocation

Science.gov (United States)

Falck, Robert D.; Dankanich, John W.

2012-01-01

As NASA examines potential missions in the post space shuttle era, there has been a renewed interest in low-thrust electric propulsion for both crewed and uncrewed missions. While much progress has been made in the field of software for the optimization of low-thrust trajectories, many of the tools utilize higher-fidelity methods which, while excellent, result in extremely high run-times and poor convergence when dealing with planetocentric spiraling trajectories deep within a gravity well. Conversely, faster tools like SEPSPOT provide a reasonable solution but typically fail to account for other forces such as third-body gravitation, aerodynamic drag, solar radiation pressure. SEPSPOT is further constrained by its solution method, which may require a very good guess to yield a converged optimal solution. Here the authors have developed an approach using collocation intended to provide solution times comparable to those given by SEPSPOT while allowing for greater robustness and extensible force models.

Helicopter trajectory planning using optimal control theory

Science.gov (United States)

Menon, P. K. A.; Cheng, V. H. L.; Kim, E.

1988-01-01

A methodology for optimal trajectory planning, useful in the nap-of-the-earth guidance of helicopters, is presented. This approach uses an adjoint-control transformation along with a one-dimensional search scheme for generating the optimal trajectories. In addition to being useful for helicopter nap-of-the-earth guidance, the trajectory planning solution is of interest in several other contexts, such as robotic vehicle guidance and terrain-following guidance for cruise missiles and aircraft. A distinguishing feature of the present research is that the terrain constraint and the threat envelopes are incorporated in the equations of motion. Second-order necessary conditions are examined.

Augmenting Parametric Optimal Ascent Trajectory Modeling with Graph Theory

Science.gov (United States)

Dees, Patrick D.; Zwack, Matthew R.; Edwards, Stephen; Steffens, Michael

2016-01-01

It has been well documented that decisions made in the early stages of Conceptual and Pre-Conceptual design commit up to 80% of total Life-Cycle Cost (LCC) while engineers know the least about the product they are designing [1]. Once within Preliminary and Detailed design however, making changes to the design becomes far more difficult to enact in both cost and schedule. Primarily this has been due to a lack of detailed data usually uncovered later during the Preliminary and Detailed design phases. In our current budget-constrained environment, making decisions within Conceptual and Pre-Conceptual design which minimize LCC while meeting requirements is paramount to a program's success. Within the arena of launch vehicle design, optimizing the ascent trajectory is critical for minimizing the costs present within such concerns as propellant, aerodynamic, aeroheating, and acceleration loads while meeting requirements such as payload delivered to a desired orbit. In order to optimize the vehicle design its constraints and requirements must be known, however as the design cycle proceeds it is all but inevitable that the conditions will change. Upon that change, the previously optimized trajectory may no longer be optimal, or meet design requirements. The current paradigm for adjusting to these updates is generating point solutions for every change in the design's requirements [2]. This can be a tedious, time-consuming task as changes in virtually any piece of a launch vehicle's design can have a disproportionately large effect on the ascent trajectory, as the solution space of the trajectory optimization problem is both non-linear and multimodal [3]. In addition, an industry standard tool, Program to Optimize Simulated Trajectories (POST), requires an expert analyst to produce simulated trajectories that are feasible and optimal [4]. In a previous publication the authors presented a method for combatting these challenges [5]. In order to bring more detailed information

A Robot Trajectory Optimization Approach for Thermal Barrier Coatings Used for Free-Form Components

Science.gov (United States)

Cai, Zhenhua; Qi, Beichun; Tao, Chongyuan; Luo, Jie; Chen, Yuepeng; Xie, Changjun

2017-10-01

This paper is concerned with a robot trajectory optimization approach for thermal barrier coatings. As the requirements of high reproducibility of complex workpieces increase, an optimal thermal spraying trajectory should not only guarantee an accurate control of spray parameters defined by users (e.g., scanning speed, spray distance, scanning step, etc.) to achieve coating thickness homogeneity but also help to homogenize the heat transfer distribution on the coating surface. A mesh-based trajectory generation approach is introduced in this work to generate path curves on a free-form component. Then, two types of meander trajectories are generated by performing a different connection method. Additionally, this paper presents a research approach for introducing the heat transfer analysis into the trajectory planning process. Combining heat transfer analysis with trajectory planning overcomes the defects of traditional trajectory planning methods (e.g., local over-heating), which helps form the uniform temperature field by optimizing the time sequence of path curves. The influence of two different robot trajectories on the process of heat transfer is estimated by coupled FEM models which demonstrates the effectiveness of the presented optimization approach.

Optimization approaches for robot trajectory planning

Directory of Open Access Journals (Sweden)

Carlos Llopis-Albert

2018-03-01

Full Text Available The development of optimal trajectory planning algorithms for autonomous robots is a key issue in order to efficiently perform the robot tasks. This problem is hampered by the complex environment regarding the kinematics and dynamics of robots with several arms and/or degrees of freedom (dof, the design of collision-free trajectories and the physical limitations of the robots. This paper presents a review about the existing robot motion planning techniques and discusses their pros and cons regarding completeness, optimality, efficiency, accuracy, smoothness, stability, safety and scalability.

Simulation-Based Early Prediction of Rocket, Artillery, and Mortar Trajectories and Real-Time Optimization for Counter-RAM Systems

Directory of Open Access Journals (Sweden)

Arash Ramezani

2017-01-01

Full Text Available The threat imposed by terrorist attacks is a major hazard for military installations, for example, in Iraq and Afghanistan. The large amounts of rockets, artillery projectiles, and mortar grenades (RAM that are available pose serious threats to military forces. An important task for international research and development is to protect military installations and implement an accurate early warning system against RAM threats on conventional computer systems in out-of-area field camps. This work presents a method for determining the trajectory, caliber, and type of a projectile based on the estimation of the ballistic coefficient. A simulation-based optimization process is presented that enables iterative adjustment of predicted trajectories in real time. Analytical and numerical methods are used to reduce computing time for out-of-area missions and low-end computer systems. A GUI is programmed to present the results. It allows for comparison between predicted and actual trajectories. Finally, different aspects and restrictions for measuring the quality of the results are discussed.

Multi-Objective Trajectory Optimization of a Hypersonic Reconnaissance Vehicle with Temperature Constraints

Science.gov (United States)

Masternak, Tadeusz J.

This research determines temperature-constrained optimal trajectories for a scramjet-based hypersonic reconnaissance vehicle by developing an optimal control formulation and solving it using a variable order Gauss-Radau quadrature collocation method with a Non-Linear Programming (NLP) solver. The vehicle is assumed to be an air-breathing reconnaissance aircraft that has specified takeoff/landing locations, airborne refueling constraints, specified no-fly zones, and specified targets for sensor data collections. A three degree of freedom scramjet aircraft model is adapted from previous work and includes flight dynamics, aerodynamics, and thermal constraints. Vehicle control is accomplished by controlling angle of attack, roll angle, and propellant mass flow rate. This model is incorporated into an optimal control formulation that includes constraints on both the vehicle and mission parameters, such as avoidance of no-fly zones and coverage of high-value targets. To solve the optimal control formulation, a MATLAB-based package called General Pseudospectral Optimal Control Software (GPOPS-II) is used, which transcribes continuous time optimal control problems into an NLP problem. In addition, since a mission profile can have varying vehicle dynamics and en-route imposed constraints, the optimal control problem formulation can be broken up into several "phases" with differing dynamics and/or varying initial/final constraints. Optimal trajectories are developed using several different performance costs in the optimal control formulation: minimum time, minimum time with control penalties, and maximum range. The resulting analysis demonstrates that optimal trajectories that meet specified mission parameters and constraints can be quickly determined and used for larger-scale operational and campaign planning and execution.

Exploring the complexity of quantum control optimization trajectories.

Science.gov (United States)

Nanduri, Arun; Shir, Ofer M; Donovan, Ashley; Ho, Tak-San; Rabitz, Herschel

2015-01-07

The control of quantum system dynamics is generally performed by seeking a suitable applied field. The physical objective as a functional of the field forms the quantum control landscape, whose topology, under certain conditions, has been shown to contain no critical point suboptimal traps, thereby enabling effective searches for fields that give the global maximum of the objective. This paper addresses the structure of the landscape as a complement to topological critical point features. Recent work showed that landscape structure is highly favorable for optimization of state-to-state transition probabilities, in that gradient-based control trajectories to the global maximum value are nearly straight paths. The landscape structure is codified in the metric R ≥ 1.0, defined as the ratio of the length of the control trajectory to the Euclidean distance between the initial and optimal controls. A value of R = 1 would indicate an exactly straight trajectory to the optimal observable value. This paper extends the state-to-state transition probability results to the quantum ensemble and unitary transformation control landscapes. Again, nearly straight trajectories predominate, and we demonstrate that R can take values approaching 1.0 with high precision. However, the interplay of optimization trajectories with critical saddle submanifolds is found to influence landscape structure. A fundamental relationship necessary for perfectly straight gradient-based control trajectories is derived, wherein the gradient on the quantum control landscape must be an eigenfunction of the Hessian. This relation is an indicator of landscape structure and may provide a means to identify physical conditions when control trajectories can achieve perfect linearity. The collective favorable landscape topology and structure provide a foundation to understand why optimal quantum control can be readily achieved.

Optimal trajectory planning and train scheduling for urban rail transit systems

CERN Document Server

Wang, Yihui; van den Boom, Ton; De Schutter, Bart

2016-01-01

This book contributes to making urban rail transport fast, punctual and energy-efficient –significant factors in the importance of public transportation systems to economic, environmental and social requirements at both municipal and national levels. It proposes new methods for shortening passenger travel times and for reducing energy consumption, addressing two major topics: (1) train trajectory planning: the authors derive a nonlinear model for the operation of trains and present several approaches for calculating optimal and energy-efficient trajectories within a given schedule; and (2) train scheduling: the authors develop a train scheduling model for urban rail systems and optimization approaches with which to balance total passenger travel time with energy efficiency and other costs to the operator. Mixed-integer linear programming and pseudospectral methods are among the new methods proposed for single- and multi-train systems for the solution of the nonlinear trajectory planning problem which involv...

Multiphase Return Trajectory Optimization Based on Hybrid Algorithm

Directory of Open Access Journals (Sweden)

Yi Yang

2016-01-01

Full Text Available A hybrid trajectory optimization method consisting of Gauss pseudospectral method (GPM and natural computation algorithm has been developed and utilized to solve multiphase return trajectory optimization problem, where a phase is defined as a subinterval in which the right-hand side of the differential equation is continuous. GPM converts the optimal control problem to a nonlinear programming problem (NLP, which helps to improve calculation accuracy and speed of natural computation algorithm. Through numerical simulations, it is found that the multiphase optimal control problem could be solved perfectly.

A man in the loop trajectory optimization program (MILTOP)

Science.gov (United States)

Reinfields, J.

1974-01-01

An interactive trajectory optimization program is developed for use in initial fixing of launch configurations. The program is called MILTOP for Man-In-the-Loop-Trajectory Optimization-Program. The program is designed to facilitate quick look studies using man-machine decision combinations to reduce the time required to solve a given problem. MILTOP integrates the equations of motion of a point-mass in 3-Dimensions with drag as the only aerodynamic force present. Any point in time at which an integration step terminates, may be used as a decision-break-point, with complete user control over all variables and routines at this point. Automatic phases are provided for different modes of control: vertical rise, pitch-over, gravity turn, chi-freeze and control turn. Stage parameters are initialized from a separate routine so the user may fly as many stages as his problem demands. The MILTOP system uses both interactively on storage scope consoles, or in batch mode with numerical output on the live printer.

Optimal control and optimal trajectories of regional macroeconomic dynamics based on the Pontryagin maximum principle

Science.gov (United States)

Bulgakov, V. K.; Strigunov, V. V.

2009-05-01

The Pontryagin maximum principle is used to prove a theorem concerning optimal control in regional macroeconomics. A boundary value problem for optimal trajectories of the state and adjoint variables is formulated, and optimal curves are analyzed. An algorithm is proposed for solving the boundary value problem of optimal control. The performance of the algorithm is demonstrated by computing an optimal control and the corresponding optimal trajectories.

Trajectory Optimization for a Cruising Unmanned Aerial Vehicle Attacking a Target at Back Slope While Subjected to a Wind Gradient

Directory of Open Access Journals (Sweden)

Tieying Jiang

2015-01-01

Full Text Available The trajectory of a tubular launched cruising unmanned aerial vehicle is optimized using the modified direct collocation method for attacking a target at back slope under a wind gradient. A mathematical model of the cruising unmanned aerial vehicle is established based on its operational and motion features under a wind gradient to optimize the trajectory. The motion characteristics of  “altitude adjustment” and “suicide attack” are taken into full account under the combat circumstance of back slope time key targets. By introducing a discrete time function, the trajectory optimization is converted into a nonlinear programming problem and the SNPOT software is applied to solve for the optimal trajectory of the missile under different wind loads. The simulation results show that, for optimized trajectories, the average attack time decreased by up to 29.1% and the energy consumption is reduced by up to 25.9% under specified wind gradient conditions. A, ωdire, and Wmax have an influence on the flight trajectories of cruising unmanned aerial vehicle. This verifies that the application of modified direct collocation method is reasonable and feasible in an effort to achieve more efficient missile trajectories.

Trajectory Optimization for Differential Flat Systems

OpenAIRE

Kahina Louadj; Benjamas Panomruttanarug; Alexandre Carlos Brandao Ramos; Felix Mora-Camino

2016-01-01

International audience; The purpose of this communication is to investigate the applicability of Variational Calculus to the optimization of the operation of differentially flat systems. After introducingcharacteristic properties of differentially flat systems, the applicability of variational calculus to the optimization of flat output trajectories is displayed. Two illustrative examples are also presented.

Task driven optimal leg trajectories in insect-scale legged microrobots

Science.gov (United States)

Doshi, Neel; Goldberg, Benjamin; Jayaram, Kaushik; Wood, Robert

Origami inspired layered manufacturing techniques and 3D-printing have enabled the development of highly articulated legged robots at the insect-scale, including the 1.43g Harvard Ambulatory MicroRobot (HAMR). Research on these platforms has expanded its focus from manufacturing aspects to include design optimization and control for application-driven tasks. Consequently, the choice of gait selection, body morphology, leg trajectory, foot design, etc. have become areas of active research. HAMR has two controlled degrees-of-freedom per leg, making it an ideal candidate for exploring leg trajectory. We will discuss our work towards optimizing HAMR's leg trajectories for two different tasks: climbing using electroadhesives and level ground running (5-10 BL/s). These tasks demonstrate the ability of single platform to adapt to vastly different locomotive scenarios: quasi-static climbing with controlled ground contact, and dynamic running with un-controlled ground contact. We will utilize trajectory optimization methods informed by existing models and experimental studies to determine leg trajectories for each task. We also plan to discuss how task specifications and choice of objective function have contributed to the shape of these optimal leg trajectories.

Adaptive density trajectory cluster based on time and space distance

Science.gov (United States)

Liu, Fagui; Zhang, Zhijie

2017-10-01

There are some hotspot problems remaining in trajectory cluster for discovering mobile behavior regularity, such as the computation of distance between sub trajectories, the setting of parameter values in cluster algorithm and the uncertainty/boundary problem of data set. As a result, based on the time and space, this paper tries to define the calculation method of distance between sub trajectories. The significance of distance calculation for sub trajectories is to clearly reveal the differences in moving trajectories and to promote the accuracy of cluster algorithm. Besides, a novel adaptive density trajectory cluster algorithm is proposed, in which cluster radius is computed through using the density of data distribution. In addition, cluster centers and number are selected by a certain strategy automatically, and uncertainty/boundary problem of data set is solved by designed weighted rough c-means. Experimental results demonstrate that the proposed algorithm can perform the fuzzy trajectory cluster effectively on the basis of the time and space distance, and obtain the optimal cluster centers and rich cluster results information adaptably for excavating the features of mobile behavior in mobile and sociology network.

Discrete-time inverse optimal control for nonlinear systems

CERN Document Server

Sanchez, Edgar N

2013-01-01

Discrete-Time Inverse Optimal Control for Nonlinear Systems proposes a novel inverse optimal control scheme for stabilization and trajectory tracking of discrete-time nonlinear systems. This avoids the need to solve the associated Hamilton-Jacobi-Bellman equation and minimizes a cost functional, resulting in a more efficient controller. Design More Efficient Controllers for Stabilization and Trajectory Tracking of Discrete-Time Nonlinear Systems The book presents two approaches for controller synthesis: the first based on passivity theory and the second on a control Lyapunov function (CLF). Th

Terminal Control Area Aircraft Scheduling and Trajectory Optimization Approaches

Directory of Open Access Journals (Sweden)

Samà Marcella

2017-01-01

Full Text Available Aviation authorities are seeking optimization methods to better use the available infrastructure and better manage aircraft movements. This paper deals with the realtime scheduling of take-off and landing aircraft at a busy terminal control area and with the optimization of aircraft trajectories during the landing procedures. The first problem aims to reduce the propagation of delays, while the second problem aims to either minimize the travel time or reduce the fuel consumption. Both problems are particularly complex, since the first one is NP-hard while the second one is nonlinear and a combined solution needs to be computed in a short-time during operations. This paper proposes a framework for the lexicographic optimization of the two problems. Computational experiments are performed for the Milano Malpensa airport and show the existing gaps between the performance indicators of the two problems when different lexicographic optimization approaches are considered.

Optimal Acceleration-Velocity-Bounded Trajectory Planning in Dynamic Crowd Simulation

Directory of Open Access Journals (Sweden)

Fu Yue-wen

2014-01-01

Full Text Available Creating complex and realistic crowd behaviors, such as pedestrian navigation behavior with dynamic obstacles, is a difficult and time consuming task. In this paper, we study one special type of crowd which is composed of urgent individuals, normal individuals, and normal groups. We use three steps to construct the crowd simulation in dynamic environment. The first one is that the urgent individuals move forward along a given path around dynamic obstacles and other crowd members. An optimal acceleration-velocity-bounded trajectory planning method is utilized to model their behaviors, which ensures that the durations of the generated trajectories are minimal and the urgent individuals are collision-free with dynamic obstacles (e.g., dynamic vehicles. In the second step, a pushing model is adopted to simulate the interactions between urgent members and normal ones, which ensures that the computational cost of the optimal trajectory planning is acceptable. The third step is obligated to imitate the interactions among normal members using collision avoidance behavior and flocking behavior. Various simulation results demonstrate that these three steps give realistic crowd phenomenon just like the real world.

Optimal trajectories for flexible-link manipulator slewing using recursive quadratic programming: Experimental verification

International Nuclear Information System (INIS)

Parker, G.G.; Eisler, G.R.; Feddema, J.T.

1994-01-01

Procedures for trajectory planning and control of flexible link robots are becoming increasingly important to satisfy performance requirements of hazardous waste removal efforts. It has been shown that utilizing link flexibility in designing open loop joint commands can result in improved performance as opposed to damping vibration throughout a trajectory. The efficient use of link compliance is exploited in this work. Specifically, experimental verification of minimum time, straight line tracking using a two-link planar flexible robot is presented. A numerical optimization process, using an experimentally verified modal model, is used for obtaining minimum time joint torque and angle histories. The optimal joint states are used as commands to the proportional-derivative servo actuated joints. These commands are precompensated for the nonnegligible joint servo actuator dynamics. Using the precompensated joint commands, the optimal joint angles are tracked with such fidelity that the tip tracking error is less than 2.5 cm

A direct method for trajectory optimization of rigid bodies through contact

OpenAIRE

Posa, Michael Antonio; Cantu, Cecilia; Tedrake, Russell Louis

2013-01-01

Direct methods for trajectory optimization are widely used for planning locally optimal trajectories of robotic systems. Many critical tasks, such as locomotion and manipulation, often involve impacting the ground or objects in the environment. Most state-of-the-art techniques treat the discontinuous dynamics that result from impacts as discrete modes and restrict the search for a complete path to a specified sequence through these modes. Here we present a novel method for trajectory planning...

New reference trajectory optimization algorithm for a flight management system inspired in beam search

Directory of Open Access Journals (Sweden)

Alejandro MURRIETA-MENDOZA

2017-08-01

Full Text Available With the objective of reducing the flight cost and the amount of polluting emissions released in the atmosphere, a new optimization algorithm considering the climb, cruise and descent phases is presented for the reference vertical flight trajectory. The selection of the reference vertical navigation speeds and altitudes was solved as a discrete combinatory problem by means of a graph-tree passing through nodes using the beam search optimization technique. To achieve a compromise between the execution time and the algorithm’s ability to find the global optimal solution, a heuristic methodology introducing a parameter called “optimism coefficient was used in order to estimate the trajectory’s flight cost at every node. The optimal trajectory cost obtained with the developed algorithm was compared with the cost of the optimal trajectory provided by a commercial flight management system(FMS. The global optimal solution was validated against an exhaustive search algorithm(ESA, other than the proposed algorithm. The developed algorithm takes into account weather effects, step climbs during cruise and air traffic management constraints such as constant altitude segments, constant cruise Mach, and a pre-defined reference lateral navigation route. The aircraft fuel burn was computed using a numerical performance model which was created and validated using flight test experimental data.

Optimizing interplanetary trajectories with deep space maneuvers

Science.gov (United States)

Navagh, John

1993-09-01

Analysis of interplanetary trajectories is a crucial area for both manned and unmanned missions of the Space Exploration Initiative. A deep space maneuver (DSM) can improve a trajectory in much the same way as a planetary swingby. However, instead of using a gravitational field to alter the trajectory, the on-board propulsion system of the spacecraft is used when the vehicle is not near a planet. The purpose is to develop an algorithm to determine where and when to use deep space maneuvers to reduce the cost of a trajectory. The approach taken to solve this problem uses primer vector theory in combination with a non-linear optimizing program to minimize Delta(V). A set of necessary conditions on the primer vector is shown to indicate whether a deep space maneuver will be beneficial. Deep space maneuvers are applied to a round trip mission to Mars to determine their effect on the launch opportunities. Other studies which were performed include cycler trajectories and Mars mission abort scenarios. It was found that the software developed was able to locate quickly DSM's which lower the total Delta(V) on these trajectories.

Optimization of Vehicular Trajectories under Gaussian Noise Disturbances

Directory of Open Access Journals (Sweden)

Joan Garcia-Haro

2012-12-01

Full Text Available Nowadays, research on Vehicular Technology aims at automating every single mechanical element of vehicles, in order to increase passengers’ safety, reduce human driving intervention and provide entertainment services on board. Automatic trajectory tracing for vehicles under especially risky circumstances is a field of research that is currently gaining enormous attention. In this paper, we show some results on how to develop useful policies to execute maneuvers by a vehicle at high speeds with the mathematical optimization of some already established mobility conditions of the car. We also study how the presence of Gaussian noise on measurement sensors while maneuvering can disturb motion and affect the final trajectories. Different performance criteria for the optimization of such maneuvers are presented, and an analysis is shown on how path deviations can be minimized by using trajectory smoothing techniques like the Kalman Filter. We finalize the paper with a discussion on how communications can be used to implement these schemes.

Real-time terminal area trajectory planning for runway independent aircraft

Science.gov (United States)

Xue, Min

The increasing demand for commercial air transportation results in delays due to traffic queues that form bottlenecks along final approach and departure corridors. In urban areas, it is often infeasible to build new runways, and regardless of automation upgrades traffic must remain separated to avoid the wakes of previous aircraft. Vertical or short takeoff and landing aircraft as Runway Independent Aircraft (RIA) can increase passenger throughput at major urban airports via the use of vertiports or stub runways. The concept of simultaneous non-interfering (SNI) operations has been proposed to reduce traffic delays by creating approach and departure corridors that do not intersect existing fixed-wing routes. However, SNI trajectories open new routes that may overfly noise-sensitive areas, and RIA may generate more noise than traditional jet aircraft, particularly on approach. In this dissertation, we develop efficient SNI noise abatement procedures applicable to RIA. First, we introduce a methodology based on modified approximated cell-decomposition and Dijkstra's search algorithm to optimize longitudinal plane (2-D) RIA trajectories over a cost function that minimizes noise, time, and fuel use. Then, we extend the trajectory optimization model to 3-D with a k-ary tree as the discrete search space. We incorporate geography information system (GIS) data, specifically population, into our objective function, and focus on a practical case study: the design of SNI RIA approach procedures to Baltimore-Washington International airport. Because solutions were represented as trim state sequences, we incorporated smooth transition between segments to enable more realistic cost estimates. Due to the significant computational complexity, we investigated alternative more efficient optimization techniques applicable to our nonlinear, non-convex, heavily constrained, and discontinuous objective function. Comparing genetic algorithm (GA) and adaptive simulated annealing (ASA

Optimal Trajectory Tracking Control for a Wheeled Mobile Robot Using Fractional Order PID Controller

Directory of Open Access Journals (Sweden)

Ameer L. Saleh

2018-02-01

Full Text Available This paper present an optimal Fractional Order PID (FOPID controller based on Particle Swarm Optimization (PSO for controlling the trajectory tracking of Wheeled Mobile Robot(WMR.The issue of trajectory tracking with given a desired reference velocity is minimized to get the distance and deviation angle equal to zero, to realize the objective of trajectory tracking a two FOPID controllers are used for velocity control and azimuth control to implement the trajectory tracking control. A path planning and path tracking methodologies are used to give different desired tracking trajectories.  PSO algorithm is using to find the optimal parameters of FOPID controllers. The kinematic and dynamic models of wheeled mobile robot for desired trajectory tracking with PSO algorithm are simulated in Simulink-Matlab. Simulation results show that the optimal FOPID controllers are more effective and has better dynamic performance than the conventional methods.

Application of Modern Fortran to Spacecraft Trajectory Design and Optimization

Science.gov (United States)

Williams, Jacob; Falck, Robert D.; Beekman, Izaak B.

2018-01-01

In this paper, applications of the modern Fortran programming language to the field of spacecraft trajectory optimization and design are examined. Modern object-oriented Fortran has many advantages for scientific programming, although many legacy Fortran aerospace codes have not been upgraded to use the newer standards (or have been rewritten in other languages perceived to be more modern). NASA's Copernicus spacecraft trajectory optimization program, originally a combination of Fortran 77 and Fortran 95, has attempted to keep up with modern standards and makes significant use of the new language features. Various algorithms and methods are presented from trajectory tools such as Copernicus, as well as modern Fortran open source libraries and other projects.

Propositional Optimal Trajectory Programming for Improving Stability ...

African Journals Online (AJOL)

Propositional Optimal Trajectory Programming for Improving Stability of Hermite Definite Control System. ... PROMOTING ACCESS TO AFRICAN RESEARCH. AFRICAN JOURNALS ONLINE (AJOL) ... Knowledge of systems operation subjected to heat diffusion constraints is required of systems analysts. In an instance that ...

Decentralized flight trajectory planning of multiple aircraft

OpenAIRE

Yokoyama, Nobuhiro; 横山　信宏

2008-01-01

Conventional decentralized algorithms for optimal trajectory planning tend to require prohibitive computational time as the number of aircraft increases. To overcome this drawback, this paper proposes a novel decentralized trajectory planning algorithm adopting a constraints decoupling approach for parallel optimization. The constraints decoupling approach is formulated as the path constraints of the real-time trajectory optimization problem based on nonlinear programming. Due to the parallel...

SeGRAm - A practical and versatile tool for spacecraft trajectory optimization

Science.gov (United States)

Rishikof, Brian H.; Mccormick, Bernell R.; Pritchard, Robert E.; Sponaugle, Steven J.

1991-01-01

An implementation of the Sequential Gradient/Restoration Algorithm, SeGRAm, is presented along with selected examples. This spacecraft trajectory optimization and simulation program uses variational calculus to solve problems of spacecraft flying under the influence of one or more gravitational bodies. It produces a series of feasible solutions to problems involving a wide range of vehicles, environments and optimization functions, until an optimal solution is found. The examples included highlight the various capabilities of the program and emphasize in particular its versatility over a wide spectrum of applications from ascent to interplanetary trajectories.

Comparison of kinematic and dynamic leg trajectory optimization techniques for biped robot locomotion

Science.gov (United States)

Khusainov, R.; Klimchik, A.; Magid, E.

2017-01-01

The paper presents comparison analysis of two approaches in defining leg trajectories for biped locomotion. The first one operates only with kinematic limitations of leg joints and finds the maximum possible locomotion speed for given limits. The second approach defines leg trajectories from the dynamic stability point of view and utilizes ZMP criteria. We show that two methods give different trajectories and demonstrate that trajectories based on pure dynamic optimization cannot be realized due to joint limits. Kinematic optimization provides unstable solution which can be balanced by upper body movement.

Reliability-based trajectory optimization using nonintrusive polynomial chaos for Mars entry mission

Science.gov (United States)

Huang, Yuechen; Li, Haiyang

2018-06-01

This paper presents the reliability-based sequential optimization (RBSO) method to settle the trajectory optimization problem with parametric uncertainties in entry dynamics for Mars entry mission. First, the deterministic entry trajectory optimization model is reviewed, and then the reliability-based optimization model is formulated. In addition, the modified sequential optimization method, in which the nonintrusive polynomial chaos expansion (PCE) method and the most probable point (MPP) searching method are employed, is proposed to solve the reliability-based optimization problem efficiently. The nonintrusive PCE method contributes to the transformation between the stochastic optimization (SO) and the deterministic optimization (DO) and to the approximation of trajectory solution efficiently. The MPP method, which is used for assessing the reliability of constraints satisfaction only up to the necessary level, is employed to further improve the computational efficiency. The cycle including SO, reliability assessment and constraints update is repeated in the RBSO until the reliability requirements of constraints satisfaction are satisfied. Finally, the RBSO is compared with the traditional DO and the traditional sequential optimization based on Monte Carlo (MC) simulation in a specific Mars entry mission to demonstrate the effectiveness and the efficiency of the proposed method.

Optimal Point-to-Point Trajectory Tracking of Redundant Manipulators using Generalized Pattern Search

Directory of Open Access Journals (Sweden)

Thi Rein Myo

2008-11-01

Full Text Available Optimal point-to-point trajectory planning for planar redundant manipulator is considered in this study. The main objective is to minimize the sum of the position error of the end-effector at each intermediate point along the trajectory so that the end-effector can track the prescribed trajectory accurately. An algorithm combining Genetic Algorithm and Pattern Search as a Generalized Pattern Search GPS is introduced to design the optimal trajectory. To verify the proposed algorithm, simulations for a 3-D-O-F planar manipulator with different end-effector trajectories have been carried out. A comparison between the Genetic Algorithm and the Generalized Pattern Search shows that The GPS gives excellent tracking performance.

Assembly Line Productivity Assessment by Comparing Optimization-Simulation Algorithms of Trajectory Planning for Industrial Robots

Directory of Open Access Journals (Sweden)

Francisco Rubio

2015-01-01

Full Text Available In this paper an analysis of productivity will be carried out from the resolution of the problem of trajectory planning of industrial robots. The analysis entails economic considerations, thus overcoming some limitations of the existing literature. Two methodologies based on optimization-simulation procedures are compared to calculate the time needed to perform an industrial robot task. The simulation methodology relies on the use of robotics and automation software called GRASP. The optimization methodology developed in this work is based on the kinematics and the dynamics of industrial robots. It allows us to pose a multiobjective optimization problem to assess the trade-offs between the economic variables by means of the Pareto fronts. The comparison is carried out for different examples and from a multidisciplinary point of view, thus, to determine the impact of using each method. Results have shown the opportunity costs of non using the methodology with optimized time trajectories. Furthermore, it allows companies to stay competitive because of the quick adaptation to rapidly changing markets.

New Search Space Reduction Algorithm for Vertical Reference Trajectory Optimization

Directory of Open Access Journals (Sweden)

Alejandro MURRIETA-MENDOZA

2016-06-01

Full Text Available Burning the fuel required to sustain a given flight releases pollution such as carbon dioxide and nitrogen oxides, and the amount of fuel consumed is also a significant expense for airlines. It is desirable to reduce fuel consumption to reduce both pollution and flight costs. To increase fuel savings in a given flight, one option is to compute the most economical vertical reference trajectory (or flight plan. A deterministic algorithm was developed using a numerical aircraft performance model to determine the most economical vertical flight profile considering take-off weight, flight distance, step climb and weather conditions. This algorithm is based on linear interpolations of the performance model using the Lagrange interpolation method. The algorithm downloads the latest available forecast from Environment Canada according to the departure date and flight coordinates, and calculates the optimal trajectory taking into account the effects of wind and temperature. Techniques to avoid unnecessary calculations are implemented to reduce the computation time. The costs of the reference trajectories proposed by the algorithm are compared with the costs of the reference trajectories proposed by a commercial flight management system using the fuel consumption estimated by the FlightSim® simulator made by Presagis®.

Parameter Identification of Static Friction Based on An Optimal Exciting Trajectory

Science.gov (United States)

Tu, X.; Zhao, P.; Zhou, Y. F.

2017-12-01

In this paper, we focus on how to improve the identification efficiency of friction parameters in a robot joint. First, the static friction model that has only linear dependencies with respect to their parameters is adopted so that the servomotor dynamics can be linearized. In this case, the traditional exciting trajectory based on Fourier series is modified by replacing the constant term with quintic polynomial to ensure the boundary continuity of speed and acceleration. Then, the Fourier-related parameters are optimized by genetic algorithm(GA) in which the condition number of regression matrix is set as the fitness function. At last, compared with the constant-velocity tracking experiment, the friction parameters from the exciting trajectory experiment has the similar result with the advantage of time reduction.

Trajectory optimization for lunar rover performing vertical takeoff vertical landing maneuvers in the presence of terrain

Science.gov (United States)

Ma, Lin; Wang, Kexin; Xu, Zuhua; Shao, Zhijiang; Song, Zhengyu; Biegler, Lorenz T.

2018-05-01

This study presents a trajectory optimization framework for lunar rover performing vertical takeoff vertical landing (VTVL) maneuvers in the presence of terrain using variable-thrust propulsion. First, a VTVL trajectory optimization problem with three-dimensional kinematics and dynamics model, boundary conditions, and path constraints is formulated. Then, a finite-element approach transcribes the formulated trajectory optimization problem into a nonlinear programming (NLP) problem solved by a highly efficient NLP solver. A homotopy-based backtracking strategy is applied to enhance the convergence in solving the formulated VTVL trajectory optimization problem. The optimal thrust solution typically has a "bang-bang" profile considering that bounds are imposed on the magnitude of engine thrust. An adaptive mesh refinement strategy based on a constant Hamiltonian profile is designed to address the difficulty in locating the breakpoints in the thrust profile. Four scenarios are simulated. Simulation results indicate that the proposed trajectory optimization framework has sufficient adaptability to handle VTVL missions efficiently.

High-performance simulation-based algorithms for an alpine ski racer’s trajectory optimization in heterogeneous computer systems

Directory of Open Access Journals (Sweden)

Dębski Roman

2014-09-01

Full Text Available Effective, simulation-based trajectory optimization algorithms adapted to heterogeneous computers are studied with reference to the problem taken from alpine ski racing (the presented solution is probably the most general one published so far. The key idea behind these algorithms is to use a grid-based discretization scheme to transform the continuous optimization problem into a search problem over a specially constructed finite graph, and then to apply dynamic programming to find an approximation of the global solution. In the analyzed example it is the minimum-time ski line, represented as a piecewise-linear function (a method of elimination of unfeasible solutions is proposed. Serial and parallel versions of the basic optimization algorithm are presented in detail (pseudo-code, time and memory complexity. Possible extensions of the basic algorithm are also described. The implementation of these algorithms is based on OpenCL. The included experimental results show that contemporary heterogeneous computers can be treated as μ-HPC platforms-they offer high performance (the best speedup was equal to 128 while remaining energy and cost efficient (which is crucial in embedded systems, e.g., trajectory planners of autonomous robots. The presented algorithms can be applied to many trajectory optimization problems, including those having a black-box represented performance measure

Optimization on Trajectory of Stanford Manipulator based on Genetic Algorithm

Directory of Open Access Journals (Sweden)

Han Xi

2017-01-01

Full Text Available The optimization of robot manipulator’s trajectory has become a hot topic in academic and industrial fields. In this paper, a method for minimizing the moving distance of robot manipulators is presented. The Stanford Manipulator is used as the research object and the inverse kinematics model is established with Denavit-Hartenberg method. Base on the initial posture matrix, the inverse kinematics model is used to find the initial state of each joint. In accordance with the given beginning moment, cubic polynomial interpolation is applied to each joint variable and the positive kinematic model is used to calculate the moving distance of end effector. Genetic algorithm is used to optimize the sequential order of each joint and the time difference between different starting time of joints. Numerical applications involving a Stanford manipulator are presented.

Optimal trajectory planning of free-floating space manipulator using differential evolution algorithm

Science.gov (United States)

Wang, Mingming; Luo, Jianjun; Fang, Jing; Yuan, Jianping

2018-03-01

The existence of the path dependent dynamic singularities limits the volume of available workspace of free-floating space robot and induces enormous joint velocities when such singularities are met. In order to overcome this demerit, this paper presents an optimal joint trajectory planning method using forward kinematics equations of free-floating space robot, while joint motion laws are delineated with application of the concept of reaction null-space. Bézier curve, in conjunction with the null-space column vectors, are applied to describe the joint trajectories. Considering the forward kinematics equations of the free-floating space robot, the trajectory planning issue is consequently transferred to an optimization issue while the control points to construct the Bézier curve are the design variables. A constrained differential evolution (DE) scheme with premature handling strategy is implemented to find the optimal solution of the design variables while specific objectives and imposed constraints are satisfied. Differ from traditional methods, we synthesize null-space and specialized curve to provide a novel viewpoint for trajectory planning of free-floating space robot. Simulation results are presented for trajectory planning of 7 degree-of-freedom (DOF) kinematically redundant manipulator mounted on a free-floating spacecraft and demonstrate the feasibility and effectiveness of the proposed method.

Trajectory generation for manipulators using linear quadratic optimal tracking

Directory of Open Access Journals (Sweden)

Olav Egeland

1989-04-01

Full Text Available The reference trajectory is normally known in advance in manipulator control which makes it possible to apply linear quadratic optimal tracking. This gives a control system which rounds corners and generates optimal feedforward. The method may be used for references consisting of straight-line segments as an alternative to the two-step method of using splines to smooth the reference and then applying feedforward. In addition, the method can be used for more complex trajectories. The actual dynamics of the manipulator are taken into account, and this results in smooth and accurate tracking. The method has been applied in combination with the computed torque technique and excellent performance was demonstrated in a simulation study. The method has also been applied experimentally to an industrial spray-painting robot where a saw-tooth reference was tracked. The corner was rounded extremely well, and the steady-state tracking error was eliminated by the optimal feedforward.

Global Launcher Trajectory Optimization for Lunar Base Settlement

NARCIS (Netherlands)

Pagano, A.; Mooij, E.

2010-01-01

The problem of a mission to the Moon to set a permanent outpost can be tackled by dividing the journey into three phases: the Earth ascent, the Earth-Moon transfer and the lunar landing. In this paper we present an optimization analysis of Earth ascent trajectories of existing launch vehicles

Genetic algorithm trajectory plan optimization for EAMA: EAST Articulated Maintenance Arm

Energy Technology Data Exchange (ETDEWEB)

Wu, Jing, E-mail: wujing@ipp.ac.cn [Institute of Plasma Physics, Chinese Academy of Sciences, 350 Shushanhu Rd., Hefei, Anhui (China); Lappeenranta University of Technology, Skinnarilankatu 34, Lappeenranta (Finland); Wu, Huapeng [Lappeenranta University of Technology, Skinnarilankatu 34, Lappeenranta (Finland); Song, Yuntao; Cheng, Yong; Zhao, Wenglong [Institute of Plasma Physics, Chinese Academy of Sciences, 350 Shushanhu Rd., Hefei, Anhui (China); Wang, Yongbo [Lappeenranta University of Technology, Skinnarilankatu 34, Lappeenranta (Finland)

2016-11-01

Highlights: • A redundant 10-DOF serial-articulated robot for EAST assembly and maintains is presented. • A trajectory optimization algorithm of the robot is developed. • A minimum jerk objective is presented to suppress machining vibration of the robot. - Abstract: EAMA (EAST Articulated Maintenance Arm) is an articulated serial manipulator with 7 degrees of freedom (DOF) articulated arm followed by 3-DOF gripper, total length is 8.867 m, works in experimental advanced superconductor tokamak (EAST) vacuum vessel (VV) to perform blanket inspection and remote maintenance tasks. This paper presents a trajectory optimization method which aims to pursue the 7-DOF articulated arm a stable movement, which keeps the mounted inspection camera anti-vibration. Based on dynamics analysis, trajectory optimization algorithm adopts multi-order polynomial interpolation in joint space and high order geometry Jacobian transform. The object of optimization algorithm is to suppress end-effector movement vibration by minimizing jerk RMS (root mean square) value. The proposed solution has such characteristics which can satisfy kinematic constraints of EAMA’s motion and ensure the arm running under the absolute values of velocity, acceleration and jerk boundaries. GA (genetic algorithm) is employed to find global and robust solution for this problem.

SU-E-T-436: Fluence-Based Trajectory Optimization for Non-Coplanar VMAT

Energy Technology Data Exchange (ETDEWEB)

Smyth, G; Bamber, JC; Bedford, JL [Joint Department of Physics at The Institute of Cancer Research and The Royal Marsden NHS Foundation Trust, London (United Kingdom); Evans, PM [Centre for Vision, Speech and Signal Processing, University of Surrey, Guildford (United Kingdom); Saran, FH; Mandeville, HC [The Royal Marsden NHS Foundation Trust, Sutton (United Kingdom)

2015-06-15

Purpose: To investigate a fluence-based trajectory optimization technique for non-coplanar VMAT for brain cancer. Methods: Single-arc non-coplanar VMAT trajectories were determined using a heuristic technique for five patients. Organ at risk (OAR) volume intersected during raytracing was minimized for two cases: absolute volume and the sum of relative volumes weighted by OAR importance. These trajectories and coplanar VMAT formed starting points for the fluence-based optimization method. Iterative least squares optimization was performed on control points 24° apart in gantry rotation. Optimization minimized the root-mean-square (RMS) deviation of PTV dose from the prescription (relative importance 100), maximum dose to the brainstem (10), optic chiasm (5), globes (5) and optic nerves (5), plus mean dose to the lenses (5), hippocampi (3), temporal lobes (2), cochleae (1) and brain excluding other regions of interest (1). Control point couch rotations were varied in steps of up to 10° and accepted if the cost function improved. Final treatment plans were optimized with the same objectives in an in-house planning system and evaluated using a composite metric - the sum of optimization metrics weighted by importance. Results: The composite metric decreased with fluence-based optimization in 14 of the 15 plans. In the remaining case its overall value, and the PTV and OAR components, were unchanged but the balance of OAR sparing differed. PTV RMS deviation was improved in 13 cases and unchanged in two. The OAR component was reduced in 13 plans. In one case the OAR component increased but the composite metric decreased - a 4 Gy increase in OAR metrics was balanced by a reduction in PTV RMS deviation from 2.8% to 2.6%. Conclusion: Fluence-based trajectory optimization improved plan quality as defined by the composite metric. While dose differences were case specific, fluence-based optimization improved both PTV and OAR dosimetry in 80% of cases.

Clustering Molecular Dynamics Trajectories for Optimizing Docking Experiments

Directory of Open Access Journals (Sweden)

Renata De Paris

2015-01-01

Full Text Available Molecular dynamics simulations of protein receptors have become an attractive tool for rational drug discovery. However, the high computational cost of employing molecular dynamics trajectories in virtual screening of large repositories threats the feasibility of this task. Computational intelligence techniques have been applied in this context, with the ultimate goal of reducing the overall computational cost so the task can become feasible. Particularly, clustering algorithms have been widely used as a means to reduce the dimensionality of molecular dynamics trajectories. In this paper, we develop a novel methodology for clustering entire trajectories using structural features from the substrate-binding cavity of the receptor in order to optimize docking experiments on a cloud-based environment. The resulting partition was selected based on three clustering validity criteria, and it was further validated by analyzing the interactions between 20 ligands and a fully flexible receptor (FFR model containing a 20 ns molecular dynamics simulation trajectory. Our proposed methodology shows that taking into account features of the substrate-binding cavity as input for the k-means algorithm is a promising technique for accurately selecting ensembles of representative structures tailored to a specific ligand.

Trajectory planning and optimal tracking for an industrial mobile robot

Science.gov (United States)

Hu, Huosheng; Brady, J. Michael; Probert, Penelope J.

1994-02-01

This paper introduces a unified approach to trajectory planning and tracking for an industrial mobile robot subject to non-holonomic constraints. We show (1) how a smooth trajectory is generated that takes into account the constraints from the dynamic environment and the robot kinematics; and (2) how a general predictive controller works to provide optimal tracking capability for nonlinear systems. The tracking performance of the proposed guidance system is analyzed by simulation.

Coordinated trajectory planning of dual-arm space robot using constrained particle swarm optimization

Science.gov (United States)

Wang, Mingming; Luo, Jianjun; Yuan, Jianping; Walter, Ulrich

2018-05-01

Application of the multi-arm space robot will be more effective than single arm especially when the target is tumbling. This paper investigates the application of particle swarm optimization (PSO) strategy to coordinated trajectory planning of the dual-arm space robot in free-floating mode. In order to overcome the dynamics singularities issue, the direct kinematics equations in conjunction with constrained PSO are employed for coordinated trajectory planning of dual-arm space robot. The joint trajectories are parametrized with Bézier curve to simplify the calculation. Constrained PSO scheme with adaptive inertia weight is implemented to find the optimal solution of joint trajectories while specific objectives and imposed constraints are satisfied. The proposed method is not sensitive to the singularity issue due to the application of forward kinematic equations. Simulation results are presented for coordinated trajectory planning of two kinematically redundant manipulators mounted on a free-floating spacecraft and demonstrate the effectiveness of the proposed method.

Optimization of ramp area aircraft push back time windows in the presence of uncertainty

Science.gov (United States)

Coupe, William Jeremy

It is well known that airport surface traffic congestion at major airports is responsible for increased taxi-out times, fuel burn and excess emissions and there is potential to mitigate these negative consequences through optimizing airport surface traffic operations. Due to a highly congested voice communication channel between pilots and air traffic controllers and a data communication channel that is used only for limited functions, one of the most viable near-term strategies for improvement of the surface traffic is issuing a push back advisory to each departing aircraft. This dissertation focuses on the optimization of a push back time window for each departing aircraft. The optimization takes into account both spatial and temporal uncertainties of ramp area aircraft trajectories. The uncertainties are described by a stochastic kinematic model of aircraft trajectories, which is used to infer distributions of combinations of push back times that lead to conflict among trajectories from different gates. The model is validated and the distributions are included in the push back time window optimization. Under the assumption of a fixed taxiway spot schedule, the computed push back time windows can be integrated with a higher level taxiway scheduler to optimize the flow of traffic from the gate to the departure runway queue. To enable real-time decision making the computational time of the push back time window optimization is critical and is analyzed throughout.

Method of interplanetary trajectory optimization for the spacecraft with low thrust and swing-bys

Science.gov (United States)

Konstantinov, M. S.; Thein, M.

2017-07-01

The method developed to avoid the complexity of solving the multipoint boundary value problem while optimizing interplanetary trajectories of the spacecraft with electric propulsion and a sequence of swing-bys is presented in the paper. This method is based on the use of the preliminary problem solutions for the impulsive trajectories. The preliminary problem analyzed at the first stage of the study is formulated so that the analysis and optimization of a particular flight path is considered as the unconstrained minimum in the space of the selectable parameters. The existing methods can effectively solve this problem and make it possible to identify rational flight paths (the sequence of swing-bys) to receive the initial approximation for the main characteristics of the flight path (dates, values of the hyperbolic excess velocity, etc.). These characteristics can be used to optimize the trajectory of the spacecraft with electric propulsion. The special feature of the work is the introduction of the second (intermediate) stage of the research. At this stage some characteristics of the analyzed flight path (e.g. dates of swing-bys) are fixed and the problem is formulated so that the trajectory of the spacecraft with electric propulsion is optimized on selected sites of the flight path. The end-to-end optimization is carried out at the third (final) stage of the research. The distinctive feature of this stage is the analysis of the full set of optimal conditions for the considered flight path. The analysis of the characteristics of the optimal flight trajectories to Jupiter with Earth, Venus and Mars swing-bys for the spacecraft with electric propulsion are presented. The paper shows that the spacecraft weighing more than 7150 kg can be delivered into the vicinity of Jupiter along the trajectory with two Earth swing-bys by use of the space transportation system based on the "Angara A5" rocket launcher, the chemical upper stage "KVTK" and the electric propulsion system

Trajectory optimization for dynamic couch rotation during volumetric modulated arc radiotherapy

Science.gov (United States)

Smyth, Gregory; Bamber, Jeffrey C.; Evans, Philip M.; Bedford, James L.

2013-11-01

Non-coplanar radiation beams are often used in three-dimensional conformal and intensity modulated radiotherapy to reduce dose to organs at risk (OAR) by geometric avoidance. In volumetric modulated arc radiotherapy (VMAT) non-coplanar geometries are generally achieved by applying patient couch rotations to single or multiple full or partial arcs. This paper presents a trajectory optimization method for a non-coplanar technique, dynamic couch rotation during VMAT (DCR-VMAT), which combines ray tracing with a graph search algorithm. Four clinical test cases (partial breast, brain, prostate only, and prostate and pelvic nodes) were used to evaluate the potential OAR sparing for trajectory-optimized DCR-VMAT plans, compared with standard coplanar VMAT. In each case, ray tracing was performed and a cost map reflecting the number of OAR voxels intersected for each potential source position was generated. The least-cost path through the cost map, corresponding to an optimal DCR-VMAT trajectory, was determined using Dijkstra’s algorithm. Results show that trajectory optimization can reduce dose to specified OARs for plans otherwise comparable to conventional coplanar VMAT techniques. For the partial breast case, the mean heart dose was reduced by 53%. In the brain case, the maximum lens doses were reduced by 61% (left) and 77% (right) and the globes by 37% (left) and 40% (right). Bowel mean dose was reduced by 15% in the prostate only case. For the prostate and pelvic nodes case, the bowel V50 Gy and V60 Gy were reduced by 9% and 45% respectively. Future work will involve further development of the algorithm and assessment of its performance over a larger number of cases in site-specific cohorts.

IMPORTANCE OF KINETIC MEASURES IN TRAJECTORY PREDICTION WITH OPTIMAL CONTROL

Directory of Open Access Journals (Sweden)

Ömer GÜNDOĞDU

2001-02-01

Full Text Available A two-dimensional sagittally symmetric human-body model was established to simulate an optimal trajectory for manual material handling tasks. Nonlinear control techniques and genetic algorithms were utilized in the optimizations to explore optimal lifting patterns. The simulation results were then compared with the experimental data. Since the kinetic measures such as joint reactions and moments are vital parameters in injury determination, the importance of comparing kinetic measures rather than kinematical ones was emphasized.

Optimal trajectory control of a CLCC resonant power converter

NARCIS (Netherlands)

Huisman, H.; Visser, de I.; Duarte, J.L.

2015-01-01

A CLCC resonant converter to be used in an isolated power supply is operated using optimal trajectory control (OTC). As a consequence, the converter's inner loop behavior is changed to that of a controlled current source. The controller is implemented in an FPGA. Simulation results and recorded

Development of a Multi-Event Trajectory Optimization Tool for Noise-Optimized Approach Route Design

NARCIS (Netherlands)

Braakenburg, M.L.; Hartjes, S.; Visser, H.G.; Hebly, S.J.

2011-01-01

This paper presents preliminary results from an ongoing research effort towards the development of a multi-event trajectory optimization methodology that allows to synthesize RNAV approach routes that minimize a cumulative measure of noise, taking into account the total noise effect aggregated for

Firing Control Optimization of Impulse Thrusters for Trajectory Correction Projectiles

Directory of Open Access Journals (Sweden)

Min Gao

2015-01-01

Full Text Available This paper presents an optimum control scheme of firing time and firing phase angle by taking impact point deviation as optimum objective function which takes account of the difference of longitudinal and horizontal correction efficiency, firing delay, roll rate, flight stability, and so forth. Simulations indicate that this control scheme can assure lateral impulse thrusters are activated at time and phase angle when the correction efficiency is higher. Further simulations show that the impact point dispersion is mainly influenced by the total impulse deployed, and the impulse, number, and firing interval need to be optimized to reduce the impact point dispersion of rockets. Live firing experiments with two trajectory correction rockets indicate that the firing control scheme works effectively.

An adaptive multi-spline refinement algorithm in simulation based sailboat trajectory optimization using onboard multi-core computer systems

Directory of Open Access Journals (Sweden)

Dębski Roman

2016-06-01

Full Text Available A new dynamic programming based parallel algorithm adapted to on-board heterogeneous computers for simulation based trajectory optimization is studied in the context of “high-performance sailing”. The algorithm uses a new discrete space of continuously differentiable functions called the multi-splines as its search space representation. A basic version of the algorithm is presented in detail (pseudo-code, time and space complexity, search space auto-adaptation properties. Possible extensions of the basic algorithm are also described. The presented experimental results show that contemporary heterogeneous on-board computers can be effectively used for solving simulation based trajectory optimization problems. These computers can be considered micro high performance computing (HPC platforms-they offer high performance while remaining energy and cost efficient. The simulation based approach can potentially give highly accurate results since the mathematical model that the simulator is built upon may be as complex as required. The approach described is applicable to many trajectory optimization problems due to its black-box represented performance measure and use of OpenCL.

Optimism and Pessimism as Predictors of Alcohol Use Trajectories in Adolescence

Science.gov (United States)

Wray, Tyler B.; Dvorak, Rob D.; Hsia, Jennifer F.; Arens, Ashley M.; Schweinle, William E.

2013-01-01

A range of research has recognized the benefits of optimism in a variety of health-related outcomes. Pessimism has received less attention but may be a distinct concept that is uniquely related to certain health behaviors, including drug use. The present study examined relationships between optimism and pessimism and alcohol use trajectories of…

Trajectory optimization using indirect methods and parametric scramjet cycle analysis

OpenAIRE

Williams, Joseph

2016-01-01

This study investigates the solution of time sensitive regional strike trajectories for hypersonic missiles. This minimum time trajectory is suspected to be best performed by scramjet powered hypersonic missiles which creates strong coupled interaction between the flight dynamics and the performance of the engine. Comprehensive engine models are necessary to gain better insight into scramjet propulsion. Separately, robust and comprehensive trajectory analysis provides references for vehicles ...

Trajectory Planning and Optimized Adaptive Control for a Class of Wheeled Inverted Pendulum Vehicle Models.

Science.gov (United States)

Yang, Chenguang; Li, Zhijun; Li, Jing

2013-02-01

In this paper, we investigate optimized adaptive control and trajectory generation for a class of wheeled inverted pendulum (WIP) models of vehicle systems. Aiming at shaping the controlled vehicle dynamics to be of minimized motion tracking errors as well as angular accelerations, we employ the linear quadratic regulation optimization technique to obtain an optimal reference model. Adaptive control has then been developed using variable structure method to ensure the reference model to be exactly matched in a finite-time horizon, even in the presence of various internal and external uncertainties. The minimized yaw and tilt angular accelerations help to enhance the vehicle rider's comfort. In addition, due to the underactuated mechanism of WIP, the vehicle forward velocity dynamics cannot be controlled separately from the pendulum tilt angle dynamics. Inspired by the control strategy of human drivers, who usually manipulate the tilt angle to control the forward velocity, we design a neural-network-based adaptive generator of implicit control trajectory (AGICT) of the tilt angle which indirectly "controls" the forward velocity such that it tracks the desired velocity asymptotically. The stability and optimal tracking performance have been rigorously established by theoretic analysis. In addition, simulation studies have been carried out to demonstrate the efficiency of the developed AGICT and optimized adaptive controller.

Automated trajectory planning for multiple-flyby interplanetary missions

Science.gov (United States)

Englander, Jacob

Many space mission planning problems may be formulated as hybrid optimal control problems (HOCP), i.e. problems that include both real-valued variables and categorical variables. In interplanetary trajectory design problems the categorical variables will typically specify the sequence of planets at which to perform flybys, and the real-valued variables will represent the launch date, ight times between planets, magnitudes and directions of thrust, flyby altitudes, etc. The contribution of this work is a framework for the autonomous optimization of multiple-flyby interplanetary trajectories. The trajectory design problem is converted into a HOCP with two nested loops: an "outer-loop" that finds the sequence of flybys and an "inner-loop" that optimizes the trajectory for each candidate yby sequence. The problem of choosing a sequence of flybys is posed as an integer programming problem and solved using a genetic algorithm (GA). This is an especially difficult problem to solve because GAs normally operate on a fixed-length set of decision variables. Since in interplanetary trajectory design the number of flyby maneuvers is not known a priori, it was necessary to devise a method of parameterizing the problem such that the GA can evolve a variable-length sequence of flybys. A novel "null gene" transcription was developed to meet this need. Then, for each candidate sequence of flybys, a trajectory must be found that visits each of the flyby targets and arrives at the final destination while optimizing some cost metric, such as minimizing ▵v or maximizing the final mass of the spacecraft. Three different classes of trajectory are described in this work, each of which requireda different physical model and optimization method. The choice of a trajectory model and optimization method is especially challenging because of the nature of the hybrid optimal control problem. Because the trajectory optimization problem is generated in real time by the outer-loop, the inner

ATM4E: A concept for environmentally-optimized aircraft trajectories

NARCIS (Netherlands)

Matthes, S; Grewe, V.; Lee, D; Linke, F.; Shine, Keith; Stromatas, Stavros

2016-01-01

Trajectory optimisation is one option to reduce air traffic impact on environment. A multidimensional environmental assessment framework is needed to optimize impact on climate, local air quality and noise simultaneously. An interface between flight planning and environmental impact information can

Parametric Approach to Trajectory Tracking Control of Robot Manipulators

Directory of Open Access Journals (Sweden)

Shijie Zhang

2013-01-01

Full Text Available The mathematic description of the trajectory of robot manipulators with the optimal trajectory tracking problem is formulated as an optimal control problem, and a parametric approach is proposed for the optimal trajectory tracking control problem. The optimal control problem is first solved as an open loop optimal control problem by using a time scaling transform and the control parameterization method. Then, by virtue of the relationship between the optimal open loop control and the optimal closed loop control along the optimal trajectory, a practical method is presented to calculate an approximate optimal feedback gain matrix, without having to solve an optimal control problem involving the complex Riccati-like matrix differential equation coupled with the original system dynamics. Simulation results of 2-link robot manipulator are presented to show the effectiveness of the proposed method.

Multi-Objective Trajectory Optimization of a Hypersonic Reconnaissance Vehicle with Temperature Constraints

Science.gov (United States)

2014-12-26

geocentric gravitational constant ν basis functions ω angular velocity of the Earth Φ fuel-air ratio φ longitude φ optimal control terminal cost (Mayer) xxvi...incorporate sensor parameters. The current methodologies are also numerically inefficient. A trajectory optimization approach , or a general optimal...control software approach , that is computationally ef- ficient and versatile, while based on a robust mathematical foundation, would provide significant

Trajectory optimization for lunar soft landing with complex constraints

Science.gov (United States)

Chu, Huiping; Ma, Lin; Wang, Kexin; Shao, Zhijiang; Song, Zhengyu

2017-11-01

A unified trajectory optimization framework with initialization strategies is proposed in this paper for lunar soft landing for various missions with specific requirements. Two main missions of interest are Apollo-like Landing from low lunar orbit and Vertical Takeoff Vertical Landing (a promising mobility method) on the lunar surface. The trajectory optimization is characterized by difficulties arising from discontinuous thrust, multi-phase connections, jump of attitude angle, and obstacles avoidance. Here R-function is applied to deal with the discontinuities of thrust, checkpoint constraints are introduced to connect multiple landing phases, attitude angular rate is designed to get rid of radical changes, and safeguards are imposed to avoid collision with obstacles. The resulting dynamic problems are generally with complex constraints. The unified framework based on Gauss Pseudospectral Method (GPM) and Nonlinear Programming (NLP) solver are designed to solve the problems efficiently. Advanced initialization strategies are developed to enhance both the convergence and computation efficiency. Numerical results demonstrate the adaptability of the framework for various landing missions, and the performance of successful solution of difficult dynamic problems.

An aircraft noise pollution model for trajectory optimization

Science.gov (United States)

Barkana, A.; Cook, G.

1976-01-01

A mathematical model describing the generation of aircraft noise is developed with the ultimate purpose of reducing noise (noise-optimizing landing trajectories) in terminal areas. While the model is for a specific aircraft (Boeing 737), the methodology would be applicable to a wide variety of aircraft. The model is used to obtain a footprint on the ground inside of which the noise level is at or above 70 dB.

A Piecewise Acceleration-Optimal and Smooth-Jerk Trajectory Planning Method for Robot Manipulator along a Predefined Path

Directory of Open Access Journals (Sweden)

Yuan Chen

2011-09-01

Full Text Available This paper proposes a piecewise acceleration-optimal and smooth-jerk trajectory planning method of robot manipulator. The optimal objective function is given by the weighted sum of two terms having opposite effects: the maximal acceleration and the minimal jerk. Some computing techniques are proposed to determine the optimal solution. These techniques take both the time intervals between two interpolation points and the control points of B-spline function as optimal variables, redefine the kinematic constraints as the constraints of optimal variables, and reformulate the objective function in matrix form. The feasibility of the optimal method is illustrated by simulation and experimental results with pan mechanism for cooking robot.

Trajectory Optimization of Spray Painting Robot for Complex Curved Surface Based on Exponential Mean Bézier Method

Directory of Open Access Journals (Sweden)

Wei Chen

2017-01-01

Full Text Available Automated tool trajectory planning for spray painting robots is still a challenging problem, especially for a large complex curved surface. This paper presents a new method of trajectory optimization for spray painting robot based on exponential mean Bézier method. The definition and the three theorems of exponential mean Bézier curves are discussed. Then a spatial painting path generation method based on exponential mean Bézier curves is developed. A new simple algorithm for trajectory optimization on complex curved surfaces is introduced. A golden section method is adopted to calculate the values. The experimental results illustrate that the exponential mean Bézier curves enhanced flexibility of the path planning, and the trajectory optimization algorithm achieved satisfactory performance. This method can also be extended to other applications.

Validation of Multibody Program to Optimize Simulated Trajectories II Parachute Simulation with Interacting Forces

Science.gov (United States)

Raiszadeh, Behzad; Queen, Eric M.; Hotchko, Nathaniel J.

2009-01-01

A capability to simulate trajectories of multiple interacting rigid bodies has been developed, tested and validated. This capability uses the Program to Optimize Simulated Trajectories II (POST 2). The standard version of POST 2 allows trajectory simulation of multiple bodies without force interaction. In the current implementation, the force interaction between the parachute and the suspended bodies has been modeled using flexible lines, allowing accurate trajectory simulation of the individual bodies in flight. The POST 2 multibody capability is intended to be general purpose and applicable to any parachute entry trajectory simulation. This research paper explains the motivation for multibody parachute simulation, discusses implementation methods, and presents validation of this capability.

A Class of Prediction-Correction Methods for Time-Varying Convex Optimization

Science.gov (United States)

Simonetto, Andrea; Mokhtari, Aryan; Koppel, Alec; Leus, Geert; Ribeiro, Alejandro

2016-09-01

This paper considers unconstrained convex optimization problems with time-varying objective functions. We propose algorithms with a discrete time-sampling scheme to find and track the solution trajectory based on prediction and correction steps, while sampling the problem data at a constant rate of $1/h$, where $h$ is the length of the sampling interval. The prediction step is derived by analyzing the iso-residual dynamics of the optimality conditions. The correction step adjusts for the distance between the current prediction and the optimizer at each time step, and consists either of one or multiple gradient steps or Newton steps, which respectively correspond to the gradient trajectory tracking (GTT) or Newton trajectory tracking (NTT) algorithms. Under suitable conditions, we establish that the asymptotic error incurred by both proposed methods behaves as $O(h^2)$, and in some cases as $O(h^4)$, which outperforms the state-of-the-art error bound of $O(h)$ for correction-only methods in the gradient-correction step. Moreover, when the characteristics of the objective function variation are not available, we propose approximate gradient and Newton tracking algorithms (AGT and ANT, respectively) that still attain these asymptotical error bounds. Numerical simulations demonstrate the practical utility of the proposed methods and that they improve upon existing techniques by several orders of magnitude.

Optimal carbon emissions trajectories when damages depend on the rate or level of global warming

International Nuclear Information System (INIS)

Peck, S.C.; Teisberg, T.J.

1994-01-01

The authors extend earlier work with the Carbon Emissions Trajectory Assessment model (CETA) to consider a number of issues relating to the nature of optimal carbon emissions trajectories. They first explore model results when warming costs are associated with the rate of temperature rise, rather than with its level, as in earlier work. It is found that optimal trajectories are more strongly affected by the degree of non-linearity in the warming cost function than by whether the cost function is driven by the warming level or the warming rate. The authors briefly explore the implications of simple uncertainty and risk aversion for optimal emissions trajectories to be somewhat lower, but that the effect is not noticeable in the near term and not dramatic in the long term; the long term effect on the shadow price of carbon is more marked, however. Finally, they experiment with scaling up the warming cost functions until optimal policies are approximately the same as a policy of stabilising emissions at the 1990 level. Based on the results of this experiment, it is concluded that damages would have to be very high to justify anything like a stabilization policy; and even in this case, a policy allowing intertemporal variation in emissions would be better. 18 refs., 15 figs

Optimal Estimation of Diffusion Coefficients from Noisy Time-Lapse-Recorded Single-Particle Trajectories

DEFF Research Database (Denmark)

Vestergaard, Christian Lyngby

2012-01-01

. The standard method for estimating diusion coecients from single-particle trajectories is based on leastsquares tting to the experimentally measured mean square displacements. This method is highly inecient, since it ignores the high correlations inherent in these. We derive the exact maximum likelihood...... of diusion coecients of hOgg1 repair proteins diusing on stretched uctuating DNA from data previously analyzed using a suboptimal method. Our analysis shows that the proteins have dierent eective diusion coecients and that their diusion coecients are correlated with their residence time on DNA. These results...

Particle swarm optimization of ascent trajectories of multistage launch vehicles

Science.gov (United States)

Pontani, Mauro

2014-02-01

Multistage launch vehicles are commonly employed to place spacecraft and satellites in their operational orbits. If the rocket characteristics are specified, the optimization of its ascending trajectory consists of determining the optimal control law that leads to maximizing the final mass at orbit injection. The numerical solution of a similar problem is not trivial and has been pursued with different methods, for decades. This paper is concerned with an original approach based on the joint use of swarming theory and the necessary conditions for optimality. The particle swarm optimization technique represents a heuristic population-based optimization method inspired by the natural motion of bird flocks. Each individual (or particle) that composes the swarm corresponds to a solution of the problem and is associated with a position and a velocity vector. The formula for velocity updating is the core of the method and is composed of three terms with stochastic weights. As a result, the population migrates toward different regions of the search space taking advantage of the mechanism of information sharing that affects the overall swarm dynamics. At the end of the process the best particle is selected and corresponds to the optimal solution to the problem of interest. In this work the three-dimensional trajectory of the multistage rocket is assumed to be composed of four arcs: (i) first stage propulsion, (ii) second stage propulsion, (iii) coast arc (after release of the second stage), and (iv) third stage propulsion. The Euler-Lagrange equations and the Pontryagin minimum principle, in conjunction with the Weierstrass-Erdmann corner conditions, are employed to express the thrust angles as functions of the adjoint variables conjugate to the dynamics equations. The use of these analytical conditions coming from the calculus of variations leads to obtaining the overall rocket dynamics as a function of seven parameters only, namely the unknown values of the initial state

Optimal critic learning for robot control in time-varying environments.

Science.gov (United States)

Wang, Chen; Li, Yanan; Ge, Shuzhi Sam; Lee, Tong Heng

2015-10-01

In this paper, optimal critic learning is developed for robot control in a time-varying environment. The unknown environment is described as a linear system with time-varying parameters, and impedance control is employed for the interaction control. Desired impedance parameters are obtained in the sense of an optimal realization of the composite of trajectory tracking and force regulation. Q -function-based critic learning is developed to determine the optimal impedance parameters without the knowledge of the system dynamics. The simulation results are presented and compared with existing methods, and the efficacy of the proposed method is verified.

Kinematic Optimization of Robot Trajectories for Thermal Spray Coating Application

Science.gov (United States)

Deng, Sihao; Liang, Hong; Cai, Zhenhua; Liao, Hanlin; Montavon, Ghislain

2014-12-01

Industrial robots are widely used in the field of thermal spray nowadays. Due to their characteristics of high-accuracy and programmable flexibility, spraying on complex geometrical workpieces can be realized in the equipped spray room. However, in some cases, the robots cannot guarantee the process parameters defined by the robot movement, such as the scanning trajectory, spray angle, relative speed between the torch and the substrate, etc., which have distinct influences on heat and mass transfer during the generation of any thermally sprayed coatings. In this study, an investigation on the robot kinematics was proposed to find the rules of motion in a common case. The results showed that the motion behavior of each axis of robot permits to identify the motion problems in the trajectory. This approach allows to optimize the robot trajectory generation in a limited working envelop. It also minimizes the influence of robot performance to achieve a more constant relative scanning speed which is represented as a key parameter in thermal spraying.

An Integrated Tool for Low Thrust Optimal Control Orbit Transfers in Interplanetary Trajectories

Science.gov (United States)

Dargent, T.; Martinot, V.

In the last recent years a significant progress has been made in optimal control orbit transfers using low thrust electrical propulsion for interplanetary missions. The system objective is always the same: decrease the transfer duration and increase the useful satellite mass. The optimum control strategy to perform the minimum time to orbit or the minimum fuel consumption requires the use of sophisticated mathematical tools, most of the time dedicated to a specific mission and therefore hardly reusable. To improve this situation and enable Alcatel Space to perform rather quick trajectory design as requested by mission analysis, we have developed a software tool T-3D dedicated to optimal control orbit transfers which integrates various initial and terminal rendezvous conditions - e.g. fixed arrival time for planet encounter - and engine thrust profiles -e.g. thrust law variation with respect to the distance to the Sun -. This single and quite versatile tool allows to perform analyses like minimum consumption for orbit insertions around a planet from an hyperbolic trajectory, interplanetary orbit transfers, low thrust minimum time multiple revolution orbit transfers, etc… From a mathematical point of view, the software relies on the minimum principle formulation to find the necessary conditions of optimality. The satellite dynamics is a two body model and relies of an equinoctial formulation of the Gauss equation. This choice has been made for numerical purpose and to solve more quickly the two point boundaries values problem. In order to handle the classical problem of co-state variables initialization, problems simpler than the actual one can be solved straight forward by the tool and the values of the co-state variables are kept as first guess for a more complex problem. Finally, a synthesis of the test cases is presented to illustrate the capacities of the tool, mixing examples of interplanetary mission, orbit insertion, multiple revolution orbit transfers

Energy Optimal Trajectories in Human Arm Motion Aiming for Assistive Robots

Directory of Open Access Journals (Sweden)

Lelai Zhou

2017-01-01

Full Text Available The energy expenditure in human arm has been of great interests for seeking optimal human arm trajectories. This paper presents a new way for calculating metabolic energy consumption of human arm motions. The purpose is to reveal the relationship between the energy consumption and the trajectory of arm motion, and further, the acceleration and arm orientation contributions. Human arm motion in horizontal plane is investigated by virtue of Qualisys motion capture system. The motion data is post-processed by a biomechanical model to obtain the metabolic expenditure. Results on the arm motion kinematics, dynamics and metabolic energy consumption, are included.

Optimal Two-Impulse Trajectories with Moderate Flight Time for Earth-Moon Missions

Directory of Open Access Journals (Sweden)

Sandro da Silva Fernandes

2012-01-01

describe the motion of the space vehicle: the well-known patched-conic approximation and two versions of the planar circular restricted three-body problem (PCR3BP. In the patched-conic approximation model, the parameters to be optimized are two: initial phase angle of space vehicle and the first velocity impulse. In the PCR3BP models, the parameters to be optimized are four: initial phase angle of space vehicle, flight time, and the first and the second velocity impulses. In all cases, the optimization problem has one degree of freedom and can be solved by means of an algorithm based on gradient method in conjunction with Newton-Raphson method.

Dynamic trajectory-based couch motion for improvement of radiation therapy trajectories in cranial SRT

Energy Technology Data Exchange (ETDEWEB)

MacDonald, R. Lee [Department of Physics and Atmospheric Science, Dalhousie University, Halifax, Nova Scotia B3H 4R2 (Canada); Thomas, Christopher G., E-mail: Chris.Thomas@cdha.nshealth.ca [Department of Physics and Atmospheric Science, Dalhousie University, Halifax, Nova Scotia B3H 4R2 (Canada); Department of Medical Physics, Nova Scotia Cancer Centre, Queen Elizabeth II Health Sciences Centre, Halifax, Nova Scotia B3H 1V7 (Canada); Department of Radiation Oncology, Dalhousie University, Halifax, Nova Scotia B3H 4R2 (Canada); Department of Radiology, Dalhousie University, Halifax, Nova Scotia B3H 4R2 (Canada)

2015-05-15

Purpose: To investigate potential improvement in external beam stereotactic radiation therapy plan quality for cranial cases using an optimized dynamic gantry and patient support couch motion trajectory, which could minimize exposure to sensitive healthy tissue. Methods: Anonymized patient anatomy and treatment plans of cranial cancer patients were used to quantify the geometric overlap between planning target volumes and organs-at-risk (OARs) based on their two-dimensional projection from source to a plane at isocenter as a function of gantry and couch angle. Published dose constraints were then used as weighting factors for the OARs to generate a map of couch-gantry coordinate space, indicating degree of overlap at each point in space. A couch-gantry collision space was generated by direct measurement on a linear accelerator and couch using an anthropomorphic solid-water phantom. A dynamic, fully customizable algorithm was written to generate a navigable ideal trajectory for the patient specific couch-gantry space. The advanced algorithm can be used to balance the implementation of absolute minimum values of overlap with the clinical practicality of large-scale couch motion and delivery time. Optimized cranial cancer treatment trajectories were compared to conventional treatment trajectories. Results: Comparison of optimized treatment trajectories with conventional treatment trajectories indicated an average decrease in mean dose to the OARs of 19% and an average decrease in maximum dose to the OARs of 12%. Degradation was seen for homogeneity index (6.14% ± 0.67%–5.48% ± 0.76%) and conformation number (0.82 ± 0.02–0.79 ± 0.02), but neither was statistically significant. Removal of OAR constraints from volumetric modulated arc therapy optimization reveals that reduction in dose to OARs is almost exclusively due to the optimized trajectory and not the OAR constraints. Conclusions: The authors’ study indicated that simultaneous couch and gantry motion

Dynamic trajectory-based couch motion for improvement of radiation therapy trajectories in cranial SRT

International Nuclear Information System (INIS)

MacDonald, R. Lee; Thomas, Christopher G.

2015-01-01

Purpose: To investigate potential improvement in external beam stereotactic radiation therapy plan quality for cranial cases using an optimized dynamic gantry and patient support couch motion trajectory, which could minimize exposure to sensitive healthy tissue. Methods: Anonymized patient anatomy and treatment plans of cranial cancer patients were used to quantify the geometric overlap between planning target volumes and organs-at-risk (OARs) based on their two-dimensional projection from source to a plane at isocenter as a function of gantry and couch angle. Published dose constraints were then used as weighting factors for the OARs to generate a map of couch-gantry coordinate space, indicating degree of overlap at each point in space. A couch-gantry collision space was generated by direct measurement on a linear accelerator and couch using an anthropomorphic solid-water phantom. A dynamic, fully customizable algorithm was written to generate a navigable ideal trajectory for the patient specific couch-gantry space. The advanced algorithm can be used to balance the implementation of absolute minimum values of overlap with the clinical practicality of large-scale couch motion and delivery time. Optimized cranial cancer treatment trajectories were compared to conventional treatment trajectories. Results: Comparison of optimized treatment trajectories with conventional treatment trajectories indicated an average decrease in mean dose to the OARs of 19% and an average decrease in maximum dose to the OARs of 12%. Degradation was seen for homogeneity index (6.14% ± 0.67%–5.48% ± 0.76%) and conformation number (0.82 ± 0.02–0.79 ± 0.02), but neither was statistically significant. Removal of OAR constraints from volumetric modulated arc therapy optimization reveals that reduction in dose to OARs is almost exclusively due to the optimized trajectory and not the OAR constraints. Conclusions: The authors’ study indicated that simultaneous couch and gantry motion

Adaptive Mesh Iteration Method for Trajectory Optimization Based on Hermite-Pseudospectral Direct Transcription

Directory of Open Access Journals (Sweden)

Humin Lei

2017-01-01

Full Text Available An adaptive mesh iteration method based on Hermite-Pseudospectral is described for trajectory optimization. The method uses the Legendre-Gauss-Lobatto points as interpolation points; then the state equations are approximated by Hermite interpolating polynomials. The method allows for changes in both number of mesh points and the number of mesh intervals and produces significantly smaller mesh sizes with a higher accuracy tolerance solution. The derived relative error estimate is then used to trade the number of mesh points with the number of mesh intervals. The adaptive mesh iteration method is applied successfully to the examples of trajectory optimization of Maneuverable Reentry Research Vehicle, and the simulation experiment results show that the adaptive mesh iteration method has many advantages.

Optimal Recovery Trajectories for Automatic Ground Collision Avoidance Systems (Auto GCAS)

Science.gov (United States)

Suplisson, Angela W.

The US Air Force recently fielded the F-16 Automatic Ground Collision Avoidance System (Auto GCAS). This system meets the operational requirements of being both aggressive and timely, meaning that extremely agile avoidance maneuvers will be executed at the last second to avoid the ground. This small window of automatic operation maneuvering in close proximity to the ground makes the problem challenging. There currently exists no similar Auto GCAS for manned military 'heavy' aircraft with lower climb performance such as transport, tanker, or bomber aircraft. The F-16 Auto GCAS recovery is a single pre-planned roll to wings-level and 5-g pull-up which is very effective for fighters due to their high g and climb performance, but it is not suitable for military heavy aircraft. This research proposes a new optimal control approach to the ground collision avoidance problem for heavy aircraft by mapping the aggressive and timely requirements of the automatic recovery to the optimal control formulation which includes lateral maneuvers around terrain. This novel mapping creates two ways to pose the optimal control problem for Auto GCAS; one as a Max Distance with a Timely Trigger formulation and the other as a Min Control with an Aggressive Trigger formulation. Further, the optimal path and optimal control admitted by these two formulations are demonstrated to be equivalent at the point the automatic recovery is initiated for the simplified 2-D case. The Min Control formulation was demonstrated to have faster computational speed and was chosen for the 3-D case. Results are presented for representative heavy aircraft scenarios against 3-D digital terrain. The Min Control formulation was then compared to a Multi-Trajectory Auto GCAS with five pre-planned maneuvers. Metrics were developed to quantify the improvement from using an optimal approach versus the pre-planned maneuvers. The proposed optimal Min Control method was demonstrated to require less control or trigger later

Trajectory data analyses for pedestrian space-time activity study.

Science.gov (United States)

Qi, Feng; Du, Fei

2013-02-25

It is well recognized that human movement in the spatial and temporal dimensions has direct influence on disease transmission(1-3). An infectious disease typically spreads via contact between infected and susceptible individuals in their overlapped activity spaces. Therefore, daily mobility-activity information can be used as an indicator to measure exposures to risk factors of infection. However, a major difficulty and thus the reason for paucity of studies of infectious disease transmission at the micro scale arise from the lack of detailed individual mobility data. Previously in transportation and tourism research detailed space-time activity data often relied on the time-space diary technique, which requires subjects to actively record their activities in time and space. This is highly demanding for the participants and collaboration from the participants greatly affects the quality of data(4). Modern technologies such as GPS and mobile communications have made possible the automatic collection of trajectory data. The data collected, however, is not ideal for modeling human space-time activities, limited by the accuracies of existing devices. There is also no readily available tool for efficient processing of the data for human behavior study. We present here a suite of methods and an integrated ArcGIS desktop-based visual interface for the pre-processing and spatiotemporal analyses of trajectory data. We provide examples of how such processing may be used to model human space-time activities, especially with error-rich pedestrian trajectory data, that could be useful in public health studies such as infectious disease transmission modeling. The procedure presented includes pre-processing, trajectory segmentation, activity space characterization, density estimation and visualization, and a few other exploratory analysis methods. Pre-processing is the cleaning of noisy raw trajectory data. We introduce an interactive visual pre-processing interface as well as an

Rapid Preliminary Design of Interplanetary Trajectories Using the Evolutionary Mission Trajectory Generator

Science.gov (United States)

Englander, Jacob

2016-01-01

Preliminary design of interplanetary missions is a highly complex process. The mission designer must choose discrete parameters such as the number of flybys, the bodies at which those flybys are performed, and in some cases the final destination. In addition, a time-history of control variables must be chosen that defines the trajectory. There are often many thousands, if not millions, of possible trajectories to be evaluated. This can be a very expensive process in terms of the number of human analyst hours required. An automated approach is therefore very desirable. This work presents such an approach by posing the mission design problem as a hybrid optimal control problem. The method is demonstrated on notional high-thrust chemical and low-thrust electric propulsion missions. In the low-thrust case, the hybrid optimal control problem is augmented to include systems design optimization.

Optimization of geothermal well trajectory in order to minimize borehole failure

Science.gov (United States)

Dahrabou, A.; Valley, B.; Ladner, F.; Guinot, F.; Meier, P.

2017-12-01

In projects based on Enhanced Geothermal System (EGS) principle, deep boreholes are drilled to low permeability rock masses. As part of the completion operations, the permeability of existing fractures in the rock mass is enhanced by injecting large volumes of water. These stimulation treatments aim at achieving enough water circulation for heat extraction at commercial rates which makes the stimulation operations critical to the project success. The accurate placement of the stimulation treatments requires well completion with effective zonal isolation, and wellbore stability is a prerequisite to all zonal isolation techniques, be it packer sealing or cement placement. In this project, a workflow allowing a fast decision-making process for selecting an optimal well trajectory for EGS projects is developed. In fact, the well is first drilled vertically then based on logging data which are costly (100 KCHF/day), the direction in which the strongly deviated borehole section will be drilled needs to be determined in order to optimize borehole stability and to intersect the highest number of fractures that are oriented favorably for stimulation. The workflow applies to crystalline rock and includes an uncertainty and risk assessment framework. An initial sensitivity study was performed to identify the most influential parameters on borehole stability. The main challenge in these analyses is that the strength and stress profiles are unknown independently. Calibration of a geomechanical model on the observed borehole failure has been performed using data from the Basel Geothermal well BS-1. In a first approximation, a purely elastic-static analytical solution in combination with a purely cohesive failure criterion were used as it provides the most consistent prediction across failure indicators. A systematic analysis of the uncertainty on all parameters was performed to assess the reliability of the optimal trajectory selection. To each drilling scenario, failure

TH-EF-BRB-02: Feasibility of Optimization for Dynamic Trajectory Radiotherapy

Energy Technology Data Exchange (ETDEWEB)

Fix, MK; Frei, D; Volken, W; Terribilini, D; Aebersold, DM; Manser, P [Division of Medical Radiation Physics and Department of Radiation Oncology, Inselspital, Bern University Hospital, and University of Bern, Berne (Switzerland)

2016-06-15

Purpose: Over the last years, volumetric modulated arc therapy (VMAT) has been widely introduced into clinical routine using a coplanar delivery technique. However, VMAT might be improved by including dynamic couch and collimator rotations, leading to dynamic trajectory radiotherapy (DTRT). In this work the feasibility and the potential benefit of DTRT was investigated. Methods: A general framework for the optimization was developed using the Eclipse Scripting Research Application Programming Interface (ESRAPI). Based on contoured target and organs at risk (OARs), the structures are extracted using the ESRAPI. Sampling potential beam directions, regularly distributed on a sphere using a Fibanocci-lattice, the fractional volume-overlap of each OAR and the target is determined and used to establish dynamic gantry-couch movements. Then, for each gantry-couch track the most suitable collimator angle is determined for each control point by optimizing the area between the MLC leaves and the target contour. The resulting dynamic trajectories are used as input to perform the optimization using a research version of the VMAT optimization algorithm and the ESRAPI. The feasibility of this procedure was tested for a clinically motivated head and neck case. Resulting dose distributions for the VMAT plan and for the dynamic trajectory treatment plan were compared based on DVH-parameters. Results: While the DVH for the target is virtually preserved, improvements in maximum dose for the DTRT plan were achieved for all OARs except for the inner-ear, where maximum dose remains the same. The major improvements in maximum dose were 6.5% of the prescribed dose (66 Gy) for the parotid and 5.5% for the myelon and the eye. Conclusion: The result of this work suggests that DTRT has a great potential to reduce dose to OARs with similar target coverage when compared to conventional VMAT treatment plans. This work was supported by Varian Medical Systems. This work was supported by Varian

Quantum trajectories for time-dependent adiabatic master equations

Science.gov (United States)

Yip, Ka Wa; Albash, Tameem; Lidar, Daniel A.

2018-02-01

We describe a quantum trajectories technique for the unraveling of the quantum adiabatic master equation in Lindblad form. By evolving a complex state vector of dimension N instead of a complex density matrix of dimension N2, simulations of larger system sizes become feasible. The cost of running many trajectories, which is required to recover the master equation evolution, can be minimized by running the trajectories in parallel, making this method suitable for high performance computing clusters. In general, the trajectories method can provide up to a factor N advantage over directly solving the master equation. In special cases where only the expectation values of certain observables are desired, an advantage of up to a factor N2 is possible. We test the method by demonstrating agreement with direct solution of the quantum adiabatic master equation for 8-qubit quantum annealing examples. We also apply the quantum trajectories method to a 16-qubit example originally introduced to demonstrate the role of tunneling in quantum annealing, which is significantly more time consuming to solve directly using the master equation. The quantum trajectories method provides insight into individual quantum jump trajectories and their statistics, thus shedding light on open system quantum adiabatic evolution beyond the master equation.

MGA trajectory planning with an ACO-inspired algorithm

Science.gov (United States)

Ceriotti, Matteo; Vasile, Massimiliano

2010-11-01

Given a set of celestial bodies, the problem of finding an optimal sequence of swing-bys, deep space manoeuvres (DSM) and transfer arcs connecting the elements of the set is combinatorial in nature. The number of possible paths grows exponentially with the number of celestial bodies. Therefore, the design of an optimal multiple gravity assist (MGA) trajectory is a NP-hard mixed combinatorial-continuous problem. Its automated solution would greatly improve the design of future space missions, allowing the assessment of a large number of alternative mission options in a short time. This work proposes to formulate the complete automated design of a multiple gravity assist trajectory as an autonomous planning and scheduling problem. The resulting scheduled plan will provide the optimal planetary sequence and a good estimation of the set of associated optimal trajectories. The trajectory model consists of a sequence of celestial bodies connected by two-dimensional transfer arcs containing one DSM. For each transfer arc, the position of the planet and the spacecraft, at the time of arrival, are matched by varying the pericentre of the preceding swing-by, or the magnitude of the launch excess velocity, for the first arc. For each departure date, this model generates a full tree of possible transfers from the departure to the destination planet. Each leaf of the tree represents a planetary encounter and a possible way to reach that planet. An algorithm inspired by ant colony optimization (ACO) is devised to explore the space of possible plans. The ants explore the tree from departure to destination adding one node at the time: every time an ant is at a node, a probability function is used to select a feasible direction. This approach to automatic trajectory planning is applied to the design of optimal transfers to Saturn and among the Galilean moons of Jupiter. Solutions are compared to those found through more traditional genetic-algorithm techniques.

Multi-objective trajectory optimization of Space Manoeuvre Vehicle using adaptive differential evolution and modified game theory

Science.gov (United States)

Chai, Runqi; Savvaris, Al; Tsourdos, Antonios; Chai, Senchun

2017-07-01

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.

Complexity Science Applications to Dynamic Trajectory Management: Research Strategies

Science.gov (United States)

Sawhill, Bruce; Herriot, James; Holmes, Bruce J.; Alexandrov, Natalia

2009-01-01

The promise of the Next Generation Air Transportation System (NextGen) is strongly tied to the concept of trajectory-based operations in the national airspace system. Existing efforts to develop trajectory management concepts are largely focused on individual trajectories, optimized independently, then de-conflicted among each other, and individually re-optimized, as possible. The benefits in capacity, fuel, and time are valuable, though perhaps could be greater through alternative strategies. The concept of agent-based trajectories offers a strategy for automation of simultaneous multiple trajectory management. The anticipated result of the strategy would be dynamic management of multiple trajectories with interacting and interdependent outcomes that satisfy multiple, conflicting constraints. These constraints would include the business case for operators, the capacity case for the Air Navigation Service Provider (ANSP), and the environmental case for noise and emissions. The benefits in capacity, fuel, and time might be improved over those possible under individual trajectory management approaches. The proposed approach relies on computational agent-based modeling (ABM), combinatorial mathematics, as well as application of "traffic physics" concepts to the challenge, and modeling and simulation capabilities. The proposed strategy could support transforming air traffic control from managing individual aircraft behaviors to managing systemic behavior of air traffic in the NAS. A system built on the approach could provide the ability to know when regions of airspace approach being "full," that is, having non-viable local solution space for optimizing trajectories in advance.

Time Optimal Control Laws for Bilinear Systems

Directory of Open Access Journals (Sweden)

Salim Bichiou

2018-01-01

Full Text Available The aim of this paper is to determine the feedforward and state feedback suboptimal time control for a subset of bilinear systems, namely, the control sequence and reaching time. This paper proposes a method that uses Block pulse functions as an orthogonal base. The bilinear system is projected along that base. The mathematical integration is transformed into a product of matrices. An algebraic system of equations is obtained. This system together with specified constraints is treated as an optimization problem. The parameters to determine are the final time, the control sequence, and the states trajectories. The obtained results via the newly proposed method are compared to known analytical solutions.

A globally nonsingular quaternion-based formulation for all-electric satellite trajectory optimization

Science.gov (United States)

Libraro, Paola

The general electric propulsion orbit-raising maneuver of a spacecraft must contend with four main limiting factors: the longer time of flight, multiple eclipses prohibiting continuous thrusting, long exposure to radiation from the Van Allen belt and high power requirement of the electric engines. In order to optimize a low-thrust transfer with respect to these challenges, the choice of coordinates and corresponding equations of motion used to describe the kinematical and dynamical behavior of the satellite is of critical importance. This choice can potentially affect the numerical optimization process as well as limit the set of mission scenarios that can be investigated. To increase the ability to determine the feasible set of mission scenarios able to address the challenges of an all-electric orbit-raising, a set of equations free of any singularities is required to consider a completely arbitrary injection orbit. For this purpose a new quaternion-based formulation of a spacecraft translational dynamics that is globally nonsingular has been developed. The minimum-time low-thrust problem has been solved using the new set of equations of motion inside a direct optimization scheme in order to investigate optimal low-thrust trajectories over the full range of injection orbit inclinations between 0 and 90 degrees with particular focus on high-inclinations. The numerical results consider a specific mission scenario in order to analyze three key aspects of the problem: the effect of the initial guess on the shape and duration of the transfer, the effect of Earth oblateness on transfer time and the role played by, radiation damage and power degradation in all-electric minimum-time transfers. Finally trade-offs between mass and cost savings are introduced through a test case.

Real-time dynamic MLC tracking for inversely optimized arc radiotherapy

DEFF Research Database (Denmark)

Falk, Marianne; af Rosenschöld, Per Munck; Keall, Paul

2010-01-01

Motion compensation with MLC tracking was tested for inversely optimized arc radiotherapy with special attention to the impact of the size of the target displacements and the angle of the leaf trajectory.......Motion compensation with MLC tracking was tested for inversely optimized arc radiotherapy with special attention to the impact of the size of the target displacements and the angle of the leaf trajectory....

Optimizing Likelihood Models for Particle Trajectory Segmentation in Multi-State Systems.

Science.gov (United States)

Young, Dylan Christopher; Scrimgeour, Jan

2018-06-19

Particle tracking offers significant insight into the molecular mechanics that govern the behav- ior of living cells. The analysis of molecular trajectories that transition between different motive states, such as diffusive, driven and tethered modes, is of considerable importance, with even single trajectories containing significant amounts of information about a molecule's environment and its interactions with cellular structures. Hidden Markov models (HMM) have been widely adopted to perform the segmentation of such complex tracks. In this paper, we show that extensive analysis of hidden Markov model outputs using data derived from multi-state Brownian dynamics simulations can be used both for the optimization of the likelihood models used to describe the states of the system and for characterization of the technique's failure mechanisms. This analysis was made pos- sible by the implementation of parallelized adaptive direct search algorithm on a Nvidia graphics processing unit. This approach provides critical information for the visualization of HMM failure and successful design of particle tracking experiments where trajectories contain multiple mobile states. © 2018 IOP Publishing Ltd.

Commercial Aircraft Trajectory Planning based on Multiphase Mixed-Integer Optimal Control

OpenAIRE

Soler Arnedo, Manuel Fernando

2017-01-01

The main goal of this dissertation is to develop optimal control techniques for aircraft trajectory planning looking at reduction of fuel consumption, emissions and overfly charges in flight plans. The calculation of a flight plan involves the consideration of multiple factors. They can be classified as either continuous or discrete, and include nonlinear aircraft performance, atmospheric conditions, wind conditions, airspace structure, amount of departure fuel, and operational...

Computing energy-optimal trajectories for an autonomous underwater vehicle using direct shooting

Directory of Open Access Journals (Sweden)

Inge Spangelo

1992-07-01

Full Text Available Energy-optimal trajectories for an autonomous underwater vehicle can be computed using a numerical solution of the optimal control problem. The vehicle is modeled with the six dimensional nonlinear and coupled equations of motion, controlled with DC-motors in all degrees of freedom. The actuators are modeled and controlled with velocity loops. The dissipated energy is expressed in terms of the control variables as a nonquadratic function. Direct shooting methods, including control vector parameterization (CVP arc used in this study. Numerical calculations are performed and good results are achieved.

Designing train-speed trajectory with energy efficiency and service quality

Science.gov (United States)

Jia, Jiannan; Yang, Kai; Yang, Lixing; Gao, Yuan; Li, Shukai

2018-05-01

With the development of automatic train operations, optimal trajectory design is significant to the performance of train operations in railway transportation systems. Considering energy efficiency and service quality, this article formulates a bi-objective train-speed trajectory optimization model to minimize simultaneously the energy consumption and travel time in an inter-station section. This article is distinct from previous studies in that more sophisticated train driving strategies characterized by the acceleration/deceleration gear, the cruising speed, and the speed-shift site are specifically considered. For obtaining an optimal train-speed trajectory which has equal satisfactory degree on both objectives, a fuzzy linear programming approach is applied to reformulate the objectives. In addition, a genetic algorithm is developed to solve the proposed train-speed trajectory optimization problem. Finally, a series of numerical experiments based on a real-world instance of Beijing-Tianjin Intercity Railway are implemented to illustrate the practicability of the proposed model as well as the effectiveness of the solution methodology.

Improving method of real-time offset tuning for arterial signal coordination using probe trajectory data

Directory of Open Access Journals (Sweden)

Jian Zhang

2016-12-01

Full Text Available In the environment of intelligent transportation systems, traffic condition data would have higher resolution in time and space, which is especially valuable for managing the interrupted traffic at signalized intersections. There exist a lot of algorithms for offset tuning, but few of them take the advantage of modern traffic detection methods such as probe vehicle data. This study proposes a method using probe trajectory data to optimize and adjust offsets in real time. The critical point, representing the changing vehicle dynamics, is first defined as the basis of this approach. Using the critical points related to different states of traffic conditions, such as free flow, queue formation, and dissipation, various traffic status parameters can be estimated, including actual travel speed, queue dissipation rate, and standing queue length. The offset can then be adjusted on a cycle-by-cycle basis. The performance of this approach is evaluated using a simulation network. The results show that the trajectory-based approach can reduce travel time of the coordinated traffic flow when compared with using well-defined offline offset.

Real-time immune-inspired optimum state-of-charge trajectory estimation using upcoming route information preview and neural networks for plug-in hybrid electric vehicles fuel economy

Science.gov (United States)

Mozaffari, Ahmad; Vajedi, Mahyar; Azad, Nasser L.

2015-06-01

The main proposition of the current investigation is to develop a computational intelligence-based framework which can be used for the real-time estimation of optimum battery state-of-charge (SOC) trajectory in plug-in hybrid electric vehicles (PHEVs). The estimated SOC trajectory can be then employed for an intelligent power management to significantly improve the fuel economy of the vehicle. The devised intelligent SOC trajectory builder takes advantage of the upcoming route information preview to achieve the lowest possible total cost of electricity and fossil fuel. To reduce the complexity of real-time optimization, the authors propose an immune system-based clustering approach which allows categorizing the route information into a predefined number of segments. The intelligent real-time optimizer is also inspired on the basis of interactions in biological immune systems, and is called artificial immune algorithm (AIA). The objective function of the optimizer is derived from a computationally efficient artificial neural network (ANN) which is trained by a database obtained from a high-fidelity model of the vehicle built in the Autonomie software. The simulation results demonstrate that the integration of immune inspired clustering tool, AIA and ANN, will result in a powerful framework which can generate a near global optimum SOC trajectory for the baseline vehicle, that is, the Toyota Prius PHEV. The outcomes of the current investigation prove that by taking advantage of intelligent approaches, it is possible to design a computationally efficient and powerful SOC trajectory builder for the intelligent power management of PHEVs.

Optimal UAS Assignments and Trajectories for Persistent Surveillance and Data Collection from a Wireless Sensor Network

Science.gov (United States)

2015-12-24

Optimal UAS Assignments and Trajectories for Persistent Surveillance and Data Collection from a Wireless Sensor Network DISSERTATION Nidal M. Jodeh...ASSIGNMENTS AND TRAJECTORIES FOR PERSISTENT SURVEILLANCE AND DATA COLLECTION FROM A WIRELESS SENSOR NETWORK DISSERTATION Presented to the Faculty...COLLECTION FROM A WIRELESS SENSOR NETWORK Nidal M. Jodeh, B.S., M.A.S., M.S. Lieutenant Colonel, USAF Committee Membership: Richard G. Cobb, PhD Chairman

Shaping low-thrust trajectories with thrust-handling feature

Science.gov (United States)

Taheri, Ehsan; Kolmanovsky, Ilya; Atkins, Ella

2018-02-01

Shape-based methods are becoming popular in low-thrust trajectory optimization due to their fast computation speeds. In existing shape-based methods constraints are treated at the acceleration level but not at the thrust level. These two constraint types are not equivalent since spacecraft mass decreases over time as fuel is expended. This paper develops a shape-based method based on a Fourier series approximation that is capable of representing trajectories defined in spherical coordinates and that enforces thrust constraints. An objective function can be incorporated to minimize overall mission cost, i.e., achieve minimum ΔV . A representative mission from Earth to Mars is studied. The proposed Fourier series technique is demonstrated capable of generating feasible and near-optimal trajectories. These attributes can facilitate future low-thrust mission designs where different trajectory alternatives must be rapidly constructed and evaluated.

Prediction of human gait trajectories during the SSP using a neuromusculoskeletal modeling: A challenge for parametric optimization.

Science.gov (United States)

Seyed, Mohammadali Rahmati; Mostafa, Rostami; Borhan, Beigzadeh

2018-04-27

The parametric optimization techniques have been widely employed to predict human gait trajectories; however, their applications to reveal the other aspects of gait are questionable. The aim of this study is to investigate whether or not the gait prediction model is able to justify the movement trajectories for the higher average velocities. A planar, seven-segment model with sixteen muscle groups was used to represent human neuro-musculoskeletal dynamics. At first, the joint angles, ground reaction forces (GRFs) and muscle activations were predicted and validated for normal average velocity (1.55 m/s) in the single support phase (SSP) by minimizing energy expenditure, which is subject to the non-linear constraints of the gait. The unconstrained system dynamics of extended inverse dynamics (USDEID) approach was used to estimate muscle activations. Then by scaling time and applying the same procedure, the movement trajectories were predicted for higher average velocities (from 2.07 m/s to 4.07 m/s) and compared to the pattern of movement with fast walking speed. The comparison indicated a high level of compatibility between the experimental and predicted results, except for the vertical position of the center of gravity (COG). It was concluded that the gait prediction model can be effectively used to predict gait trajectories for higher average velocities.

Developmental trajectory of time perspective: From children to older adults.

Science.gov (United States)

Chen, Tao; Liu, Lu-Lu; Cui, Ji-Fang; Chen, Xing-Jie; Wang, Ya

2016-12-01

Time perspective is a fundamental dimension of the psychological time construct, with a pervasive and powerful influence on human behavior. However, the developmental trajectory of time perspective across a human lifespan remains unclear. The current study aimed to portray the developmental trajectory of all dimensions of time perspectives from children to older adults in a large sample. A total of 1,901 individuals (aged 9-84 years) completed measures of time perspective. They were then divided into five age groups: children, teenagers, young adults, middle-aged adults, and older adults. Results suggested that each time perspective showed a unique developmental pattern across the lifespan. Moreover, perceived economic situation and education were related to some dimensions of time perspective. © 2016 The Institute of Psychology, Chinese Academy of Sciences and John Wiley & Sons Australia, Ltd.

Programs To Optimize Spacecraft And Aircraft Trajectories

Science.gov (United States)

Brauer, G. L.; Petersen, F. M.; Cornick, D.E.; Stevenson, R.; Olson, D. W.

1994-01-01

POST/6D POST is set of two computer programs providing ability to target and optimize trajectories of powered or unpowered spacecraft or aircraft operating at or near rotating planet. POST treats point-mass, three-degree-of-freedom case. 6D POST treats more-general rigid-body, six-degree-of-freedom (with point masses) case. Used to solve variety of performance, guidance, and flight-control problems for atmospheric and orbital vehicles. Applications include computation of performance or capability of vehicle in ascent, or orbit, and during entry into atmosphere, simulation and analysis of guidance and flight-control systems, dispersion-type analyses and analyses of loads, general-purpose six-degree-of-freedom simulation of controlled and uncontrolled vehicles, and validation of performance in six degrees of freedom. Written in FORTRAN 77 and C language. Two machine versions available: one for SUN-series computers running SunOS(TM) (LAR-14871) and one for Silicon Graphics IRIS computers running IRIX(TM) operating system (LAR-14869).

Time dependent semiclassical tunneling through one dimensional barriers using only real valued trajectories

International Nuclear Information System (INIS)

Herman, Michael F.

2015-01-01

The time independent semiclassical treatment of barrier tunneling has been understood for a very long time. Several semiclassical approaches to time dependent tunneling through barriers have also been presented. These typically involve trajectories for which the position variable is a complex function of time. In this paper, a method is presented that uses only real valued trajectories, thus avoiding the complications that can arise when complex trajectories are employed. This is accomplished by expressing the time dependent wave packet as an integration over momentum. The action function in the exponent in this expression is expanded to second order in the momentum. The expansion is around the momentum, p 0 * , at which the derivative of the real part of the action is zero. The resulting Gaussian integral is then taken. The stationary phase approximation requires that the derivative of the full action is zero at the expansion point, and this leads to a complex initial momentum and complex tunneling trajectories. The “pseudo-stationary phase” approximation employed in this work results in real values for the initial momentum and real valued trajectories. The transmission probabilities obtained are found to be in good agreement with exact quantum results

Time dependent semiclassical tunneling through one dimensional barriers using only real valued trajectories

Energy Technology Data Exchange (ETDEWEB)

Herman, Michael F. [Department of Chemistry, Tulane University, New Orleans, Louisiana 70118 (United States)

2015-10-28

The time independent semiclassical treatment of barrier tunneling has been understood for a very long time. Several semiclassical approaches to time dependent tunneling through barriers have also been presented. These typically involve trajectories for which the position variable is a complex function of time. In this paper, a method is presented that uses only real valued trajectories, thus avoiding the complications that can arise when complex trajectories are employed. This is accomplished by expressing the time dependent wave packet as an integration over momentum. The action function in the exponent in this expression is expanded to second order in the momentum. The expansion is around the momentum, p{sub 0{sup *}}, at which the derivative of the real part of the action is zero. The resulting Gaussian integral is then taken. The stationary phase approximation requires that the derivative of the full action is zero at the expansion point, and this leads to a complex initial momentum and complex tunneling trajectories. The “pseudo-stationary phase” approximation employed in this work results in real values for the initial momentum and real valued trajectories. The transmission probabilities obtained are found to be in good agreement with exact quantum results.

Trajectory optimization for A S.S.T.O. using in-flight LOX collection

Science.gov (United States)

Saint-Mard, M.; Hendrick, P.

A key point for a space mission (launch of a satellite, earth observation,…) is the optimization of the vehicle trajectory in order to burn the smallest quantity of propelant and then maximize the payload. This is true for evay space vehicle, but especially it is a crucial point for a Single-Stage-To-Orbit (SSTO) where the choice of a bad trajectory can result in an unrealizable vehicle due to the large airbreathing part of the flight In this study, we discuss the trajectory optimization for a Vertical Take-Off and Horizontal Landing (VTOHL) SSTO using supersonic in-flight atmospheric oxygen collection during a cruise phase (constant speed & constant altitude). This collected oxygen is stored in the LOX tanks and reused in the final rocket phase. This SSTO bas a Blended Body aerodynamic configuration as the one chosen by Lockheed Martin for its new space launcher (VentureStar and X-33). This SSTO uses rocket engines from take-off to Mach 1.7 and also for the exoatmospheric flight phase (that means for an altitude higher than 30km and a Mach number evolution from 6.8 to about 20). Between these two rocket phases, the SSTO is propelled by a subsonic ramjet. To perform this study, we use 2 computer programs (running on a home Computer): the first one allows to estimate the SSTO performances (TOGW, dry weight, hydrogen and oxygen consumptions) for a fixed payload mass and the second one permits the evaluation of the payload mass for a fixed TOGW.

Singular trajectories: space-time domain topology of developing speckle fields

Science.gov (United States)

Vasil'ev, Vasiliy; Soskin, Marat S.

2010-02-01

It is shown the space-time dynamics of optical singularities is fully described by singularities trajectories in space-time domain, or evolution of transverse coordinates(x, y) in some fixed plane z0. The dynamics of generic developing speckle fields was realized experimentally by laser induced scattering in LiNbO3:Fe photorefractive crystal. The space-time trajectories of singularities can be divided topologically on two classes with essentially different scenario and duration. Some of them (direct topological reactions) consist from nucleation of singularities pair at some (x, y, z0, t) point, their movement and annihilation. They possess form of closed loops with relatively short time of existence. Another much more probable class of trajectories are chain topological reactions. Each of them consists from sequence of links, i.e. of singularities nucleation in various points (xi yi, ti) and following annihilation of both singularities in other space-time points with alien singularities of opposite topological indices. Their topology and properties are established. Chain topological reactions can stop on the borders of a developing speckle field or go to infinity. Examples of measured both types of topological reactions for optical vortices (polarization C points) in scalar (elliptically polarized) natural developing speckle fields are presented.

Optimizing Cruising Routes for Taxi Drivers Using a Spatio-Temporal Trajectory Model

Directory of Open Access Journals (Sweden)

Liang Wu

2017-11-01

Full Text Available Much of the taxi route-planning literature has focused on driver strategies for finding passengers and determining the hot spot pick-up locations using historical global positioning system (GPS trajectories of taxis based on driver experience, distance from the passenger drop-off location to the next passenger pick-up location and the waiting times at recommended locations for the next passenger. The present work, however, considers the average taxi travel speed mined from historical taxi GPS trajectory data and the allocation of cruising routes to more than one taxi driver in a small-scale region to neighboring pick-up locations. A spatio-temporal trajectory model with load balancing allocations is presented to not only explore pick-up/drop-off information but also provide taxi drivers with cruising routes to the recommended pick-up locations. In simulation experiments, our study shows that taxi drivers using cruising routes recommended by our spatio-temporal trajectory model can significantly reduce the average waiting time and travel less distance to quickly find their next passengers, and the load balancing strategy significantly alleviates road loads. These objective measures can help us better understand spatio-temporal traffic patterns and guide taxi navigation.

Conflict Resolution for Wind-Optimal Aircraft Trajectories in North Atlantic Oceanic Airspace with Wind Uncertainties

Science.gov (United States)

Rodionova, Olga; Sridhar, Banavar; Ng, Hok K.

2016-01-01

Air traffic in the North Atlantic oceanic airspace (NAT) experiences very strong winds caused by jet streams. Flying wind-optimal trajectories increases individual flight efficiency, which is advantageous when operating in the NAT. However, as the NAT is highly congested during peak hours, a large number of potential conflicts between flights are detected for the sets of wind-optimal trajectories. Conflict resolution performed at the strategic level of flight planning can significantly reduce the airspace congestion. However, being completed far in advance, strategic planning can only use predicted environmental conditions that may significantly differ from the real conditions experienced further by aircraft. The forecast uncertainties result in uncertainties in conflict prediction, and thus, conflict resolution becomes less efficient. This work considers wind uncertainties in order to improve the robustness of conflict resolution in the NAT. First, the influence of wind uncertainties on conflict prediction is investigated. Then, conflict resolution methods accounting for wind uncertainties are proposed.

Optimal Trajectory Planning For Design of a Crawling Gait in a Robot Using Genetic Algorithm

Directory of Open Access Journals (Sweden)

SMRS. Noorani

2011-03-01

Full Text Available This paper describes a new locomotion mode to use in a crawling robot, inspired of real inchworm. The crawling device is modelled as a mobile manipulator, and for each step of its motion, the associated dynamics relations are derived using Euler-Lagrange equations. Next, the Genetic Algorithm (GA is utilized to optimize the trajectory of the free joints (active actuators in order to minimize the consumed effort (e.g. integral of square of torques over the step time. In this way, the results show a reduction of 5 to 37 percent in torque consumption in comparison with the gradient based method. Finally, numerical simulation for each step motion is presented to validate the proposed algorithm.

Time and Covariance Threshold Triggered Optimal Uncooperative Rendezvous Using Angles-Only Navigation

Directory of Open Access Journals (Sweden)

Yue You

2017-01-01

Full Text Available A time and covariance threshold triggered optimal maneuver planning method is proposed for orbital rendezvous using angles-only navigation (AON. In the context of Yamanaka-Ankersen orbital relative motion equations, the square root unscented Kalman filter (SRUKF AON algorithm is developed to compute the relative state estimations from a low-volume/mass, power saving, and low-cost optical/infrared camera’s observations. Multi-impulsive Hill guidance law is employed in closed-loop linear covariance analysis model, based on which the quantitative relative position robustness and relative velocity robustness index are defined. By balancing fuel consumption, relative position robustness, and relative velocity robustness, we developed a time and covariance threshold triggered two-level optimal maneuver planning method, showing how these results correlate to past methods and missions and how they could potentially influence future ones. Numerical simulation proved that it is feasible to control the spacecraft with a two-line element- (TLE- level uncertain, 34.6% of range, initial relative state to a 100 m v-bar relative station keeping point, at where the trajectory dispersion reduces to 3.5% of range, under a 30% data gap per revolution on account of the eclipse. Comparing with the traditional time triggered maneuver planning method, the final relative position accuracy is improved by one order and the relative trajectory robustness and collision probability are obviously improved and reduced, respectively.

Real-Time Trajectory Generation for Autonomous Nonlinear Flight Systems

National Research Council Canada - National Science Library

Larsen, Michael; Beard, Randal W; McLain, Timothy W

2006-01-01

... to mobile threats such as radar, jammers, and unfriendly aircraft. In Phase 1 of this STTR project, real-time path planning and trajectory generation techniques for two dimensional flight were developed and demonstrated in software simulation...

Distinguished trajectories in time dependent vector fields

OpenAIRE

Madrid, J. A. Jimenez; Mancho, Ana M.

2008-01-01

We introduce a new definition of distinguished trajectory that generalizes the concepts of fixed point and periodic orbit to aperiodic dynamical systems. This new definition is valid for identifying distinguished trajectories with hyperbolic and nonhyperbolic types of stability. The definition is implemented numerically and the procedure consists of determining a path of limit coordinates. It has been successfully applied to known examples of distinguished trajectories. In the context of high...

A Method of Trajectory Design for Manned Asteroids Exploration

Science.gov (United States)

Gan, Q. B.; Zhang, Y.; Zhu, Z. F.; Han, W. H.; Dong, X.

2014-11-01

A trajectory optimization method of the nuclear propulsion manned asteroids exploration is presented. In the case of launching between 2035 and 2065, based on the Lambert transfer orbit, the phases of departure from and return to the Earth are searched at first. Then the optimal flight trajectory in the feasible regions is selected by pruning the flight sequences. Setting the nuclear propulsion flight plan as propel-coast-propel, and taking the minimal mass of aircraft departure as the index, the nuclear propulsion flight trajectory is separately optimized using a hybrid method. With the initial value of the optimized local parameters of each three phases, the global parameters are jointedly optimized. At last, the minimal departure mass trajectory design result is given.

Encoding Time in Feedforward Trajectories of a Recurrent Neural Network Model.

Science.gov (United States)

Hardy, N F; Buonomano, Dean V

2018-02-01

Brain activity evolves through time, creating trajectories of activity that underlie sensorimotor processing, behavior, and learning and memory. Therefore, understanding the temporal nature of neural dynamics is essential to understanding brain function and behavior. In vivo studies have demonstrated that sequential transient activation of neurons can encode time. However, it remains unclear whether these patterns emerge from feedforward network architectures or from recurrent networks and, furthermore, what role network structure plays in timing. We address these issues using a recurrent neural network (RNN) model with distinct populations of excitatory and inhibitory units. Consistent with experimental data, a single RNN could autonomously produce multiple functionally feedforward trajectories, thus potentially encoding multiple timed motor patterns lasting up to several seconds. Importantly, the model accounted for Weber's law, a hallmark of timing behavior. Analysis of network connectivity revealed that efficiency-a measure of network interconnectedness-decreased as the number of stored trajectories increased. Additionally, the balance of excitation (E) and inhibition (I) shifted toward excitation during each unit's activation time, generating the prediction that observed sequential activity relies on dynamic control of the E/I balance. Our results establish for the first time that the same RNN can generate multiple functionally feedforward patterns of activity as a result of dynamic shifts in the E/I balance imposed by the connectome of the RNN. We conclude that recurrent network architectures account for sequential neural activity, as well as for a fundamental signature of timing behavior: Weber's law.

Trajectories of quality of life among Chinese patients diagnosed with nasopharynegeal cancer.

Directory of Open Access Journals (Sweden)

Wendy W T Lam

Full Text Available OBJECTIVE: This secondary longitudinal analysis describes distinct quality of life trajectories during eight months of radiation therapy (RT among patients with nasopharyngeal cancer (NPC and examines factors differentiating these trajectories. METHODS: 253 Chinese patients with NPC scheduled for RT were assessed at pre-treatment, and 4 months and 8 months later on QoL (Chinese version of the FACT-G, optimism, pain, eating function, and patient satisfaction. Latent growth mixture modelling identified different trajectories within each of four QoL domains: Physical, Emotional, Social/family, and Functional well-being. Multinomial logistic regression compared optimism, pain, eating function, and patient satisfaction by trajectories adjusted for demographic and medical characteristics. RESULTS: We identified three distinct trajectories for physical and emotional QoL domains, four trajectories for social/family, and two trajectories for functional domains. Within each domain most patients (physical (77%, emotional (85%, social/family (55% and functional (63% experienced relatively stable high levels of well-being over the 8-month period. Different Physical trajectory patterns were predicted by pain and optimism, whereas for Emotion-domain trajectories pain, optimism, eating enjoyment, patient satisfaction with information, and gender were predictive. Age, appetite, optimism, martial status, and household income predicted Social/family trajectories; household income, eating enjoyment, optimism, and patient satisfaction with information predicted Functional trajectories. CONCLUSION: Most patients with NPC showed high stable QoL during radiotherapy. Optimism predicted good QoL. Symptom impacts varied by QoL domain. Information satisfaction was protective in emotional and functional well-being, reflecting the importance in helping patients to establish a realistic expectation of treatment impacts.

Annotated trajectories and the Space-Time-Cube

DEFF Research Database (Denmark)

Kveladze, Irma; Kraak, Menno-Jan

2012-01-01

too, because these have not been adopted to the purpose. A suitable solution to display and study movements is the Space-Time-Cube (STC), the graphic representation of Hägerstrand’s Time Geography. This paper answers the question of how suitable the STC is to display the above describe combination...... of trajectories and annotations to avoid the visual clutter. Although the STC will be described here as a stand-alone solution it is part of a wider geovisual analytics environment and is used next to maps and other graphics to be able to answer user questions. As a case study data set the travel log data...

Parametric Optimal Design of a Parallel Schönflies-Motion Robot under Pick-And-Place Trajectory Constraints

DEFF Research Database (Denmark)

Wu, Guanglei; Bai, Shaoping; Hjørnet, Preben

2015-01-01

This paper deals with the parametric optimum design of a parallel Schoenflies-motion robot, named "Ragnar", designed for fast and flexible pick-and-place applications. The robot architecture admits a rectangular workspace, which can utilize the shop-floor space efficiently. In this work......, the parametric models of the transmission quality, elasto-statics and dynamics are established. By taking into consideration of design requirements and pick-and-place trajectory, a comprehensive multi-objective optimization problem is formulated to optimize both kinematic and dynamic performances. The Pareto......-front is obtained, which provides optimal solutions to the robot design. Robot prototyping work based on the optimal results is described....

Trajectory reshaping based guidance with impact time and angle constraints

Directory of Open Access Journals (Sweden)

Zhao Yao

2016-08-01

Full Text Available This study presents a novel impact time and angle constrained guidance law for homing missiles. The guidance law is first developed with the prior-assumption of a stationary target, which is followed by the practical extension to a maneuvering target scenario. To derive the closed-form guidance law, the trajectory reshaping technique is utilized and it results in defining a specific polynomial function with two unknown coefficients. These coefficients are determined to satisfy the impact time and angle constraints as well as the zero miss distance. Furthermore, the proposed guidance law has three additional guidance gains as design parameters which make it possible to adjust the guided trajectory according to the operational conditions and missile’s capability. Numerical simulations are presented to validate the effectiveness of the proposed guidance law.

A study of variable thrust, variable specific impulse trajectories for solar system exploration

Science.gov (United States)

Sakai, Tadashi

A study has been performed to determine the advantages and disadvantages of variable thrust and variable Isp (specific impulse) trajectories for solar system exploration. There have been several numerical research efforts for variable thrust, variable Isp, power-limited trajectory optimization problems. All of these results conclude that variable thrust, variable Isp (variable specific impulse, or VSI) engines are superior to constant thrust, constant Isp (constant specific impulse; or CSI) engines. However, most of these research efforts assume a mission from Earth to Mars, and some of them further assume that these planets are circular and coplanar. Hence they still lack the generality. This research has been conducted to answer the following questions: (1) Is a VSI engine always better than a CSI engine or a high thrust engine for any mission to any planet with any time of flight considering lower propellant mass as the sole criterion? (2) If a planetary swing-by is used for a VSI trajectory, is the fuel savings of a VSI swing-by trajectory better than that of a CSI swing-by or high thrust swing-by trajectory? To support this research, an unique, new computer-based interplanetary trajectory calculation program has been created. This program utilizes a calculus of variations algorithm to perform overall optimization of thrust, Isp, and thrust vector direction along a trajectory that minimizes fuel consumption for interplanetary travel. It is assumed that the propulsion system is power-limited, and thus the compromise between thrust and Isp is a variable to be optimized along the flight path. This program is capable of optimizing not only variable thrust trajectories but also constant thrust trajectories in 3-D space using a planetary ephemeris database. It is also capable of conducting planetary swing-bys. Using this program, various Earth-originating trajectories have been investigated and the optimized results have been compared to traditional CSI and high

Cost, Time, and Risk Assessment of Different Wave Energy Converter Technology Development Trajectories: Preprint

Energy Technology Data Exchange (ETDEWEB)

Weber, Jochem W [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Laird, Daniel [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Costello, Ronan [Wave Venture; Roberts, Jesse [Sandia National Laboratories; Bull, Diana [Sandia National Laboratories; Babarit, Aurelien [Ecole Centrale de Nantes; Nielsen, Kim [Ramboll; Ferreira, Claudio Bittencourt [DNV-GL; Kennedy, Ben [Wave Venture

2017-09-14

This paper presents a comparative assessment of three fundamentally different wave energy converter technology development trajectories. The three technology development trajectories are expressed and visualised as a function of technology readiness levels and technology performance levels. The assessment shows that development trajectories that initially prioritize technology readiness over technology performance are likely to require twice the development time, consume a threefold of the development cost, and are prone to a risk of technical or commercial failure of one order of magnitude higher than those development trajectories that initially prioritize technology performance over technology readiness.

Multi-Body Ski Jumper Model with Nonlinear Dynamic Inversion Muscle Control for Trajectory Optimization

Directory of Open Access Journals (Sweden)

Patrick Piprek

2018-02-01

Full Text Available This paper presents an approach to model a ski jumper as a multi-body system for an optimal control application. The modeling is based on the constrained Newton-Euler-Equations. Within this paper the complete multi-body modeling methodology as well as the musculoskeletal modeling is considered. For the musculoskeletal modeling and its incorporation in the optimization model, we choose a nonlinear dynamic inversion control approach. This approach uses the muscle models as nonlinear reference models and links them to the ski jumper movement by a control law. This strategy yields a linearized input-output behavior, which makes the optimal control problem easier to solve. The resulting model of the ski jumper can then be used for trajectory optimization whose results are compared to literature jumps. Ultimately, this enables the jumper to get a very detailed feedback of the flight. To achieve the maximal jump length, exact positioning of his body with respect to the air can be displayed.

Methods for control over learning individual trajectory

Science.gov (United States)

Mitsel, A. A.; Cherniaeva, N. V.

2015-09-01

The article discusses models, methods and algorithms of determining student's optimal individual educational trajectory. A new method of controlling the learning trajectory has been developed as a dynamic model of learning trajectory control, which uses score assessment to construct a sequence of studied subjects.

Using rapidly-exploring random tree-based algorithms to find smooth and optimal trajectories

CSIR Research Space (South Africa)

Matebese, B

2012-10-01

Full Text Available -exploring random tree-based algorithms to fi nd smooth and optimal trajectories B MATEBESE1, MK BANDA2 AND S UTETE1 1CSIR Modelling and Digital Science, PO Box 395, Pretoria, South Africa, 0001 2Department of Applied Mathematics, Stellenbosch University... and complex environments. The RRT algorithm is the most popular and has the ability to find a feasible solution faster than other algorithms. The drawback of using RRT is that, as the number of samples increases, the probability that the algorithm converges...

Synthesis of asymmetric movement trajectories in timed rhythmic behaviour by means of frequency modulation.

Science.gov (United States)

Waadeland, Carl Haakon

2017-01-01

Results from different empirical investigations on gestural aspects of timed rhythmic movements indicate that the production of asymmetric movement trajectories is a feature that seems to be a common characteristic of various performances of repetitive rhythmic patterns. The behavioural or neural origin of these asymmetrical trajectories is, however, not identified. In the present study we outline a theoretical model that is capable of producing syntheses of asymmetric movement trajectories documented in empirical investigations by Balasubramaniam et al. (2004). Characteristic qualities of the extension/flexion profiles in the observed asymmetric trajectories are reproduced, and we conduct an experiment similar to Balasubramaniam et al. (2004) to show that the empirically documented movement trajectories and our modelled approximations share the same spectral components. The model is based on an application of frequency modulated movements, and a theoretical interpretation offered by the model is to view paced rhythmic movements as a result of an unpaced movement being "stretched" and "compressed", caused by the presence of a metronome. We discuss our model construction within the framework of event-based and emergent timing, and argue that a change between these timing modes might be reflected by the strength of the modulation in our model. Copyright © 2016 Elsevier B.V. All rights reserved.

A new approach to motion control of torque-constrained manipulators by using time-scaling of reference trajectories

Energy Technology Data Exchange (ETDEWEB)

Moreno-Valenzuela, Javier; Orozco-Manriquez, Ernesto [Digital del IPN, CITEDI-IPN, Tijuana, (Mexico)

2009-12-15

We introduce a control scheme based on using a trajectory tracking controller and an algorithm for on-line time scaling of the reference trajectories. The reference trajectories are time-scaled according to the measured tracking errors and the detected torque/acceleration saturation. Experiments are presented to illustrate the advantages of the proposed approach

A new approach to motion control of torque-constrained manipulators by using time-scaling of reference trajectories

International Nuclear Information System (INIS)

Moreno-Valenzuela, Javier; Orozco-Manriquez, Ernesto

2009-01-01

We introduce a control scheme based on using a trajectory tracking controller and an algorithm for on-line time scaling of the reference trajectories. The reference trajectories are time-scaled according to the measured tracking errors and the detected torque/acceleration saturation. Experiments are presented to illustrate the advantages of the proposed approach

Low Thrust Trajectory Design for GSFC Missions

Data.gov (United States)

National Aeronautics and Space Administration — The Evolutionary Mission Trajectory Generator (EMTG) is a global trajectory optimization tool. EMTG is intended for use in designing interplanetary missions which...

Quantum Dynamics with Short-Time Trajectories and Minimal Adaptive Basis Sets.

Science.gov (United States)

Saller, Maximilian A C; Habershon, Scott

2017-07-11

Methods for solving the time-dependent Schrödinger equation via basis set expansion of the wave function can generally be categorized as having either static (time-independent) or dynamic (time-dependent) basis functions. We have recently introduced an alternative simulation approach which represents a middle road between these two extremes, employing dynamic (classical-like) trajectories to create a static basis set of Gaussian wavepackets in regions of phase-space relevant to future propagation of the wave function [J. Chem. Theory Comput., 11, 8 (2015)]. Here, we propose and test a modification of our methodology which aims to reduce the size of basis sets generated in our original scheme. In particular, we employ short-time classical trajectories to continuously generate new basis functions for short-time quantum propagation of the wave function; to avoid the continued growth of the basis set describing the time-dependent wave function, we employ Matching Pursuit to periodically minimize the number of basis functions required to accurately describe the wave function. Overall, this approach generates a basis set which is adapted to evolution of the wave function while also being as small as possible. In applications to challenging benchmark problems, namely a 4-dimensional model of photoexcited pyrazine and three different double-well tunnelling problems, we find that our new scheme enables accurate wave function propagation with basis sets which are around an order-of-magnitude smaller than our original trajectory-guided basis set methodology, highlighting the benefits of adaptive strategies for wave function propagation.

DUKSUP: A Computer Program for High Thrust Launch Vehicle Trajectory Design and Optimization

Science.gov (United States)

Spurlock, O. Frank; Williams, Craig H.

2015-01-01

From the late 1960s through 1997, the leadership of NASAs Intermediate and Large class unmanned expendable launch vehicle projects resided at the NASA Lewis (now Glenn) Research Center (LeRC). One of LeRCs primary responsibilities --- trajectory design and performance analysis --- was accomplished by an internally-developed analytic three dimensional computer program called DUKSUP. Because of its Calculus of Variations-based optimization routine, this code was generally more capable of finding optimal solutions than its contemporaries. A derivation of optimal control using the Calculus of Variations is summarized including transversality, intermediate, and final conditions. The two point boundary value problem is explained. A brief summary of the codes operation is provided, including iteration via the Newton-Raphson scheme and integration of variational and motion equations via a 4th order Runge-Kutta scheme. Main subroutines are discussed. The history of the LeRC trajectory design efforts in the early 1960s is explained within the context of supporting the Centaur upper stage program. How the code was constructed based on the operation of the AtlasCentaur launch vehicle, the limits of the computers of that era, the limits of the computer programming languages, and the missions it supported are discussed. The vehicles DUKSUP supported (AtlasCentaur, TitanCentaur, and ShuttleCentaur) are briefly described. The types of missions, including Earth orbital and interplanetary, are described. The roles of flight constraints and their impact on launch operations are detailed (such as jettisoning hardware on heating, Range Safety, ground station tracking, and elliptical parking orbits). The computer main frames on which the code was hosted are described. The applications of the code are detailed, including independent check of contractor analysis, benchmarking, leading edge analysis, and vehicle performance improvement assessments. Several of DUKSUPs many major impacts on

A hybrid scheme for real-time prediction of bus trajectories

NARCIS (Netherlands)

Fadaei, Masoud; Cats, O.; Bhaskar, Ashish

2016-01-01

The uncertainty associated with public transport services can be partially counteracted by developing real-time models to predict downstream service conditions. In this study, a hybrid approach for predicting bus trajectories by integrating multiple predictors is proposed. The prediction model

Design of Quiet Rotorcraft Approach Trajectories: Verification Phase

Science.gov (United States)

Padula, Sharon L.

2010-01-01

Flight testing that is planned for October 2010 will provide an opportunity to evaluate rotorcraft trajectory optimization techniques. The flight test will involve a fully instrumented MD-902 helicopter, which will be flown over an array of microphones. In this work, the helicopter approach trajectory is optimized via a multiobjective genetic algorithm to improve community noise, passenger comfort, and pilot acceptance. Previously developed optimization strategies are modified to accommodate new helicopter data and to increase pilot acceptance. This paper describes the MD-902 trajectory optimization plus general optimization strategies and modifications that are needed to reduce the uncertainty in noise predictions. The constraints that are imposed by the flight test conditions and characteristics of the MD-902 helicopter limit the testing possibilities. However, the insights that will be gained through this research will prove highly valuable.

Task Decomposition Module For Telerobot Trajectory Generation

Science.gov (United States)

Wavering, Albert J.; Lumia, Ron

1988-10-01

A major consideration in the design of trajectory generation software for a Flight Telerobotic Servicer (FTS) is that the FTS will be called upon to perform tasks which require a diverse range of manipulator behaviors and capabilities. In a hierarchical control system where tasks are decomposed into simpler and simpler subtasks, the task decomposition module which performs trajectory planning and execution should therefore be able to accommodate a wide range of algorithms. In some cases, it will be desirable to plan a trajectory for an entire motion before manipulator motion commences, as when optimizing over the entire trajectory. Many FTS motions, however, will be highly sensory-interactive, such as moving to attain a desired position relative to a non-stationary object whose position is periodically updated by a vision system. In this case, the time-varying nature of the trajectory may be handled either by frequent replanning using updated sensor information, or by using an algorithm which creates a less specific state-dependent plan that determines the manipulator path as the trajectory is executed (rather than a priori). This paper discusses a number of trajectory generation techniques from these categories and how they may be implemented in a task decompo-sition module of a hierarchical control system. The structure, function, and interfaces of the proposed trajectory gener-ation module are briefly described, followed by several examples of how different algorithms may be performed by the module. The proposed task decomposition module provides a logical structure for trajectory planning and execution, and supports a large number of published trajectory generation techniques.

Optimal time travel in the Godel universe

OpenAIRE

Natario, Jose

2011-01-01

Using the theory of optimal rocket trajectories in general relativity, recently developed in arXiv:1105.5235, we present a candidate for the minimum total integrated acceleration closed timelike curve in the Godel universe, and give evidence for its minimality. The total integrated acceleration of this curve is lower than Malament's conjectured value (Malament, 1984), as was already implicit in the work of Manchak (Manchak, 2011); however, Malament's conjecture does seem to hold for periodic ...

Time-Space Topology Optimization

DEFF Research Database (Denmark)

Jensen, Jakob Søndergaard

2008-01-01

A method for space-time topology optimization is outlined. The space-time optimization strategy produces structures with optimized material distributions that vary in space and in time. The method is demonstrated for one-dimensional wave propagation in an elastic bar that has a time-dependent Young......’s modulus and is subjected to a transient load. In the example an optimized dynamic structure is demonstrated that compresses a propagating Gauss pulse....

Bio-inspired varying subspace based computational framework for a class of nonlinear constrained optimal trajectory planning problems.

Science.gov (United States)

Xu, Y; Li, N

2014-09-01

Biological species have produced many simple but efficient rules in their complex and critical survival activities such as hunting and mating. A common feature observed in several biological motion strategies is that the predator only moves along paths in a carefully selected or iteratively refined subspace (or manifold), which might be able to explain why these motion strategies are effective. In this paper, a unified linear algebraic formulation representing such a predator-prey relationship is developed to simplify the construction and refinement process of the subspace (or manifold). Specifically, the following three motion strategies are studied and modified: motion camouflage, constant absolute target direction and local pursuit. The framework constructed based on this varying subspace concept could significantly reduce the computational cost in solving a class of nonlinear constrained optimal trajectory planning problems, particularly for the case with severe constraints. Two non-trivial examples, a ground robot and a hypersonic aircraft trajectory optimization problem, are used to show the capabilities of the algorithms in this new computational framework.

Bio-inspired varying subspace based computational framework for a class of nonlinear constrained optimal trajectory planning problems

International Nuclear Information System (INIS)

Xu, Y; Li, N

2014-01-01

Biological species have produced many simple but efficient rules in their complex and critical survival activities such as hunting and mating. A common feature observed in several biological motion strategies is that the predator only moves along paths in a carefully selected or iteratively refined subspace (or manifold), which might be able to explain why these motion strategies are effective. In this paper, a unified linear algebraic formulation representing such a predator–prey relationship is developed to simplify the construction and refinement process of the subspace (or manifold). Specifically, the following three motion strategies are studied and modified: motion camouflage, constant absolute target direction and local pursuit. The framework constructed based on this varying subspace concept could significantly reduce the computational cost in solving a class of nonlinear constrained optimal trajectory planning problems, particularly for the case with severe constraints. Two non-trivial examples, a ground robot and a hypersonic aircraft trajectory optimization problem, are used to show the capabilities of the algorithms in this new computational framework. (paper)

A study of the application of singular perturbation theory. [development of a real time algorithm for optimal three dimensional aircraft maneuvers

Science.gov (United States)

Mehra, R. K.; Washburn, R. B.; Sajan, S.; Carroll, J. V.

1979-01-01

A hierarchical real time algorithm for optimal three dimensional control of aircraft is described. Systematic methods are developed for real time computation of nonlinear feedback controls by means of singular perturbation theory. The results are applied to a six state, three control variable, point mass model of an F-4 aircraft. Nonlinear feedback laws are presented for computing the optimal control of throttle, bank angle, and angle of attack. Real Time capability is assessed on a TI 9900 microcomputer. The breakdown of the singular perturbation approximation near the terminal point is examined Continuation methods are examined to obtain exact optimal trajectories starting from the singular perturbation solutions.

Influence of the snubbers and matching transformer on an optimal trajectory controlled resonant transistor DC/DC converter

Directory of Open Access Journals (Sweden)

Bankov Dimitrov Nikolay

2012-01-01

Full Text Available This work examines a series resonant DC/DC optimal trajectory controlled converter during operation above resonant frequency, taking into account the influence of the snubbers and matching transformer. We obtain expressions for the load characteristics, boundary curves between possible modes and limits of the soft commutation area. Computer simulation and experimental observation confirm the theoretical results.

Low Thrust Trajectory Design for GSFC Missions Project

Data.gov (United States)

National Aeronautics and Space Administration — The Evolutionary Mission Trajectory Generator (EMTG) is a global trajectory optimization tool. EMTG is intended for use in designing interplanetary missions which...

A study on optimal motion for a robot manipulator amid obstacles

International Nuclear Information System (INIS)

Park, Jong Keun

1997-01-01

Optimal motion for a robot manipulator is obtained by nonlinear programming. The objective of optimal motion is minimizing energy consumption of manipulator arm with fixed traveling time in the presence of obstacles. The geometric path is not predetermined. The total trajectory is described in terms of cubic B-spline polynomials and the coefficients of them are obtained to minimize a specific performance index. Obstacle avoidance is performed by the method that the square sum of penetration growth distances between every obstacles and robot links is included in the performance index with appropriate weighting coefficient. In all examples tested here, the solutions were converged to unique optimal trajectories from different initial ones. The optimal geometric path obtained in this research can be used in minimum time trajectory planning. (author)

Trajectory planning of mobile robots using indirect solution of optimal control method in generalized point-to-point task

Science.gov (United States)

Nazemizadeh, M.; Rahimi, H. N.; Amini Khoiy, K.

2012-03-01

This paper presents an optimal control strategy for optimal trajectory planning of mobile robots by considering nonlinear dynamic model and nonholonomic constraints of the system. The nonholonomic constraints of the system are introduced by a nonintegrable set of differential equations which represent kinematic restriction on the motion. The Lagrange's principle is employed to derive the nonlinear equations of the system. Then, the optimal path planning of the mobile robot is formulated as an optimal control problem. To set up the problem, the nonlinear equations of the system are assumed as constraints, and a minimum energy objective function is defined. To solve the problem, an indirect solution of the optimal control method is employed, and conditions of the optimality derived as a set of coupled nonlinear differential equations. The optimality equations are solved numerically, and various simulations are performed for a nonholonomic mobile robot to illustrate effectiveness of the proposed method.

Flight test trajectory control analysis

Science.gov (United States)

Walker, R.; Gupta, N.

1983-01-01

Recent extensions to optimal control theory applied to meaningful linear models with sufficiently flexible software tools provide powerful techniques for designing flight test trajectory controllers (FTTCs). This report describes the principal steps for systematic development of flight trajectory controllers, which can be summarized as planning, modeling, designing, and validating a trajectory controller. The techniques have been kept as general as possible and should apply to a wide range of problems where quantities must be computed and displayed to a pilot to improve pilot effectiveness and to reduce workload and fatigue. To illustrate the approach, a detailed trajectory guidance law is developed and demonstrated for the F-15 aircraft flying the zoom-and-pushover maneuver.

Visualization of particle trajectories in time-varying electromagnetic fields by CAVE-type virtual reality system

International Nuclear Information System (INIS)

Ohno, Nobuaki; Ohtani, Hiroaki; Horiuchi, Ritoku; Matsuoka, Daisuke

2012-01-01

The particle kinetic effects play an important role in breaking the frozen-in condition and exciting collisionless magnetic reconnection in high temperature plasmas. Because this effect is originating from a complex thermal motion near reconnection point, it is very important to examine particle trajectories using scientific visualization technique, especially in the presence of plasma instability. We developed interactive visualization environment for the particle trajectories in time-varying electromagnetic fields in the CAVE-type virtual reality system based on VFIVE, which is interactive visualization software for the CAVE system. From the analysis of ion trajectories using the particle simulation data, it was found that time-varying electromagnetic fields around the reconnection region accelerate ions toward the downstream region. (author)

Review on abort trajectory for manned lunar landing mission

Institute of Scientific and Technical Information of China (English)

无

2010-01-01

Abort trajectory is a passage that ensures the astronauts to return safely to the earth when an emergency occurs. Firstly,the essential elements of mission abort are analyzed entirely based on summarizing the existing studies. Then,abort trajectory requirement and rational selection for different flight phases of typical manned lunar mission are discussed specifically. Considering a trade-off between the two primary constrains of an abort,the return time of flight and energy requirement,a general optimizing method for mission abort is proposed. Finally,some suggestions are given for China’s future manned lunar landing mission.

Optimal starting conditions for the rendezvous maneuver: Analytical and computational approach

Science.gov (United States)

Ciarcia, Marco

The three-dimensional rendezvous between two spacecraft is considered: a target spacecraft on a circular orbit around the Earth and a chaser spacecraft initially on some elliptical orbit yet to be determined. The chaser spacecraft has variable mass, limited thrust, and its trajectory is governed by three controls, one determining the thrust magnitude and two determining the thrust direction. We seek the time history of the controls in such a way that the propellant mass required to execute the rendezvous maneuver is minimized. Two cases are considered: (i) time-to-rendezvous free and (ii) time-to-rendezvous given, respectively equivalent to (i) free angular travel and (ii) fixed angular travel for the target spacecraft. The above problem has been studied by several authors under the assumption that the initial separation coordinates and the initial separation velocities are given, hence known initial conditions for the chaser spacecraft. In this paper, it is assumed that both the initial separation coordinates and initial separation velocities are free except for the requirement that the initial chaser-to-target distance is given so as to prevent the occurrence of trivial solutions. Two approaches are employed: optimal control formulation (Part A) and mathematical programming formulation (Part B). In Part A, analyses are performed with the multiple-subarc sequential gradient-restoration algorithm for optimal control problems. They show that the fuel-optimal trajectory is zero-bang, namely it is characterized by two subarcs: a long coasting zero-thrust subarc followed by a short powered max-thrust braking subarc. While the thrust direction of the powered subarc is continuously variable for the optimal trajectory, its replacement with a constant (yet optimized) thrust direction produces a very efficient guidance trajectory. Indeed, for all values of the initial distance, the fuel required by the guidance trajectory is within less than one percent of the fuel required

Study of particle swarm optimization particle trajectories

CSIR Research Space (South Africa)

Van den Bergh, F

2006-01-01

Full Text Available . These theoretical studies concentrate mainly on simplified PSO systems. This paper overviews current theoretical studies, and extend these studies to investigate particle trajectories for general swarms to include the influence of the inertia term. The paper also...

The trajectory prediction of spacecraft by grey method

International Nuclear Information System (INIS)

Wang, Qiyue; Wang, Zhongyu; Zhang, Zili; Wang, Yanqing; Zhou, Weihu

2016-01-01

The real-time and high-precision trajectory prediction of a moving object is a core technology in the field of aerospace engineering. The real-time monitoring and tracking technology are also significant guarantees of aerospace equipment. A dynamic trajectory prediction method called grey dynamic filter (GDF) which combines the dynamic measurement theory and grey system theory is proposed. GDF can use coordinates of the current period to extrapolate coordinates of the following period. At meantime, GDF can also keep the instantaneity of measured coordinates by the metabolism model. In this paper the optimal model length of GDF is firstly selected to improve the prediction accuracy. Then the simulation for uniformly accelerated motion and variably accelerated motion is conducted. The simulation results indicate that the mean composite position error of GDF prediction is one-fifth to that of Kalman filter (KF). By using a spacecraft landing experiment, the prediction accuracy of GDF is compared with the KF method and the primitive grey method (GM). The results show that the motion trajectory of spacecraft predicted by GDF is much closer to actual trajectory than the other two methods. The mean composite position error calculated by GDF is one-eighth to KF and one-fifth to GM respectively. (paper)

A Segment-Based Trajectory Similarity Measure in the Urban Transportation Systems.

Science.gov (United States)

Mao, Yingchi; Zhong, Haishi; Xiao, Xianjian; Li, Xiaofang

2017-03-06

With the rapid spread of built-in GPS handheld smart devices, the trajectory data from GPS sensors has grown explosively. Trajectory data has spatio-temporal characteristics and rich information. Using trajectory data processing techniques can mine the patterns of human activities and the moving patterns of vehicles in the intelligent transportation systems. A trajectory similarity measure is one of the most important issues in trajectory data mining (clustering, classification, frequent pattern mining, etc.). Unfortunately, the main similarity measure algorithms with the trajectory data have been found to be inaccurate, highly sensitive of sampling methods, and have low robustness for the noise data. To solve the above problems, three distances and their corresponding computation methods are proposed in this paper. The point-segment distance can decrease the sensitivity of the point sampling methods. The prediction distance optimizes the temporal distance with the features of trajectory data. The segment-segment distance introduces the trajectory shape factor into the similarity measurement to improve the accuracy. The three kinds of distance are integrated with the traditional dynamic time warping algorithm (DTW) algorithm to propose a new segment-based dynamic time warping algorithm (SDTW). The experimental results show that the SDTW algorithm can exhibit about 57%, 86%, and 31% better accuracy than the longest common subsequence algorithm (LCSS), and edit distance on real sequence algorithm (EDR) , and DTW, respectively, and that the sensitivity to the noise data is lower than that those algorithms.

Influence of drag force upon the shortest time trajectory of an aircraft

Directory of Open Access Journals (Sweden)

Andrei CRAIFALEANU

2015-06-01

Full Text Available The shortest time trajectory of an aircraft between two given locations is determined using a simple mathematical model. By taking into account the drag force (viscous friction force with the air, a problem of variational calculus is obtained which consists in determining two functions that minimize a functional, subject to a non-holonomic constraint. The trajectory is determined directly, by numerical integration of Euler equations with multipliers. Three types of drag forces were considered: constant, linear and quadratic. The results are verified through comparison to the values obtained from numerical minimization of the involved functional approximate forms.

Depressed trajectory SLBMs: A technical evaluation and arms control possibilities

International Nuclear Information System (INIS)

Gronlund, L.; Wright, D.C.

1992-01-01

SLBMs (sea-launched ballistic missiles) flown on depressed trajectories would have short flight times, comparable to escape times of bombers and launch times of ICBMs, thus raising the possibility of short time-of-flight (STOF) nuclear attacks. We assess the depressed trajectory (DT) capability of existing SLBMs by calculating the flight times, atmospheric loading on the booster, reentry heating on the reentry vehicle (RV), and degradation of accuracy for a DT SLBM. We find that current US and CIS SLBMs flown on depressed trajectories would have the capability to attack bomber bases at ranges of up to about 2,000 kilometers, and possibly at ranges up to 3,000 kilometers. To target bombers based furthest inland, a new high-velocity booster might be required, and attacking hardened targets would require a maneuvering RV (MaRV). We conclude that DT capabilities could be effectively controlled by the combination of an apogee restriction on the flight testing of existing SLBMs and bans on the development of high-velocity boosters and MaRVs, and that, in view of their inherent STOF capabilities, deep cuts in the number of SLBMs or their elimination might be desirable for an optimal minimum-deterrent force structure

Robust Optimal Adaptive Trajectory Tracking Control of Quadrotor Helicopter

Directory of Open Access Journals (Sweden)

M. Navabi

Full Text Available Abstract This paper focuses on robust optimal adaptive control strategy to deal with tracking problem of a quadrotor unmanned aerial vehicle (UAV in presence of parametric uncertainties, actuator amplitude constraints, and unknown time-varying external disturbances. First, Lyapunov-based indirect adaptive controller optimized by particle swarm optimization (PSO is developed for multi-input multi-output (MIMO nonlinear quadrotor to prevent input constraints violation, and then disturbance observer-based control (DOBC technique is aggregated with the control system to attenuate the effects of disturbance generated by an exogenous system. The performance of synthesis control method is evaluated by a new performance index function in time-domain, and the stability analysis is carried out using Lyapunov theory. Finally, illustrative numerical simulations are conducted to demonstrate the effectiveness of the presented approach in altitude and attitude tracking under several conditions, including large time-varying uncertainty, exogenous disturbance, and control input constraints.

New applications of the H-reversal trajectory using solar sails

International Nuclear Information System (INIS)

Zeng Xiangyuan; Baoyin Hexi; Li Junfeng; Gong Shengping

2011-01-01

Advanced solar sailing has been an increasingly attractive propulsion system for highly non-Keplerian orbits. Three new applications of the orbital angular momentum reversal (H-reversal) trajectories using solar sails are presented: space observation, heliocentric orbit transfer and collision orbits with asteroids. A theoretical proof for the existence of double H-reversal trajectories (referred to as 'H2RTs') is given, and the characteristics of the H2RTs are introduced before a discussion of the mission applications. A new family of H2RTs was obtained using a 3D dynamic model of the two-body frame. In a time-optimal control model, the minimum period H2RTs both inside and outside the ecliptic plane were examined using an ideal solar sail. Due to the quasi-heliostationary property at its two symmetrical aphelia, the H2RTs were deemed suitable for space observation. For the second application, the heliocentric transfer orbit was able to function as the time-optimal H-reversal trajectory, since its perihelion velocity is a circular or elliptic velocity. Such a transfer orbit can place the sailcraft into a clockwise orbit in the ecliptic plane, with a high inclination or displacement above or below the Sun. The third application of the H-reversal trajectory was simulated impacting an asteroid passing near Earth in a head-on collision. The collision point can be designed through selecting different perihelia or different launch windows. Sample orbits of each application were presented through numerical simulation. The results can serve as a reference for theoretical research and engineering design.

Parallel computations of molecular dynamics trajectories using the stochastic path approach

Science.gov (United States)

Zaloj, Veaceslav; Elber, Ron

2000-06-01

A novel protocol to parallelize molecular dynamics trajectories is discussed and tested on a cluster of PCs running the NT operating system. The new technique does not propagate the solution in small time steps, but uses instead a global optimization of a functional of the whole trajectory. The new approach is especially attractive for parallel and distributed computing and its advantages (and disadvantages) are presented. Two numerical examples are discussed: (a) A conformational transition in a solvated dipeptide, and (b) The R→T conformational transition in solvated hemoglobin.

Actor-critic-based optimal tracking for partially unknown nonlinear discrete-time systems.

Science.gov (United States)

Kiumarsi, Bahare; Lewis, Frank L

2015-01-01

This paper presents a partially model-free adaptive optimal control solution to the deterministic nonlinear discrete-time (DT) tracking control problem in the presence of input constraints. The tracking error dynamics and reference trajectory dynamics are first combined to form an augmented system. Then, a new discounted performance function based on the augmented system is presented for the optimal nonlinear tracking problem. In contrast to the standard solution, which finds the feedforward and feedback terms of the control input separately, the minimization of the proposed discounted performance function gives both feedback and feedforward parts of the control input simultaneously. This enables us to encode the input constraints into the optimization problem using a nonquadratic performance function. The DT tracking Bellman equation and tracking Hamilton-Jacobi-Bellman (HJB) are derived. An actor-critic-based reinforcement learning algorithm is used to learn the solution to the tracking HJB equation online without requiring knowledge of the system drift dynamics. That is, two neural networks (NNs), namely, actor NN and critic NN, are tuned online and simultaneously to generate the optimal bounded control policy. A simulation example is given to show the effectiveness of the proposed method.

Rapid Optimal Generation Algorithm for Terrain Following Trajectory Based on Optimal Control

Institute of Scientific and Technical Information of China (English)

杨剑影; 张海; 谢邦荣; 尹健

2004-01-01

Based on the optimal control theory, a 3-dimensionnal direct generation algorithm is proposed for anti-ground low altitude penetration tasks under complex terrain. By optimizing the terrain following(TF) objective function,terrain coordinate system, missile dynamic model and control vector, the TF issue is turning into the improved optimal control problem whose mathmatical model is simple and need not solve the second order terrain derivative. Simulation results prove that this method is reasonable and feasible. The TF precision is in the scope from 0.3 m to 3.0 m,and the planning time is less than 30 min. This method have the strongpionts such as rapidness, precision and has great application value.

Lunar Cube Transfer Trajectory Options

Science.gov (United States)

Folta, David; Dichmann, Donald James; Clark, Pamela E.; Haapala, Amanda; Howell, Kathleen

2015-01-01

Numerous Earth-Moon trajectory and lunar orbit options are available for Cubesat missions. Given the limited Cubesat injection infrastructure, transfer trajectories are contingent upon the modification of an initial condition of the injected or deployed orbit. Additionally, these transfers can be restricted by the selection or designs of Cubesat subsystems such as propulsion or communication. Nonetheless, many trajectory options can b e considered which have a wide range of transfer duration, fuel requirements, and final destinations. Our investigation of potential trajectories highlights several options including deployment from low Earth orbit (LEO) geostationary transfer orbits (GTO) and higher energy direct lunar transfer and the use of longer duration Earth-Moon dynamical systems. For missions with an intended lunar orbit, much of the design process is spent optimizing a ballistic capture while other science locations such as Sun-Earth libration or heliocentric orbits may simply require a reduced Delta-V imparted at a convenient location along the trajectory.

Lucas–Kanade fluid trajectories for time-resolved PIV

International Nuclear Information System (INIS)

Yegavian, Robin; Leclaire, Benjamin; Illoul, Cédric; Losfeld, Gilles; Champagnat, Frédéric

2016-01-01

We introduce a new method for estimating fluid trajectories in time-resolved PIV. It relies on a Lucas–Kanade paradigm and consists in a simple and direct extension of a two-frame estimation with FOLKI-PIV (Champagnat et al 2011 Exp. Fluids 50 1169–82). The so-called Lucas–Kanade Fluid Trajectories (LKFT) are assumed to be polynomial in time, and are found as the minimizer of a global functional, in which displacements are sought so as to match the intensities of a series of images pairs in the sequence, in the least-squares sense. All pairs involve the central image, similar to other recent time-resolved approaches (FTC (Lynch and Scarano 2013 Meas. Sci. Technol . 24 035305) and FTEE (Jeon et al 2014 Exp. Fluids 55 1–16)). As switching from a two-frame to a time-resolved objective simply amounts to adding terms in a functional, no significant additional algorithmic element is required. Similar to FOLKI-PIV the method is very well suited for GPU acceleration, which is an important feature as computational complexity increases with the image sequence size. Tests on synthetic data exhibiting peak-locking show that increasing the image sequence size strongly reduces both associated bias and random error, and that LKFT has a remaining total error comparable to that of FTEE on this case. Results on case B of the third PIV challenge (Stanislas et al 2008 Exp. Fluids 45 27–71) also show its ability to drastically reduce the error in situations with low signal-to-noise ratio. These results are finally confirmed on experimental images acquired in the near-field of a low Reynolds number jet. Strong reductions in peak-locking, spatial and temporal noise compared to two-frame estimation are also observed, on the displacement components themselves, as well as on spatial or temporal derivatives, such as vorticity and material acceleration. (paper)

Efficient Trajectory Options Allocation for the Collaborative Trajectory Options Program

Science.gov (United States)

Rodionova, Olga; Arneson, Heather; Sridhar, Banavar; Evans, Antony

2017-01-01

The Collaborative Trajectory Options Program (CTOP) is a Traffic Management Initiative (TMI) intended to control the air traffic flow rates at multiple specified Flow Constrained Areas (FCAs), where demand exceeds capacity. CTOP allows flight operators to submit the desired Trajectory Options Set (TOS) for each affected flight with associated Relative Trajectory Cost (RTC) for each option. CTOP then creates a feasible schedule that complies with capacity constraints by assigning affected flights with routes and departure delays in such a way as to minimize the total cost while maintaining equity across flight operators. The current version of CTOP implements a Ration-by-Schedule (RBS) scheme, which assigns the best available options to flights based on a First-Scheduled-First-Served heuristic. In the present study, an alternative flight scheduling approach is developed based on linear optimization. Results suggest that such an approach can significantly reduce flight delays, in the deterministic case, while maintaining equity as defined using a Max-Min fairness scheme.

Optimal Stochastic Control Problem for General Linear Dynamical Systems in Neuroscience

Directory of Open Access Journals (Sweden)

Yan Chen

2017-01-01

Full Text Available This paper considers a d-dimensional stochastic optimization problem in neuroscience. Suppose the arm’s movement trajectory is modeled by high-order linear stochastic differential dynamic system in d-dimensional space, the optimal trajectory, velocity, and variance are explicitly obtained by using stochastic control method, which allows us to analytically establish exact relationships between various quantities. Moreover, the optimal trajectory is almost a straight line for a reaching movement; the optimal velocity bell-shaped and the optimal variance are consistent with the experimental Fitts law; that is, the longer the time of a reaching movement, the higher the accuracy of arriving at the target position, and the results can be directly applied to designing a reaching movement performed by a robotic arm in a more general environment.

On the analytic and numeric optimisation of airplane trajectories under real atmospheric conditions

Science.gov (United States)

Gonzalo, J.; Domínguez, D.; López, D.

2014-12-01

From the beginning of aviation era, economic constraints have forced operators to continuously improve the planning of the flights. The revenue is proportional to the cost per flight and the airspace occupancy. Many methods, the first started in the middle of last century, have explore analytical, numerical and artificial intelligence resources to reach the optimal flight planning. In parallel, advances in meteorology and communications allow an almost real-time knowledge of the atmospheric conditions and a reliable, error-bounded forecast for the near future. Thus, apart from weather risks to be avoided, airplanes can dynamically adapt their trajectories to minimise their costs. International regulators are aware about these capabilities, so it is reasonable to envisage some changes to allow this dynamic planning negotiation to soon become operational. Moreover, current unmanned airplanes, very popular and often small, suffer the impact of winds and other weather conditions in form of dramatic changes in their performance. The present paper reviews analytic and numeric solutions for typical trajectory planning problems. Analytic methods are those trying to solve the problem using the Pontryagin principle, where influence parameters are added to state variables to form a split condition differential equation problem. The system can be solved numerically -indirect optimisation- or using parameterised functions -direct optimisation-. On the other hand, numerical methods are based on Bellman's dynamic programming (or Dijkstra algorithms), where the fact that two optimal trajectories can be concatenated to form a new optimal one if the joint point is demonstrated to belong to the final optimal solution. There is no a-priori conditions for the best method. Traditionally, analytic has been more employed for continuous problems whereas numeric for discrete ones. In the current problem, airplane behaviour is defined by continuous equations, while wind fields are given in a

A New Methodology for Solving Trajectory Planning and Dynamic Load-Carrying Capacity of a Robot Manipulator

Directory of Open Access Journals (Sweden)

Wanjin Guo

2016-01-01

Full Text Available A new methodology using a direct method for obtaining the best found trajectory planning and maximum dynamic load-carrying capacity (DLCC is presented for a 5-degree of freedom (DOF hybrid robot manipulator. A nonlinear constrained multiobjective optimization problem is formulated with four objective functions, namely, travel time, total energy involved in the motion, joint jerks, and joint acceleration. The vector of decision variables is defined by the sequence of the time-interval lengths associated with each two consecutive via-points on the desired trajectory of the 5-DOF robot generalized coordinates. Then this vector of decision variables is computed in order to minimize the cost function (which is the weighted sum of these four objective functions subject to constraints on joint positions, velocities, acceleration, jerks, forces/torques, and payload mass. Two separate approaches are proposed to deal with the trajectory planning problem and the maximum DLCC calculation for the 5-DOF robot manipulator using an evolutionary optimization technique. The adopted evolutionary algorithm is the elitist nondominated sorting genetic algorithm (NSGA-II. A numerical application is performed for obtaining best found solutions of trajectory planning and maximum DLCC calculation for the 5-DOF hybrid robot manipulator.

Complete description of photon trajectories in the Kerr-Newman space-time

Energy Technology Data Exchange (ETDEWEB)

Calvani, M [Padua Univ. (Italy). Ist. di Astronomia; Turolla, R [International School for Advanced Studies, Trieste (Italy)

1981-08-01

The complete description of null trajectories in the Kerr-Newman space-time is given in terms of the parameters of the source and of the constants of motion. The conditions for orbital and vortical motion are studied in detail and the locus of turning points is given for any choice of the parameters.

Encoding sensory and motor patterns as time-invariant trajectories in recurrent neural networks.

Science.gov (United States)

Goudar, Vishwa; Buonomano, Dean V

2018-03-14

Much of the information the brain processes and stores is temporal in nature-a spoken word or a handwritten signature, for example, is defined by how it unfolds in time. However, it remains unclear how neural circuits encode complex time-varying patterns. We show that by tuning the weights of a recurrent neural network (RNN), it can recognize and then transcribe spoken digits. The model elucidates how neural dynamics in cortical networks may resolve three fundamental challenges: first, encode multiple time-varying sensory and motor patterns as stable neural trajectories; second, generalize across relevant spatial features; third, identify the same stimuli played at different speeds-we show that this temporal invariance emerges because the recurrent dynamics generate neural trajectories with appropriately modulated angular velocities. Together our results generate testable predictions as to how recurrent networks may use different mechanisms to generalize across the relevant spatial and temporal features of complex time-varying stimuli. © 2018, Goudar et al.

Robust Trajectory Optimization of a Ski Jumper for Uncertainty Influence and Safety Quantification

Directory of Open Access Journals (Sweden)

Patrick Piprek

2018-02-01

Full Text Available This paper deals with the development of a robust optimal control framework for a previously developed multi-body ski jumper simulation model by the authors. This framework is used to model uncertainties acting on the jumper during his jump, e.g., wind or mass, to enhance the performance, but also to increase the fairness and safety of the competition. For the uncertainty modeling the method of generalized polynomial chaos together with the discrete expansion by stochastic collocation is applied: This methodology offers a very flexible framework to model multiple uncertainties using a small number of required optimizations to calculate an uncertain trajectory. The results are then compared to the results of the Latin-Hypercube sampling method to show the correctness of the applied methods. Finally, the results are examined with respect to two major metrics: First, the influence of the uncertainties on the jumper, his positioning with respect to the air, and his maximal achievable flight distance are examined. Then, the results are used in a further step to quantify the safety of the jumper.

Introduction to optimal control theory

International Nuclear Information System (INIS)

Agrachev, A.A.

2002-01-01

These are lecture notes of the introductory course in Optimal Control theory treated from the geometric point of view. Optimal Control Problem is reduced to the study of controls (and corresponding trajectories) leading to the boundary of attainable sets. We discuss Pontryagin Maximum Principle, basic existence results, and apply these tools to concrete simple optimal control problems. Special sections are devoted to the general theory of linear time-optimal problems and linear-quadratic problems. (author)

Time-domain finite elements in optimal control with application to launch-vehicle guidance. PhD. Thesis

Science.gov (United States)

Bless, Robert R.

1991-01-01

A time-domain finite element method is developed for optimal control problems. The theory derived is general enough to handle a large class of problems including optimal control problems that are continuous in the states and controls, problems with discontinuities in the states and/or system equations, problems with control inequality constraints, problems with state inequality constraints, or problems involving any combination of the above. The theory is developed in such a way that no numerical quadrature is necessary regardless of the degree of nonlinearity in the equations. Also, the same shape functions may be employed for every problem because all strong boundary conditions are transformed into natural or weak boundary conditions. In addition, the resulting nonlinear algebraic equations are very sparse. Use of sparse matrix solvers allows for the rapid and accurate solution of very difficult optimization problems. The formulation is applied to launch-vehicle trajectory optimization problems, and results show that real-time optimal guidance is realizable with this method. Finally, a general problem solving environment is created for solving a large class of optimal control problems. The algorithm uses both FORTRAN and a symbolic computation program to solve problems with a minimum of user interaction. The use of symbolic computation eliminates the need for user-written subroutines which greatly reduces the setup time for solving problems.

Sensitivity Analysis and Mitigation with Applications to Ballistic and Low-thrust Trajectory Design

Science.gov (United States)

Alizadeh, Iman

The ever increasing desire to expand space mission capabilities within the limited budgets of space industries requires new approaches to the old problem of spacecraft trajectory design. For example, recent initiatives for space exploration involve developing new tools to design low-cost, fail-safe trajectories to visit several potential destinations beyond our celestial neighborhood such as Jupiter's moons, asteroids, etc. Designing and navigating spacecraft trajectories to reach these destinations safely are complex and challenging. In particular, fundamental questions of orbital stability imposed by planetary protection requirements are not easily taken into account by standard optimal control schemes. The event of temporary engine loss or an unexpected missed thrust can indeed quickly lead to impact with planetary bodies or other unrecoverable trajectories. While electric propulsion technology provides superior efficiency compared to chemical engines, the very low-control authority and engine performance degradation can impose higher risk to the mission in strongly perturbed orbital environments. The risk is due to the complex gravitational field and its associated chaotic dynamics which causes large navigation dispersions in a short time if left un-controlled. Moreover, in these situations it can be outside the low-thrust propulsion system capability to correct the spacecraft trajectory in a reasonable time frame. These concerns can lead to complete or partial mission failure or even an infeasible mission concept at the early design stage. The goal of this research is to assess and increase orbital stability of ballistic and low-thrust transfer trajectories in multi-body systems. In particular, novel techniques are presented to characterize sensitivity and improve recovery characteristics of ballistic and low-thrust trajectories in unstable orbital environments. The techniques developed are based on perturbation analysis around ballistic trajectories to

Rapid space trajectory generation using a Fourier series shape-based approach

Science.gov (United States)

Taheri, Ehsan

With the insatiable curiosity of human beings to explore the universe and our solar system, it is essential to benefit from larger propulsion capabilities to execute efficient transfers and carry more scientific equipments. In the field of space trajectory optimization the fundamental advances in using low-thrust propulsion and exploiting the multi-body dynamics has played pivotal role in designing efficient space mission trajectories. The former provides larger cumulative momentum change in comparison with the conventional chemical propulsion whereas the latter results in almost ballistic trajectories with negligible amount of propellant. However, the problem of space trajectory design translates into an optimal control problem which is, in general, time-consuming and very difficult to solve. Therefore, the goal of the thesis is to address the above problem by developing a methodology to simplify and facilitate the process of finding initial low-thrust trajectories in both two-body and multi-body environments. This initial solution will not only provide mission designers with a better understanding of the problem and solution but also serves as a good initial guess for high-fidelity optimal control solvers and increases their convergence rate. Almost all of the high-fidelity solvers enjoy the existence of an initial guess that already satisfies the equations of motion and some of the most important constraints. Despite the nonlinear nature of the problem, it is sought to find a robust technique for a wide range of typical low-thrust transfers with reduced computational intensity. Another important aspect of our developed methodology is the representation of low-thrust trajectories by Fourier series with which the number of design variables reduces significantly. Emphasis is given on simplifying the equations of motion to the possible extent and avoid approximating the controls. These facts contribute to speeding up the solution finding procedure. Several example

Refining Markov state models for conformational dynamics using ensemble-averaged data and time-series trajectories

Science.gov (United States)

Matsunaga, Y.; Sugita, Y.

2018-06-01

A data-driven modeling scheme is proposed for conformational dynamics of biomolecules based on molecular dynamics (MD) simulations and experimental measurements. In this scheme, an initial Markov State Model (MSM) is constructed from MD simulation trajectories, and then, the MSM parameters are refined using experimental measurements through machine learning techniques. The second step can reduce the bias of MD simulation results due to inaccurate force-field parameters. Either time-series trajectories or ensemble-averaged data are available as a training data set in the scheme. Using a coarse-grained model of a dye-labeled polyproline-20, we compare the performance of machine learning estimations from the two types of training data sets. Machine learning from time-series data could provide the equilibrium populations of conformational states as well as their transition probabilities. It estimates hidden conformational states in more robust ways compared to that from ensemble-averaged data although there are limitations in estimating the transition probabilities between minor states. We discuss how to use the machine learning scheme for various experimental measurements including single-molecule time-series trajectories.

A Novel Approach to Identifying Trajectories of Mobility Change in Older Adults.

Directory of Open Access Journals (Sweden)

Rachel E Ward

Full Text Available To validate trajectories of late-life mobility change using a novel approach designed to overcome the constraints of modest sample size and few follow-up time points.Using clinical reasoning and distribution-based methodology, we identified trajectories of mobility change (Late Life Function and Disability Instrument across 2 years in 391 participants age ≥65 years from a prospective cohort study designed to identify modifiable impairments predictive of mobility in late-life. We validated our approach using model fit indices and comparing baseline mobility-related factors between trajectories.Model fit indices confirmed that the optimal number of trajectories were between 4 and 6. Mobility-related factors varied across trajectories with the most unfavorable values in poor mobility trajectories and the most favorable in high mobility trajectories. These factors included leg strength, trunk extension endurance, knee flexion range of motion, limb velocity, physical performance measures, and the number and prevalence of medical conditions including osteoarthritis and back pain.Our findings support the validity of this approach and may facilitate the investigation of a broader scope of research questions within aging populations of varied sizes and traits.

Optimal time travel in the Gödel universe

Science.gov (United States)

Natário, José

2012-04-01

Using the theory of optimal rocket trajectories in general relativity, recently developed in Henriques and Natário (2011), we present a candidate for the minimum total integrated acceleration closed timelike curve in the Gödel universe, and give evidence for its minimality. The total integrated acceleration of this curve is lower than Malament's conjectured value (Malament 1984), as was already implicit in the work of Manchak (Gen. Relativ. Gravit. 51-60, 2011); however, Malament's conjecture does seem to hold for periodic closed timelike curves.

Echolocating bats use a nearly time-optimal strategy to intercept prey.

Directory of Open Access Journals (Sweden)

Kaushik Ghose

2006-05-01

Full Text Available Acquisition of food in many animal species depends on the pursuit and capture of moving prey. Among modern humans, the pursuit and interception of moving targets plays a central role in a variety of sports, such as tennis, football, Frisbee, and baseball. Studies of target pursuit in animals, ranging from dragonflies to fish and dogs to humans, have suggested that they all use a constant bearing (CB strategy to pursue prey or other moving targets. CB is best known as the interception strategy employed by baseball outfielders to catch ballistic fly balls. CB is a time-optimal solution to catch targets moving along a straight line, or in a predictable fashion--such as a ballistic baseball, or a piece of food sinking in water. Many animals, however, have to capture prey that may make evasive and unpredictable maneuvers. Is CB an optimum solution to pursuing erratically moving targets? Do animals faced with such erratic prey also use CB? In this paper, we address these questions by studying prey capture in an insectivorous echolocating bat. Echolocating bats rely on sonar to pursue and capture flying insects. The bat's prey may emerge from foliage for a brief time, fly in erratic three-dimensional paths before returning to cover. Bats typically take less than one second to detect, localize and capture such insects. We used high speed stereo infra-red videography to study the three dimensional flight paths of the big brown bat, Eptesicus fuscus, as it chased erratically moving insects in a dark laboratory flight room. We quantified the bat's complex pursuit trajectories using a simple delay differential equation. Our analysis of the pursuit trajectories suggests that bats use a constant absolute target direction strategy during pursuit. We show mathematically that, unlike CB, this approach minimizes the time it takes for a pursuer to intercept an unpredictably moving target. Interestingly, the bat's behavior is similar to the interception strategy

Echolocating bats use a nearly time-optimal strategy to intercept prey.

Science.gov (United States)

Ghose, Kaushik; Horiuchi, Timothy K; Krishnaprasad, P S; Moss, Cynthia F

2006-05-01

Acquisition of food in many animal species depends on the pursuit and capture of moving prey. Among modern humans, the pursuit and interception of moving targets plays a central role in a variety of sports, such as tennis, football, Frisbee, and baseball. Studies of target pursuit in animals, ranging from dragonflies to fish and dogs to humans, have suggested that they all use a constant bearing (CB) strategy to pursue prey or other moving targets. CB is best known as the interception strategy employed by baseball outfielders to catch ballistic fly balls. CB is a time-optimal solution to catch targets moving along a straight line, or in a predictable fashion--such as a ballistic baseball, or a piece of food sinking in water. Many animals, however, have to capture prey that may make evasive and unpredictable maneuvers. Is CB an optimum solution to pursuing erratically moving targets? Do animals faced with such erratic prey also use CB? In this paper, we address these questions by studying prey capture in an insectivorous echolocating bat. Echolocating bats rely on sonar to pursue and capture flying insects. The bat's prey may emerge from foliage for a brief time, fly in erratic three-dimensional paths before returning to cover. Bats typically take less than one second to detect, localize and capture such insects. We used high speed stereo infra-red videography to study the three dimensional flight paths of the big brown bat, Eptesicus fuscus, as it chased erratically moving insects in a dark laboratory flight room. We quantified the bat's complex pursuit trajectories using a simple delay differential equation. Our analysis of the pursuit trajectories suggests that bats use a constant absolute target direction strategy during pursuit. We show mathematically that, unlike CB, this approach minimizes the time it takes for a pursuer to intercept an unpredictably moving target. Interestingly, the bat's behavior is similar to the interception strategy implemented in some

Linear quadratic optimization for positive LTI system

Science.gov (United States)

Muhafzan, Yenti, Syafrida Wirma; Zulakmal

2017-05-01

Nowaday the linear quadratic optimization subject to positive linear time invariant (LTI) system constitute an interesting study considering it can become a mathematical model of variety of real problem whose variables have to nonnegative and trajectories generated by these variables must be nonnegative. In this paper we propose a method to generate an optimal control of linear quadratic optimization subject to positive linear time invariant (LTI) system. A sufficient condition that guarantee the existence of such optimal control is discussed.

Real-time synchronization of batch trajectories for on-line multivariate statistical process control using Dynamic Time Warping

OpenAIRE

González Martínez, Jose María; Ferrer Riquelme, Alberto José; Westerhuis, Johan A.

2011-01-01

This paper addresses the real-time monitoring of batch processes with multiple different local time trajectories of variables measured during the process run. For Unfold Principal Component Analysis (U-PCA)—or Unfold Partial Least Squares (U-PLS)-based on-line monitoring of batch processes, batch runs need to be synchronized, not only to have the same time length, but also such that key events happen at the same time. An adaptation from Kassidas et al.'s approach [1] will be introduced to ach...

Child personality facets and overreactive parenting as predictors of aggression and rule-breaking trajectories from childhood to adolescence.

Science.gov (United States)

Becht, Andrik I; Prinzie, Peter; Deković, Maja; van den Akker, Alithe L; Shiner, Rebecca L

2016-05-01

This study examined trajectories of aggression and rule breaking during the transition from childhood to adolescence (ages 9-15), and determined whether these trajectories were predicted by lower order personality facets, overreactive parenting, and their interaction. At three time points separated by 2-year intervals, mothers and fathers reported on their children's aggression and rule breaking (N = 290, M age = 8.8 years at Time 1). At Time 1, parents reported on their children's personality traits and their own overreactivity. Growth mixture modeling identified three aggression trajectories (low decreasing, high decreasing, and high increasing) and two rule-breaking trajectories (low and high). Lower optimism and compliance and higher energy predicted trajectories for both aggression and rule breaking, whereas higher expressiveness and irritability and lower orderliness and perseverance were unique risk factors for increasing aggression into adolescence. Lower concentration was a unique risk factor for increasing rule breaking. Parental overreactivity predicted higher trajectories of aggression but not rule breaking. Only two Trait × Overreactivity interactions were found. Our results indicate that personality facets could differentiate children at risk for different developmental trajectories of aggression and rule breaking.

Trip-oriented travel time prediction (TOTTP) with historical vehicle trajectories

Science.gov (United States)

Xu, Tao; Li, Xiang; Claramunt, Christophe

2018-06-01

Accurate travel time prediction is undoubtedly of importance to both traffic managers and travelers. In highly-urbanized areas, trip-oriented travel time prediction (TOTTP) is valuable to travelers rather than traffic managers as the former usually expect to know the travel time of a trip which may cross over multiple road sections. There are two obstacles to the development of TOTTP, including traffic complexity and traffic data coverage.With large scale historical vehicle trajectory data and meteorology data, this research develops a BPNN-based approach through integrating multiple factors affecting trip travel time into a BPNN model to predict trip-oriented travel time for OD pairs in urban network. Results of experiments demonstrate that it helps discover the dominate trends of travel time changes daily and weekly, and the impact of weather conditions is non-trivial.

Virtual decoupling flight control via real-time trajectory synthesis and tracking

Science.gov (United States)

Zhang, Xuefu

The production of the General Aviation industry has declined in the past 25 years. Ironically, however, the increasing demand for air travel as a fast, safe, and high-quality mode of transportation has been far from satisfied. Addressing this demand shortfall with personal air transportation necessitates advanced systems for navigation, guidance, control, flight management, and flight traffic control. Among them, an effective decoupling flight control system will not only improve flight quality, safety, and simplicity, and increase air space usage, but also reduce expenses on pilot initial and current training, and thus expand the current market and explore new markets. Because of the formidable difficulties encountered in the actual decoupling of non-linear, time-variant, and highly coupled flight control systems through traditional approaches, a new approach, which essentially converts the decoupling problem into a real-time trajectory synthesis and tracking problem, is employed. Then, the converted problem is solved and a virtual decoupling effect is achieved. In this approach, a trajectory in inertial space can be predefined and dynamically modified based on the flight mission and the pilot's commands. A feedforward-feedback control architecture is constructed to guide the airplane along the trajectory as precisely as possible. Through this approach, the pilot has much simpler, virtually decoupled control of the airplane in terms of speed, flight path angle and horizontal radius of curvature. To verify and evaluate this approach, extensive computer simulation is performed. A great deal of test cases are designed for the flight control under different flight conditions. The simulation results show that our decoupling strategy is satisfactory and promising, and therefore the research can serve as a consolidated foundation for future practical applications.

From the trajectory to the density memory

International Nuclear Information System (INIS)

Cakir, Rasit; Krokhin, Arkadii; Grigolini, Paolo

2007-01-01

In this paper we discuss the connection between trajectory and density memory. The first form of memory is a property of a stochastic trajectory, whose stationary correlation function shows that the fluctuation at a given time depends on the earlier fluctuations. The density memory is a property of a collection of trajectories, whose density time evolution is described by a time convoluted equation showing that the density time evolution depends on its past history. We show that the trajectory memory does not necessarily yields density memory, and that density memory might be compatible with the existence of abrupt jumps resetting to zero the system's memory. We focus our attention on a time-convoluted diffusion equation, when the memory kernel is an inverse power law with (i) negative and (ii) positive tail. In case (i) there exist both renewal trajectories and trajectories with memory, compatible with this equation. Case (ii), which has eluded so far a convincing interpretation in terms of trajectories, is shown to be compatible only with trajectory memory

Experimental Results for Minimum-Time Trajectory Tracking of a Direct-Drive Three-Link Planar Arm

Energy Technology Data Exchange (ETDEWEB)

DRIESSEN,BRIAN; PARKER,GORDON G.

1999-09-01

This work is an experimental investigation of the ability of a real three-link direct-drive arm to track model-based minimum-time trajectories that have been found off-line. Sufficiently large velocity gains in the computed torque control law were not achievable with the velocity sensors described herein. This indicates the critical importance of the velocity sensing when attempting to track trajectories that push the envelope of the system's torque capabilities.

Decision-Aiding and Optimization for Vertical Navigation of Long-Haul Aircraft

Science.gov (United States)

Patrick, Nicholas J. M.; Sheridan, Thomas B.

1996-01-01

Most decisions made in the cockpit are related to safety, and have therefore been proceduralized in order to reduce risk. There are very few which are made on the basis of a value metric such as economic cost. One which can be shown to be value based, however, is the selection of a flight profile. Fuel consumption and flight time both have a substantial effect on aircraft operating cost, but they cannot be minimized simultaneously. In addition, winds, turbulence, and performance vary widely with altitude and time. These factors make it important and difficult for pilots to (a) evaluate the outcomes associated with a particular trajectory before it is flown and (b) decide among possible trajectories. The two elements of this problem considered here are: (1) determining what constitutes optimality, and (2) finding optimal trajectories. Pilots and dispatchers from major u.s. airlines were surveyed to determine which attributes of the outcome of a flight they considered the most important. Avoiding turbulence-for passenger comfort-topped the list of items which were not safety related. Pilots' decision making about the selection of flight profile on the basis of flight time, fuel burn, and exposure to turbulence was then observed. Of the several behavioral and prescriptive decision models invoked to explain the pilots' choices, utility maximization is shown to best reproduce the pilots' decisions. After considering more traditional methods for optimizing trajectories, a novel method is developed using a genetic algorithm (GA) operating on a discrete representation of the trajectory search space. The representation is a sequence of command altitudes, and was chosen to be compatible with the constraints imposed by Air Traffic Control, and with the training given to pilots. Since trajectory evaluation for the GA is performed holistically, a wide class of objective functions can be optimized easily. Also, using the GA it is possible to compare the costs associated with

Global Optimization of Low-Thrust Interplanetary Trajectories Subject to Operational Constraints

Science.gov (United States)

Englander, Jacob Aldo; Vavrina, Matthew; Hinckley, David

2016-01-01

Low-thrust electric propulsion provides many advantages for mission to difficult targets-Comets and asteroids-Mercury-Outer planets (with sufficient power supply)Low-thrust electric propulsion is characterized by high power requirements but also very high specific impulse (Isp), leading to very good mass fractions. Low-thrust trajectory design is a very different process from chemical trajectory.

Accurate approximation of in-ecliptic trajectories for E-sail with constant pitch angle

Science.gov (United States)

Huo, Mingying; Mengali, Giovanni; Quarta, Alessandro A.

2018-05-01

Propellantless continuous-thrust propulsion systems, such as electric solar wind sails, may be successfully used for new space missions, especially those requiring high-energy orbit transfers. When the mass-to-thrust ratio is sufficiently large, the spacecraft trajectory is characterized by long flight times with a number of revolutions around the Sun. The corresponding mission analysis, especially when addressed within an optimal context, requires a significant amount of simulation effort. Analytical trajectories are therefore useful aids in a preliminary phase of mission design, even though exact solution are very difficult to obtain. The aim of this paper is to present an accurate, analytical, approximation of the spacecraft trajectory generated by an electric solar wind sail with a constant pitch angle, using the latest mathematical model of the thrust vector. Assuming a heliocentric circular parking orbit and a two-dimensional scenario, the simulation results show that the proposed equations are able to accurately describe the actual spacecraft trajectory for a long time interval when the propulsive acceleration magnitude is sufficiently small.

HOTSPOTS DETECTION FROM TRAJECTORY DATA BASED ON SPATIOTEMPORAL DATA FIELD CLUSTERING

Directory of Open Access Journals (Sweden)

K. Qin

2017-09-01

Full Text Available City hotspots refer to the areas where residents visit frequently, and large traffic flow exist, which reflect the people travel patterns and distribution of urban function area. Taxi trajectory data contain abundant information about urban functions and citizen activities, and extracting interesting city hotspots from them can be of importance in urban planning, traffic command, public travel services etc. To detect city hotspots and discover a variety of changing patterns among them, we introduce a data field-based cluster analysis technique to the pick-up and drop-off points of taxi trajectory data and improve the method by introducing the time weight, which has been normalized to estimate the potential value in data field. Thus, in the light of the new potential function in data field, short distance and short time difference play a powerful role. So the region full of trajectory points, which is regarded as hotspots area, has a higher potential value, while the region with thin trajectory points has a lower potential value. The taxi trajectory data of Wuhan city in China on May 1, 6 and 9, 2015, are taken as the experimental data. From the result, we find the sustaining hotspots area and inconstant hotspots area in Wuhan city based on the spatiotemporal data field method. Further study will focus on optimizing parameter and the interaction among hotspots area.

Trajectories of martian habitability.

Science.gov (United States)

Cockell, Charles S

2014-02-01

Beginning from two plausible starting points-an uninhabited or inhabited Mars-this paper discusses the possible trajectories of martian habitability over time. On an uninhabited Mars, the trajectories follow paths determined by the abundance of uninhabitable environments and uninhabited habitats. On an inhabited Mars, the addition of a third environment type, inhabited habitats, results in other trajectories, including ones where the planet remains inhabited today or others where planetary-scale life extinction occurs. By identifying different trajectories of habitability, corresponding hypotheses can be described that allow for the various trajectories to be disentangled and ultimately a determination of which trajectory Mars has taken and the changing relative abundance of its constituent environments.

Predictors of Psychological Distress Trajectories in the First Year After a Breast Cancer Diagnosis

Directory of Open Access Journals (Sweden)

Jin-Hee Park, RN, Ph.D.

2017-12-01

Full Text Available Purpose: Psychological distress is a significant and ongoing problem for breast cancer. These mental health problems are often neglected as they are not always properly understood. This study was performed to explore the trajectory of psychological distress over 1 year since breast cancer surgery and to identify the associated factors for the trajectory. Methods: One hundred seventeen women who underwent surgery for breast cancer completed the psychological distress thermometer and problem lists from after surgery to 12 months after surgery. Information on their sociodemographic and clinical characteristics was also obtained. Group-based trajectory modeling was performed to identify the distinct trajectories of psychological distress. Chi-square test and logistic regression analysis were performed to determine predictors of psychological distress trajectories. Results: A two-group linear trajectory model was optimal for modeling psychological distress (Bayesian information criterion = −777.41. Group-based trajectory modeling identified consistently high-distress (19.4% and low-decreasing distress (80.6% trajectories. Old age, depression, nervousness, and pain were significant predictors of consistently high-distress trajectory. Conclusion: Our results indicate that distinct trajectory groups can be used as a screening tool to identify patients who may be at an increased risk of psychological distress over time. Screening for psychological distress during disease diagnosis is important and necessary to identify patients who are at an increased risk of elevated distress or at risk of experiencing psychological distress over time. Keywords: anxiety, breast neoplasms, depression, pain, psychological stress

Mars entry-to-landing trajectory optimization and closed loop guidance

Science.gov (United States)

Ilgen, Marc R.; Manning, Raymund A.; Cruz, Manuel I.

1991-01-01

The guidance strategy of the Mars Rover Sample Return mission is presented in detail. Aeromaneuver versus aerobrake trades are examined, and an aerobrake analysis is presented which takes into account targeting, guidance, flight control, trajectory profile, delivery accuracy. An aeromaneuver analysis is given which includes the entry corridor, maneuver footprint, guidance, preentry phase, constant drag phase, equilibrium guide phase, variable drag phase, influence of trajectory profile on the entry flight loads, parachute deployment conditions and strategies, and landing accuracy. The Mars terminal descent phase is analyzed.

Direct Observation of Long-Range Transport Using Continuously Sounding Balloons and Near-Real-Time Trajectory Modeling

Science.gov (United States)

Voss, P. B.; Zaveri, R. A.; Berkowitz, C. M.

2009-12-01

Controlled Meteorological (CMET) balloons have been used in several recent studies to measure long-range transport over periods as long as 30 hours and distances up to 1000 kilometers. By repeatedly performing shallow soundings as they drift, CMET balloons can quantify evolving atmospheric structure, mixing events, shear advection, and dispersion during transport. In addition, the quasi-Lagrangian wind profiles can be used to drive a multi-layer trajectory model in which the advected air parcels follow the underlying terrain, or are constrained by altitude, potential temperature, or tracer concentration. Data from a coordinated balloon-aircraft study of long range transport over Texas (SETTS 2005) show that the reconstructed trajectories accurately track residual-layer urban outflow (and at times even its fine-scale structure) over distances of many hundreds of kilometers. The reconstructed trajectories and evolving profile visualizations are increasingly being made available in near-real time during balloon flights, supporting data-driven flight planning and sophisticated process studies relevant to atmospheric chemistry and climate. Multilayer trajectories (black grids) derived from CMET balloon flight paths (grey lines) for a transport event across Texas in 2005.

Optimal Exponential Synchronization of Chaotic Systems with Multiple Time Delays via Fuzzy Control

Directory of Open Access Journals (Sweden)

Feng-Hsiag Hsiao

2013-01-01

Full Text Available This study presents an effective approach to realize the optimal exponential synchronization of multiple time-delay chaotic (MTDC systems. First, a neural network (NN model is employed to approximate the MTDC system. Then, a linear differential inclusion (LDI state-space representation is established for the dynamics of the NN model. Based on this LDI state-space representation, this study proposes a delay-dependent exponential stability criterion of the error system derived in terms of Lyapunov’s direct method to ensure that the trajectories of the slave system can approach those of the master system. Subsequently, the stability condition of this criterion is reformulated into a linear matrix inequality (LMI. Based on the LMI, a fuzzy controller is synthesized not only to realize the exponential synchronization but also to achieve the optimal performance by minimizing the disturbance attenuation level. Finally, a numerical example with simulations is provided to illustrate the concepts discussed throughout this work.

The influence of work-family conflict trajectories on self-rated health trajectories in Switzerland: a life course approach.

Science.gov (United States)

Cullati, Stéphane

2014-07-01

Self-rated health (SRH) trajectories tend to decline over a lifetime. Moreover, the Cumulative Advantage and Disadvantage (CAD) model indicates that SRH trajectories are known to consistently diverge along socioeconomic positions (SEP) over the life course. However, studies of working adults to consider the influence of work and family conflict (WFC) on SRH trajectories are scarce. We test the CAD model and hypothesise that SRH trajectories diverge over time according to socioeconomic positions and WFC trajectories accentuate this divergence. Using longitudinal data from the Swiss Household Panel (N = 2327 working respondents surveyed from 2004 to 2010), we first examine trajectories of SRH and potential divergence over time across age, gender, SEP and family status using latent growth curve analysis. Second, we assess changes in SRH trajectories in relation to changes in WFC trajectories and divergence in SRH trajectories according to gender, SEP and family status using parallel latent growth curve analysis. Three measures of WFC are used: exhaustion after work, difficulty disconnecting from work, and work interference in private family obligations. The results show that SRH trajectories slowly decline over time and that the rate of change is not influenced by age, gender or SEP, a result which does not support the CAD model. SRH trajectories are significantly correlated with exhaustion after work trajectories but not the other two WFC measures. When exhaustion after work trajectories are taken into account, SRH trajectories of higher educated people decline slower compared to less educated people, supporting the CAD hypothesis. Copyright © 2014 Elsevier Ltd. All rights reserved.

Detection of Wind Evolution and Lidar Trajectory Optimization for Lidar-Assisted Wind Turbine Control

Directory of Open Access Journals (Sweden)

David Schlipf

2015-11-01

Full Text Available Recent developments in remote sensing are offering a promising opportunity to rethink conventional control strategies of wind turbines. With technologies such as lidar, the information about the incoming wind field - the main disturbance to the system - can be made available ahead of time. Initial field testing of collective pitch feedforward control shows, that lidar measurements are only beneficial if they are filtered properly to avoid harmful control action. However, commercial lidar systems developed for site assessment are usually unable to provide a usable signal for real time control. Recent research shows, that the correlation between the measurement of rotor effective wind speed and the turbine reaction can be modeled and that the model can be used to optimize a scan pattern. This correlation depends on several criteria such as turbine size, position of the measurements, measurement volume, and how the wind evolves on its way towards the rotor. In this work the longitudinal wind evolution is identified with the line-of-sight measurements of a pulsed lidar system installed on a large commercial wind turbine. This is done by staring directly into the inflowing wind during operation of the turbine and fitting the coherence between the wind at different measurement distances to an exponential model taking into account the yaw misalignment, limitation to line-of-sight measurements and the pulse volume. The identified wind evolution is then used to optimize the scan trajectory of a scanning lidar for lidar-assisted feedforward control in order to get the best correlation possible within the constraints of the system. Further, an adaptive filer is fitted to the modeled correlation to avoid negative impact of feedforward control because of uncorrelated frequencies of the wind measurement. The main results of the presented work are a first estimate of the wind evolution in front of operating wind turbines and an approach which manufacturers of

Tuning Monotonic Basin Hopping: Improving the Efficiency of Stochastic Search as Applied to Low-Thrust Trajectory Optimization

Science.gov (United States)

Englander, Jacob A.; Englander, Arnold C.

2014-01-01

Trajectory optimization methods using monotonic basin hopping (MBH) have become well developed during the past decade [1, 2, 3, 4, 5, 6]. An essential component of MBH is a controlled random search through the multi-dimensional space of possible solutions. Historically, the randomness has been generated by drawing random variable (RV)s from a uniform probability distribution. Here, we investigate the generating the randomness by drawing the RVs from Cauchy and Pareto distributions, chosen because of their characteristic long tails. We demonstrate that using Cauchy distributions (as first suggested by J. Englander [3, 6]) significantly improves monotonic basin hopping (MBH) performance, and that Pareto distributions provide even greater improvements. Improved performance is defined in terms of efficiency and robustness. Efficiency is finding better solutions in less time. Robustness is efficiency that is undiminished by (a) the boundary conditions and internal constraints of the optimization problem being solved, and (b) by variations in the parameters of the probability distribution. Robustness is important for achieving performance improvements that are not problem specific. In this work we show that the performance improvements are the result of how these long-tailed distributions enable MBH to search the solution space faster and more thoroughly. In developing this explanation, we use the concepts of sub-diffusive, normally-diffusive, and super-diffusive random walks (RWs) originally developed in the field of statistical physics.

Trajectory Browser Website

Science.gov (United States)

Foster, Cyrus; Jaroux, Belgacem A.

2012-01-01

The Trajectory Browser is a web-based tool developed at the NASA Ames Research Center to be used for the preliminary assessment of trajectories to small-bodies and planets and for providing relevant launch date, time-of-flight and V requirements. The site hosts a database of transfer trajectories from Earth to asteroids and planets for various types of missions such as rendezvous, sample return or flybys. A search engine allows the user to find trajectories meeting desired constraints on the launch window, mission duration and delta V capability, while a trajectory viewer tool allows the visualization of the heliocentric trajectory and the detailed mission itinerary. The anticipated user base of this tool consists primarily of scientists and engineers designing interplanetary missions in the context of pre-phase A studies, particularly for performing accessibility surveys to large populations of small-bodies. The educational potential of the website is also recognized for academia and the public with regards to trajectory design, a field that has generally been poorly understood by the public. The website is currently hosted on NASA-internal URL http://trajbrowser.arc.nasa.gov/ with plans for a public release as soon as development is complete.

Robotic excavator trajectory control using an improved GA based PID controller

Science.gov (United States)

Feng, Hao; Yin, Chen-Bo; Weng, Wen-wen; Ma, Wei; Zhou, Jun-jing; Jia, Wen-hua; Zhang, Zi-li

2018-05-01

In order to achieve excellent trajectory tracking performances, an improved genetic algorithm (IGA) is presented to search for the optimal proportional-integral-derivative (PID) controller parameters for the robotic excavator. Firstly, the mathematical model of kinematic and electro-hydraulic proportional control system of the excavator are analyzed based on the mechanism modeling method. On this basis, the actual model of the electro-hydraulic proportional system are established by the identification experiment. Furthermore, the population, the fitness function, the crossover probability and mutation probability of the SGA are improved: the initial PID parameters are calculated by the Ziegler-Nichols (Z-N) tuning method and the initial population is generated near it; the fitness function is transformed to maintain the diversity of the population; the probability of crossover and mutation are adjusted automatically to avoid premature convergence. Moreover, a simulation study is carried out to evaluate the time response performance of the proposed controller, i.e., IGA based PID against the SGA and Z-N based PID controllers with a step signal. It was shown from the simulation study that the proposed controller provides the least rise time and settling time of 1.23 s and 1.81 s, respectively against the other tested controllers. Finally, two types of trajectories are designed to validate the performances of the control algorithms, and experiments are performed on the excavator trajectory control experimental platform. It was demonstrated from the experimental work that the proposed IGA based PID controller improves the trajectory accuracy of the horizontal line and slope line trajectories by 23.98% and 23.64%, respectively in comparison to the SGA tuned PID controller. The results further indicate that the proposed IGA tuning based PID controller is effective for improving the tracking accuracy, which may be employed in the trajectory control of an actual excavator.

How to connect time-lapse recorded trajectories of motile microorganisms with dynamical models in continuous time

DEFF Research Database (Denmark)

Pedersen, Jonas Nyvold; Li, Liang; Gradinaru, Cristian

2016-01-01

We provide a tool for data-driven modeling of motility, data being time-lapse recorded trajectories. Several mathematical properties of a model to be found can be gleaned from appropriate model-independent experimental statistics, if one understands how such statistics are distorted by the finite...... of these effects that are valid for any reasonable model for persistent random motion. Our findings are illustrated with experimental data and Monte Carlo simulations....

Automation of POST Cases via External Optimizer and "Artificial p2" Calculation

Science.gov (United States)

Dees, Patrick D.; Zwack, Mathew R.

2017-01-01

During early conceptual design of complex systems, speed and accuracy are often at odds with one another. While many characteristics of the design are fluctuating rapidly during this phase there is nonetheless a need to acquire accurate data from which to down-select designs as these decisions will have a large impact upon program life-cycle cost. Therefore enabling the conceptual designer to produce accurate data in a timely manner is tantamount to program viability. For conceptual design of launch vehicles, trajectory analysis and optimization is a large hurdle. Tools such as the industry standard Program to Optimize Simulated Trajectories (POST) have traditionally required an expert in the loop for setting up inputs, running the program, and analyzing the output. The solution space for trajectory analysis is in general non-linear and multi-modal requiring an experienced analyst to weed out sub-optimal designs in pursuit of the global optimum. While an experienced analyst presented with a vehicle similar to one which they have already worked on can likely produce optimal performance figures in a timely manner, as soon as the "experienced" or "similar" adjectives are invalid the process can become lengthy. In addition, an experienced analyst working on a similar vehicle may go into the analysis with preconceived ideas about what the vehicle's trajectory should look like which can result in sub-optimal performance being recorded. Thus, in any case but the ideal either time or accuracy can be sacrificed. In the authors' previous work a tool called multiPOST was created which captures the heuristics of a human analyst over the process of executing trajectory analysis with POST. However without the instincts of a human in the loop, this method relied upon Monte Carlo simulation to find successful trajectories. Overall the method has mixed results, and in the context of optimizing multiple vehicles it is inefficient in comparison to the method presented POST's internal

Trajectories of Life Satisfaction Over the First 10 Years After Traumatic Brain Injury: Race, Gender, and Functional Ability.

Science.gov (United States)

Williamson, Meredith L C; Elliott, Timothy R; Bogner, Jennifer; Dreer, Laura E; Arango-Lasprilla, Juan Carlos; Kolakowsky-Hayner, Stephanie A; Pretz, Christopher R; Lequerica, Anthony; Perrin, Paul B

2016-01-01

This study investigated the influence of race, gender, functional ability, and an array of preinjury, injury-related, and sociodemographic variables on life satisfaction trajectories over 10 years following moderate to severe traumatic brain injury (TBI). A sample of 3157 individuals with TBI from the TBI Model Systems database was included in this study. Hierarchical linear modeling (HLM) analyses were conducted to examine the trajectories of life satisfaction. The Functional Independence Measure, Glasgow Coma Scale, and the Satisfaction With Life Scale were utilized. Initial models suggested that life satisfaction trajectories increased over the 10-year period and Asian/Pacific Islander participants experienced an increase in life satisfaction over time. In a comprehensive model, time was no longer a significant predictor of increased life satisfaction. Black race, however, was associated with lower life satisfaction, and significant interactions revealed that black participants' life satisfaction trajectory decreased over time while white participants' trajectory increased over the same time period. Life satisfaction trajectories did not significantly differ by gender, and greater motor and cognitive functioning were associated with increasingly positive life satisfaction trajectories over the 10 years. Individuals with more functional impairments are at risk for decreases in life satisfaction over time. Further research is needed to identify the mechanisms and factors that contribute to the lower levels of life satisfaction observed among black individuals post-TBI. This work is needed to determine strategic ways to promote optimal adjustment for these individuals.

Utilization of an H-reversal trajectory of a solar sail for asteroid deflection

International Nuclear Information System (INIS)

Gong Shengping; Li Junfeng; Zeng Xiangyuan

2011-01-01

Near Earth Asteroids have a possibility of impacting the Earth and always represent a threat. This paper proposes a way of changing the orbit of the asteroid to avoid an impact. A solar sail evolving in an H-reversal trajectory is utilized for asteroid deflection. Firstly, the dynamics of the solar sail and the characteristics of the H-reversal trajectory are analyzed. Then, the attitude of the solar sail is optimized to guide the sail to impact the target asteroid along an H-reversal trajectory. The impact velocity depends on two important parameters: the minimum solar distance along the trajectory and lightness number of the solar sail. A larger lightness number and a smaller solar distance lead to a higher impact velocity. Finally, the deflection capability of a solar sail impacting the asteroid along the H-reversal trajectory is discussed. The results show that a 10 kg solar sail with a lead-time of one year can move Apophis out of a 600-m keyhole area in 2029 to eliminate the possibility of its resonant return in 2036. (editor's recommendation)

Trajectory-based nonadiabatic dynamics with time-dependent density functional theory.

Science.gov (United States)

Curchod, Basile F E; Rothlisberger, Ursula; Tavernelli, Ivano

2013-05-10

Understanding the fate of an electronically excited molecule constitutes an important task for theoretical chemistry, and practical implications range from the interpretation of atto- and femtosecond spectroscopy to the development of light-driven molecular machines, the control of photochemical reactions, and the possibility of capturing sunlight energy. However, many challenging conceptual and technical problems are involved in the description of these phenomena such as 1) the failure of the well-known Born-Oppenheimer approximation; 2) the need for accurate electronic properties such as potential energy surfaces, excited nuclear forces, or nonadiabatic coupling terms; and 3) the necessity of describing the dynamics of the photoexcited nuclear wavepacket. This review provides an overview of the current methods to address points 1) and 3) and shows how time-dependent density functional theory (TDDFT) and its linear-response extension can be used for point 2). First, the derivation of Ehrenfest dynamics and nonadiabatic Bohmian dynamics is discussed and linked to Tully's trajectory surface hopping. Second, the coupling of these trajectory-based nonadiabatic schemes with TDDFT is described in detail with special emphasis on the derivation of the required electronic structure properties. Copyright © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Global Optimization using Interval Analysis : Interval Optimization for Aerospace Applications

NARCIS (Netherlands)

Van Kampen, E.

2010-01-01

Optimization is an important element in aerospace related research. It is encountered for example in trajectory optimization problems, such as: satellite formation flying, spacecraft re-entry optimization and airport approach and departure optimization; in control optimization, for example in

Optimal paths of piston motion of irreversible diesel cycle for minimum entropy generation

Directory of Open Access Journals (Sweden)

Ge Yanlin

2011-01-01

Full Text Available A Diesel cycle heat engine with internal and external irreversibility’s of heat transfer and friction, in which the finite rate of combustion is considered and the heat transfer between the working fluid and the environment obeys Newton’s heat transfer law [q≈ Δ(T], is studied in this paper. Optimal piston motion trajectories for minimizing entropy generation per cycle are derived for the fixed total cycle time and fuel consumed per cycle. Optimal control theory is applied to determine the optimal piston motion trajectories for the cases of with piston acceleration constraint on each stroke and the optimal distribution of the total cycle time among the strokes. The optimal piston motion with acceleration constraint for each stroke consists of three segments, including initial maximum acceleration and final maximum deceleration boundary segments, respectively. Numerical examples for optimal configurations are provided, and the results obtained are compared with those obtained when maximizing the work output with Newton’s heat transfer law. The results also show that optimizing the piston motion trajectories could reduce engine entropy generation by more than 20%. This is primarily due to the decrease in entropy generation caused by heat transfer loss on the initial portion of the power stroke.

Thermally-Constrained Fuel-Optimal ISS Maneuvers

Science.gov (United States)

Bhatt, Sagar; Svecz, Andrew; Alaniz, Abran; Jang, Jiann-Woei; Nguyen, Louis; Spanos, Pol

2015-01-01

Optimal Propellant Maneuvers (OPMs) are now being used to rotate the International Space Station (ISS) and have saved hundreds of kilograms of propellant over the last two years. The savings are achieved by commanding the ISS to follow a pre-planned attitude trajectory optimized to take advantage of environmental torques. The trajectory is obtained by solving an optimal control problem. Prior to use on orbit, OPM trajectories are screened to ensure a static sun vector (SSV) does not occur during the maneuver. The SSV is an indicator that the ISS hardware temperatures may exceed thermal limits, causing damage to the components. In this paper, thermally-constrained fuel-optimal trajectories are presented that avoid an SSV and can be used throughout the year while still reducing propellant consumption significantly.

Trajectories of maternal leisure-time physical activity and sedentary behavior during adolescence to young adulthood and offspring birthweight.

Science.gov (United States)

Badon, Sylvia E; Littman, Alyson J; Chan, Kwun Chuen Gary; Williams, Michelle A; Enquobahrie, Daniel A

2017-11-01

The objectives of the study were to determine the extent to which trajectories of maternal preconception leisure-time physical activity (LTPA) and leisure-time sedentary behavior (LTSB) during adolescence and young adulthood are associated with offspring birth weight (BW) and to test if these associations differ by offspring sex or maternal pre-pregnancy overweight-obese status. Participants with one or more birth (n = 1408) were identified from the National Longitudinal Study of Adolescent to Adult Health. Group-based trajectory modeling was used to characterize trajectories of LTPA (frequency/week) and LTSB (hours/week) which were measured, on average, over 7 years between age 15 and 22 years. Weighted regression and Wald tests were used to estimate and test mean differences and odds ratios for BW, small for gestational age, and large for gestational age (LGA). Three trajectories were identified for LTPA and five for LTSB. Associations differed by offspring sex for continuous BW and LGA (interaction P = .10 and .008, respectively). Among female offspring, participants with high followed by decreasing LTPA delivered offspring with 90 g greater BW (95% confidence interval [CI]: -4 to 184) and 72% greater risk of LGA (95% CI: 0.94-3.14), compared with participants with low LTPA. Among male offspring, LTPA patterns were not associated with BW. A pattern of high then decreasing LTPA among normal weight, but not overweight-obese women, was associated with 2.03 times greater risk of LGA (95% CI: 1.06-3.88). LTSB trajectories were not associated with BW. Associations of preconception trajectories of LTPA with offspring BW may differ by offspring sex and maternal pre-pregnancy overweight-obese status. Copyright © 2017 Elsevier Inc. All rights reserved.

Asteroid Rendezvous Mission Design Using Multiobjective Particle Swarm Optimization

Directory of Open Access Journals (Sweden)

Ya-zhong Luo

2014-01-01

Full Text Available A new preliminary trajectory design method for asteroid rendezvous mission using multiobjective optimization techniques is proposed. This method can overcome the disadvantages of the widely employed Pork-Chop method. The multiobjective integrated launch window and multi-impulse transfer trajectory design model is formulated, which employes minimum-fuel cost and minimum-time transfer as two objective functions. The multiobjective particle swarm optimization (MOPSO is employed to locate the Pareto solution. The optimization results of two different asteroid mission designs show that the proposed approach can effectively and efficiently demonstrate the relations among the mission characteristic parameters such as launch time, transfer time, propellant cost, and number of maneuvers, which will provide very useful reference for practical asteroid mission design. Compared with the PCP method, the proposed approach is demonstrated to be able to provide much more easily used results, obtain better propellant-optimal solutions, and have much better efficiency. The MOPSO shows a very competitive performance with respect to the NSGA-II and the SPEA-II; besides a proposed boundary constraint optimization strategy is testified to be able to improve its performance.

Modeling intensive longitudinal data with mixtures of nonparametric trajectories and time-varying effects.

Science.gov (United States)

Dziak, John J; Li, Runze; Tan, Xianming; Shiffman, Saul; Shiyko, Mariya P

2015-12-01

Behavioral scientists increasingly collect intensive longitudinal data (ILD), in which phenomena are measured at high frequency and in real time. In many such studies, it is of interest to describe the pattern of change over time in important variables as well as the changing nature of the relationship between variables. Individuals' trajectories on variables of interest may be far from linear, and the predictive relationship between variables of interest and related covariates may also change over time in a nonlinear way. Time-varying effect models (TVEMs; see Tan, Shiyko, Li, Li, & Dierker, 2012) address these needs by allowing regression coefficients to be smooth, nonlinear functions of time rather than constants. However, it is possible that not only observed covariates but also unknown, latent variables may be related to the outcome. That is, regression coefficients may change over time and also vary for different kinds of individuals. Therefore, we describe a finite mixture version of TVEM for situations in which the population is heterogeneous and in which a single trajectory would conceal important, interindividual differences. This extended approach, MixTVEM, combines finite mixture modeling with non- or semiparametric regression modeling, to describe a complex pattern of change over time for distinct latent classes of individuals. The usefulness of the method is demonstrated in an empirical example from a smoking cessation study. We provide a versatile SAS macro and R function for fitting MixTVEMs. (c) 2015 APA, all rights reserved).

Noncoplanar VMAT for nasopharyngeal tumors: Plan quality versus treatment time

Energy Technology Data Exchange (ETDEWEB)

Wild, Esther, E-mail: e.wild@dkfz.de; Bangert, Mark [Department of Medical Physics in Radiation Oncology, German Cancer Research Center, Im Neuenheimer Feld 280, D-69120 Heidelberg (Germany); Nill, Simeon [Joint Department of Physics at The Institute of Cancer Research and The Royal Marsden NHS Foundation Trust, London SM2 5NG (United Kingdom); Oelfke, Uwe [Joint Department of Physics at The Institute of Cancer Research and The Royal Marsden NHS Foundation Trust, London SM2 5NG, United Kingdom and Department of Medical Physics in Radiation Oncology, German Cancer Research Center, Im Neuenheimer Feld 280, D-69120 Heidelberg (Germany)

2015-05-15

Purpose: The authors investigated the potential of optimized noncoplanar irradiation trajectories for volumetric modulated arc therapy (VMAT) treatments of nasopharyngeal patients and studied the trade-off between treatment plan quality and delivery time in radiation therapy. Methods: For three nasopharyngeal patients, the authors generated treatment plans for nine different delivery scenarios using dedicated optimization methods. They compared these scenarios according to dose characteristics, number of beam directions, and estimated delivery times. In particular, the authors generated the following treatment plans: (1) a 4π plan, which is a not sequenced, fluence optimized plan that uses beam directions from approximately 1400 noncoplanar directions and marks a theoretical upper limit of the treatment plan quality, (2) a coplanar 2π plan with 72 coplanar beam directions as pendant to the noncoplanar 4π plan, (3) a coplanar VMAT plan, (4) a coplanar step and shoot (SnS) plan, (5) a beam angle optimized (BAO) coplanar SnS IMRT plan, (6) a noncoplanar BAO SnS plan, (7) a VMAT plan with rotated treatment couch, (8) a noncoplanar VMAT plan with an optimized great circle around the patient, and (9) a noncoplanar BAO VMAT plan with an arbitrary trajectory around the patient. Results: VMAT using optimized noncoplanar irradiation trajectories reduced the mean and maximum doses in organs at risk compared to coplanar VMAT plans by 19% on average while the target coverage remains constant. A coplanar BAO SnS plan was superior to coplanar SnS or VMAT; however, noncoplanar plans like a noncoplanar BAO SnS plan or noncoplanar VMAT yielded a better plan quality than the best coplanar 2π plan. The treatment plan quality of VMAT plans depended on the length of the trajectory. The delivery times of noncoplanar VMAT plans were estimated to be 6.5 min in average; 1.6 min longer than a coplanar plan but on average 2.8 min faster than a noncoplanar SnS plan with comparable

Noncoplanar VMAT for nasopharyngeal tumors: Plan quality versus treatment time

International Nuclear Information System (INIS)

Wild, Esther; Bangert, Mark; Nill, Simeon; Oelfke, Uwe

2015-01-01

Purpose: The authors investigated the potential of optimized noncoplanar irradiation trajectories for volumetric modulated arc therapy (VMAT) treatments of nasopharyngeal patients and studied the trade-off between treatment plan quality and delivery time in radiation therapy. Methods: For three nasopharyngeal patients, the authors generated treatment plans for nine different delivery scenarios using dedicated optimization methods. They compared these scenarios according to dose characteristics, number of beam directions, and estimated delivery times. In particular, the authors generated the following treatment plans: (1) a 4π plan, which is a not sequenced, fluence optimized plan that uses beam directions from approximately 1400 noncoplanar directions and marks a theoretical upper limit of the treatment plan quality, (2) a coplanar 2π plan with 72 coplanar beam directions as pendant to the noncoplanar 4π plan, (3) a coplanar VMAT plan, (4) a coplanar step and shoot (SnS) plan, (5) a beam angle optimized (BAO) coplanar SnS IMRT plan, (6) a noncoplanar BAO SnS plan, (7) a VMAT plan with rotated treatment couch, (8) a noncoplanar VMAT plan with an optimized great circle around the patient, and (9) a noncoplanar BAO VMAT plan with an arbitrary trajectory around the patient. Results: VMAT using optimized noncoplanar irradiation trajectories reduced the mean and maximum doses in organs at risk compared to coplanar VMAT plans by 19% on average while the target coverage remains constant. A coplanar BAO SnS plan was superior to coplanar SnS or VMAT; however, noncoplanar plans like a noncoplanar BAO SnS plan or noncoplanar VMAT yielded a better plan quality than the best coplanar 2π plan. The treatment plan quality of VMAT plans depended on the length of the trajectory. The delivery times of noncoplanar VMAT plans were estimated to be 6.5 min in average; 1.6 min longer than a coplanar plan but on average 2.8 min faster than a noncoplanar SnS plan with comparable

Trajectories of Intimate Partner Violence Victimization

Directory of Open Access Journals (Sweden)

Kevin M. Swartout

2012-08-01

Full Text Available Introduction: The purposes of this study were to assess the extent to which latent trajectories of female intimate partner violence (IPV victimization exist; and, if so, use negative childhood experiences to predict trajectory membership.Methods: We collected data from 1,575 women at 5 time-points regarding experiences during adolescence and their 4 years of college. We used latent class growth analysis to fit a series of personcentered, longitudinal models ranging from 1 to 5 trajectories. Once the best-fitting model was selected, we used negative childhood experience variables—sexual abuse, physical abuse, and witnessing domestic violence—to predict most-likely trajectory membership via multinomial logistic regression.Results: A 5-trajectory model best fit the data both statistically and in terms of interpretability. The trajectories across time were interpreted as low or no IPV, low to moderate IPV, moderate to low IPV, high to moderate IPV, and high and increasing IPV, respectively. Negative childhood experiences differentiated trajectory membership, somewhat, with childhood sexual abuse as a consistent predictor of membership in elevated IPV trajectories.Conclusion: Our analyses show how IPV risk changes over time and in different ways. These differential patterns of IPV suggest the need for prevention strategies tailored for women that consider victimization experiences in childhood and early adulthood. [West J Emerg Med. 2012;13(3:272–277.

A new method to calibrate Lagrangian model with ASAR images for oil slick trajectory.

Science.gov (United States)

Tian, Siyu; Huang, Xiaoxia; Li, Hongga

2017-03-15

Since Lagrangian model coefficients vary with different conditions, it is necessary to calibrate the model to obtain optimal coefficient combination for special oil spill accident. This paper focuses on proposing a new method to calibrate Lagrangian model with time series of Envisat ASAR images. Oil slicks extracted from time series images form a detected trajectory of special oil slick. Lagrangian model is calibrated by minimizing the difference between simulated trajectory and detected trajectory. mean center position distance difference (MCPD) and rotation difference (RD) of Oil slicks' or particles' standard deviational ellipses (SDEs) are calculated as two evaluations. The two parameters are taken to evaluate the performance of Lagrangian transport model with different coefficient combinations. This method is applied to Penglai 19-3 oil spill accident. The simulation result with calibrated model agrees well with related satellite observations. It is suggested the new method is effective to calibrate Lagrangian model. Copyright © 2016 Elsevier Ltd. All rights reserved.

Sufficient conditions for Lagrange, Mayer, and Bolza optimization problems

Directory of Open Access Journals (Sweden)

Boltyanski V.

2001-01-01

Full Text Available The Maximum Principle [2,13] is a well known necessary condition for optimality. This condition, generally, is not sufficient. In [3], the author proved that if there exists regular synthesis of trajectories, the Maximum Principle also is a sufficient condition for time-optimality. In this article, we generalize this result for Lagrange, Mayer, and Bolza optimization problems.

Extension of a chaos control method to unstable trajectories on infinite- or finite-time intervals: Experimental verification

International Nuclear Information System (INIS)

Yagasaki, Kazuyuki

2007-01-01

In experiments for single and coupled pendula, we demonstrate the effectiveness of a new control method based on dynamical systems theory for stabilizing unstable aperiodic trajectories defined on infinite- or finite-time intervals. The basic idea of the method is similar to that of the OGY method, which is a well-known, chaos control method. Extended concepts of the stable and unstable manifolds of hyperbolic trajectories are used here

Nonequatorial tachyon trajectories in Kerr space-time and the second law of black-hole physics

International Nuclear Information System (INIS)

Dhurandhar, S.V.

1979-01-01

The behavior of tachyon trajectories (spacelike geodesics) in Kerr space-time is discussed. It is seen that the trajectories may be broadly classified into three types according to the magnitude of the angular momentum of the tachyon. When the magnitude of angular momentum is large [vertical-barhvertical-bar > or = a (1 + GAMMA 2 )atsup 1/2at, where h and GAMMA are the angular momentum and energy at infinity and a 0. In the other cases, a negative value for Carter's constant of motion Q is permitted, which happens to be a necessary condition for the tachyon to fall into the singularity. Next, the second law of black-hole physics is investigated in the general case of nonequatorial trajectories. It is shown that nonequatorial tachyons can decrease the area of the Kerr black hole only if it is rotating sufficiently rapidly [a > (4/3√3) M

Complex trajectories in a classical periodic potential

International Nuclear Information System (INIS)

Anderson, Alexander G; Bender, Carl M

2012-01-01

This paper examines the complex trajectories of a classical particle in the potential V(x) = −cos (x). Almost all the trajectories describe a particle that hops from one well to another in an erratic fashion. However, it is shown analytically that there are two special classes of trajectories x(t) determined only by the energy of the particle and not by the initial position of the particle. The first class consists of periodic trajectories; that is, trajectories that return to their initial position x(0) after some real time T. The second class consists of trajectories for which there exists a real time T such that x(t + T) = x(t) ± 2π. These two classes of classical trajectories are analogous to valence and conduction bands in quantum mechanics, where the quantum particle either remains localized or else tunnels resonantly (conducts) through a crystal lattice. These two special types of trajectories are associated with sets of energies of measure 0. For other energies, it is shown that for long times the average velocity of the particle becomes a fractal-like function of energy. (paper)

Complex trajectories in a classical periodic potential

Science.gov (United States)

Anderson, Alexander G.; Bender, Carl M.

2012-11-01

This paper examines the complex trajectories of a classical particle in the potential V(x) = -cos (x). Almost all the trajectories describe a particle that hops from one well to another in an erratic fashion. However, it is shown analytically that there are two special classes of trajectories x(t) determined only by the energy of the particle and not by the initial position of the particle. The first class consists of periodic trajectories; that is, trajectories that return to their initial position x(0) after some real time T. The second class consists of trajectories for which there exists a real time T such that x(t + T) = x(t) ± 2π. These two classes of classical trajectories are analogous to valence and conduction bands in quantum mechanics, where the quantum particle either remains localized or else tunnels resonantly (conducts) through a crystal lattice. These two special types of trajectories are associated with sets of energies of measure 0. For other energies, it is shown that for long times the average velocity of the particle becomes a fractal-like function of energy.

Trajectory Design Considerations for Exploration Mission 1

Science.gov (United States)

Dawn, Timothy F.; Gutkowski, Jeffrey P.; Batcha, Amelia L.; Williams, Jacob; Pedrotty, Samuel M.

2018-01-01

Exploration Mission 1 (EM-1) will be the first mission to send an uncrewed Orion Multi-Purpose Crew Vehicle (MPCV) to cislunar space in the fall of 2019. EM-1 was originally conceived as a lunar free-return mission, but was later changed to a Distant Retrograde Orbit (DRO) mission as a precursor to the Asteroid Redirect Mission. To understand the required mission performance (i.e., propellant requirement), a series of trajectory optimization runs was conducted using JSC's Copernicus spacecraft trajectory optimization tool. In order for the runs to be done in a timely manner, it was necessary to employ a parallelization approach on a computing cluster using a new trajectory scan tool written in Python. Details of the scan tool are provided and how it is used to perform the scans and post-process the results. Initially, a scan of daily due east launched EM-1 DRO missions in 2018 was made. Valid mission opportunities are ones that do not exceed the useable propellant available to perform the required burns. The initial scan data showed the propellant and delta-V performance patterns for each launch period. As questions were raised from different subsystems (e.g., power, thermal, communications, flight operations, etc.), the mission parameters or data that were of interest to them were added to the scan output data file. The additional data includes: (1) local launch and landing times in relation to sunrise and sunset, (2) length of eclipse periods during the in-space portion of the mission, (3) Earth line of sight from cislunar space, (4) Deep Space Network field of view looking towards cislunar space, and (5) variation of the downrange distance from Earth entry interface to splashdown. Mission design trades can also be performed based on the information that the additional data shows. For example, if the landing is in darkness, but the recovery operations team desires a landing in daylight, then an analysis is performed to determine how to change the mission design

A Numerical Study of Low-Thrust Limited Power Trajectories between Coplanar Circular Orbits in an Inverse-Square Force Field

Directory of Open Access Journals (Sweden)

Sandro da Silva Fernandes

2012-01-01

Full Text Available A numerical study of optimal low-thrust limited power trajectories for simple transfer (no rendezvous between circular coplanar orbits in an inverse-square force field is performed by two different classes of algorithms in optimization of trajectories. This study is carried out by means of a direct method based on gradient techniques and by an indirect method based on the second variation theory. The direct approach of the trajectory optimization problem combines the main positive characteristics of two well-known direct methods in optimization of trajectories: the steepest-descent (first-order gradient method and a direct second variation (second-order gradient method. On the other hand, the indirect approach of the trajectory optimization problem involves two different algorithms of the well-known neighboring extremals method. Several radius ratios and transfer durations are considered, and the fuel consumption is taken as the performance criterion. For small-amplitude transfers, the results are compared to the ones provided by a linear analytical theory.

A Method for Extracting Road Boundary Information from Crowdsourcing Vehicle GPS Trajectories.

Science.gov (United States)

Yang, Wei; Ai, Tinghua; Lu, Wei

2018-04-19

Crowdsourcing trajectory data is an important approach for accessing and updating road information. In this paper, we present a novel approach for extracting road boundary information from crowdsourcing vehicle traces based on Delaunay triangulation (DT). First, an optimization and interpolation method is proposed to filter abnormal trace segments from raw global positioning system (GPS) traces and interpolate the optimization segments adaptively to ensure there are enough tracking points. Second, constructing the DT and the Voronoi diagram within interpolated tracking lines to calculate road boundary descriptors using the area of Voronoi cell and the length of triangle edge. Then, the road boundary detection model is established integrating the boundary descriptors and trajectory movement features (e.g., direction) by DT. Third, using the boundary detection model to detect road boundary from the DT constructed by trajectory lines, and a regional growing method based on seed polygons is proposed to extract the road boundary. Experiments were conducted using the GPS traces of taxis in Beijing, China, and the results show that the proposed method is suitable for extracting the road boundary from low-frequency GPS traces, multi-type road structures, and different time intervals. Compared with two existing methods, the automatically extracted boundary information was proved to be of higher quality.

A Method for Extracting Road Boundary Information from Crowdsourcing Vehicle GPS Trajectories

Directory of Open Access Journals (Sweden)

Wei Yang

2018-04-01

Full Text Available Crowdsourcing trajectory data is an important approach for accessing and updating road information. In this paper, we present a novel approach for extracting road boundary information from crowdsourcing vehicle traces based on Delaunay triangulation (DT. First, an optimization and interpolation method is proposed to filter abnormal trace segments from raw global positioning system (GPS traces and interpolate the optimization segments adaptively to ensure there are enough tracking points. Second, constructing the DT and the Voronoi diagram within interpolated tracking lines to calculate road boundary descriptors using the area of Voronoi cell and the length of triangle edge. Then, the road boundary detection model is established integrating the boundary descriptors and trajectory movement features (e.g., direction by DT. Third, using the boundary detection model to detect road boundary from the DT constructed by trajectory lines, and a regional growing method based on seed polygons is proposed to extract the road boundary. Experiments were conducted using the GPS traces of taxis in Beijing, China, and the results show that the proposed method is suitable for extracting the road boundary from low-frequency GPS traces, multi-type road structures, and different time intervals. Compared with two existing methods, the automatically extracted boundary information was proved to be of higher quality.

Distributed finite-time trajectory tracking control for multiple nonholonomic mobile robots with uncertainties and external disturbances

Science.gov (United States)

Ou, Meiying; Sun, Haibin; Gu, Shengwei; Zhang, Yangyi

2017-11-01

This paper investigates the distributed finite-time trajectory tracking control for a group of nonholonomic mobile robots with time-varying unknown parameters and external disturbances. At first, the tracking error system is derived for each mobile robot with the aid of a global invertible transformation, which consists of two subsystems, one is a first-order subsystem and another is a second-order subsystem. Then, the two subsystems are studied respectively, and finite-time disturbance observers are proposed for each robot to estimate the external disturbances. Meanwhile, distributed finite-time tracking controllers are developed for each mobile robot such that all states of each robot can reach the desired value in finite time, where the desired reference value is assumed to be the trajectory of a virtual leader whose information is available to only a subset of the followers, and the followers are assumed to have only local interaction. The effectiveness of the theoretical results is finally illustrated by numerical simulations.

Tracers vs. trajectories in a coastal region

Science.gov (United States)

Engqvist, A.; Döös, K.

2008-12-01

Two different methods of estimating the water exchange through a Baltic coastal region have been used, consisting of particle trajectories and passive tracers. Water is traced from and to a small discharge region near the coast. The discharge material in this region is treated as zero dimensional particles or tracers with neutral buoyancy. The real discharge material could be a leakage of radio-nuclides through the sea floor from an underground repository of nuclear waste. Water exchange rates between the discharge region and the model domain are estimated using both forward and backward trajectories as well as passive tracers. The Lagrangian trajectories can account for the time evolution of the water exchange while the tracers give one average age per model grid box. Water exchange times such as residence time, age and transient times have been calculated with trajectories but only the average age (AvA) for tracers. The trajectory calculations provide a more detailed time evolution than the tracers. On the other hand the tracers are integrated "on-line" simultaneously in the sea circulation model with the same time step while the Lagrangian trajectories are integrated "off-line" from the stored model velocities with its inherent temporal resolution, presently one hour. The sub-grid turbulence is parameterised as a Laplacian diffusion for the passive tracers and with an extra stochastic velocity for trajectories. The importance of the parameterised sub-grid turbulence for the trajectories is estimated to give an extra diffusion of the same order as the Laplacian diffusion by comparing the Lagrangian dispersions with and without parameterisation. The results of the different methods are similar but depend on the chosen diffusivity coefficient with a slightly higher correlation between trajectories and tracers when integrated with a lower diffusivity coefficient.

Design of Quiet Rotorcraft Approach Trajectories

Science.gov (United States)

Padula, Sharon L.; Burley, Casey L.; Boyd, D. Douglas, Jr.; Marcolini, Michael A.

2009-01-01

A optimization procedure for identifying quiet rotorcraft approach trajectories is proposed and demonstrated. The procedure employs a multi-objective genetic algorithm in order to reduce noise and create approach paths that will be acceptable to pilots and passengers. The concept is demonstrated by application to two different helicopters. The optimized paths are compared with one another and to a standard 6-deg approach path. The two demonstration cases validate the optimization procedure but highlight the need for improved noise prediction techniques and for additional rotorcraft acoustic data sets.

Vision-based map building and trajectory planning to enable autonomous flight through urban environments

Science.gov (United States)

Watkins, Adam S.

The desire to use Unmanned Air Vehicles (UAVs) in a variety of complex missions has motivated the need to increase the autonomous capabilities of these vehicles. This research presents autonomous vision-based mapping and trajectory planning strategies for a UAV navigating in an unknown urban environment. It is assumed that the vehicle's inertial position is unknown because GPS in unavailable due to environmental occlusions or jamming by hostile military assets. Therefore, the environment map is constructed from noisy sensor measurements taken at uncertain vehicle locations. Under these restrictions, map construction becomes a state estimation task known as the Simultaneous Localization and Mapping (SLAM) problem. Solutions to the SLAM problem endeavor to estimate the state of a vehicle relative to concurrently estimated environmental landmark locations. The presented work focuses specifically on SLAM for aircraft, denoted as airborne SLAM, where the vehicle is capable of six degree of freedom motion characterized by highly nonlinear equations of motion. The airborne SLAM problem is solved with a variety of filters based on the Rao-Blackwellized particle filter. Additionally, the environment is represented as a set of geometric primitives that are fit to the three-dimensional points reconstructed from gathered onboard imagery. The second half of this research builds on the mapping solution by addressing the problem of trajectory planning for optimal map construction. Optimality is defined in terms of maximizing environment coverage in minimum time. The planning process is decomposed into two phases of global navigation and local navigation. The global navigation strategy plans a coarse, collision-free path through the environment to a goal location that will take the vehicle to previously unexplored or incompletely viewed territory. The local navigation strategy plans detailed, collision-free paths within the currently sensed environment that maximize local coverage

Time-optimal control with finite bandwidth

Science.gov (United States)

Hirose, M.; Cappellaro, P.

2018-04-01

Time-optimal control theory provides recipes to achieve quantum operations with high fidelity and speed, as required in quantum technologies such as quantum sensing and computation. While technical advances have achieved the ultrastrong driving regime in many physical systems, these capabilities have yet to be fully exploited for the precise control of quantum systems, as other limitations, such as the generation of higher harmonics or the finite response time of the control apparatus, prevent the implementation of theoretical time-optimal control. Here we present a method to achieve time-optimal control of qubit systems that can take advantage of fast driving beyond the rotating wave approximation. We exploit results from time-optimal control theory to design driving protocols that can be implemented with realistic, finite-bandwidth control fields, and we find a relationship between bandwidth limitations and achievable control fidelity.

Mapping emotions through time: how affective trajectories inform the language of emotion.

Science.gov (United States)

Kirkland, Tabitha; Cunningham, William A

2012-04-01

The words used to describe emotions can provide insight into the basic processes that contribute to emotional experience. We propose that emotions arise partly from interacting evaluations of one's current affective state, previous affective state, predictions for how these may change in the future, and the experienced outcomes following these predictions. These states can be represented and inferred from neural systems that encode shifts in outcomes and make predictions. In two studies, we demonstrate that emotion labels are reliably differentiated from one another using only simple cues about these affective trajectories through time. For example, when a worse-than-expected outcome follows the prediction that something good will happen, that situation is labeled as causing anger, whereas when a worse-than-expected outcome follows the prediction that something bad will happen, that situation is labeled as causing sadness. Emotion categories are more differentiated when participants are required to think categorically than when participants have the option to consider multiple emotions and degrees of emotions. This work indicates that information about affective movement through time and changes in affective trajectory may be a fundamental aspect of emotion categories. Future studies of emotion must account for the dynamic way that we absorb and process information. (PsycINFO Database Record (c) 2012 APA, all rights reserved).

Estimating Attitude, Trajectory, and Gyro Biases in an Extended Kalman Filter using Earth Magnetic Field Data from the Rossi X-Ray Timing Explorer

Science.gov (United States)

Deutschmann, Julie; Bar-Itzhack, Itzhack

1997-01-01

Traditionally satellite attitude and trajectory have been estimated with completely separate systems, using different measurement data. The estimation of both trajectory and attitude for low earth orbit satellites has been successfully demonstrated in ground software using magnetometer and gyroscope data. Since the earth's magnetic field is a function of time and position, and since time is known quite precisely, the differences between the computed and measured magnetic field components, as measured by the magnetometers throughout the entire spacecraft orbit, are a function of both the spacecraft trajectory and attitude errors. Therefore, these errors can be used to estimate both trajectory and attitude. This work further tests the single augmented Extended Kalman Filter (EKF) which simultaneously and autonomously estimates spacecraft trajectory and attitude with data from the Rossi X-Ray Timing Explorer (RXTE) magnetometer and gyro-measured body rates. In addition, gyro biases are added to the state and the filter's ability to estimate them is presented.

Trajectory Optimization and Conceptual Study of Small Test Vehicles for Hypersonic Engine Using High-Altitude Balloon

Science.gov (United States)

Tsuchiya, Takeshi; Takenaka, Youichi; Taguchi, Hideyuki; Sawai, Shujiro

Japan Aerospace Exploration Agency, JAXA announced a long-term vision recently. In the vision, JAXA aims to develop hypersonic aircrafts. A pre-cooled turbojet engine has great potential as one of newly developed hypersonic air-breathing engines. We also expect the engine to be installed in space transportation vehicles in future. For combustion test in real flight condition of the engines, JAXA has an experimental plan with a small test vehicle falling from a high-altitude balloon. This paper applies numerical analysis and optimization techniques to conceptual designs of the test vehicle in order to obtain the best configuration and trajectory that can achieve the flight test. The results show helpful knowledge when we design prototype vehicles.

Time optimal paths for high speed maneuvering

Energy Technology Data Exchange (ETDEWEB)

Reister, D.B.; Lenhart, S.M.

1993-01-01

Recent theoretical results have completely solved the problem of determining the minimum length path for a vehicle with a minimum turning radius moving from an initial configuration to a final configuration. Time optimal paths for a constant speed vehicle are a subset of the minimum length paths. This paper uses the Pontryagin maximum principle to find time optimal paths for a constant speed vehicle. The time optimal paths consist of sequences of axes of circles and straight lines. The maximum principle introduces concepts (dual variables, bang-bang solutions, singular solutions, and transversality conditions) that provide important insight into the nature of the time optimal paths. We explore the properties of the optimal paths and present some experimental results for a mobile robot following an optimal path.

Flash trajectory imaging of target 3D motion

Science.gov (United States)

Wang, Xinwei; Zhou, Yan; Fan, Songtao; He, Jun; Liu, Yuliang

2011-03-01

We present a flash trajectory imaging technique which can directly obtain target trajectory and realize non-contact measurement of motion parameters by range-gated imaging and time delay integration. Range-gated imaging gives the range of targets and realizes silhouette detection which can directly extract targets from complex background and decrease the complexity of moving target image processing. Time delay integration increases information of one single frame of image so that one can directly gain the moving trajectory. In this paper, we have studied the algorithm about flash trajectory imaging and performed initial experiments which successfully obtained the trajectory of a falling badminton. Our research demonstrates that flash trajectory imaging is an effective approach to imaging target trajectory and can give motion parameters of moving targets.

A model predictive control approach combined unscented Kalman filter vehicle state estimation in intelligent vehicle trajectory tracking

Directory of Open Access Journals (Sweden)

Hongxiao Yu

2015-05-01

Full Text Available Trajectory tracking and state estimation are significant in the motion planning and intelligent vehicle control. This article focuses on the model predictive control approach for the trajectory tracking of the intelligent vehicles and state estimation of the nonlinear vehicle system. The constraints of the system states are considered when applying the model predictive control method to the practical problem, while 4-degree-of-freedom vehicle model and unscented Kalman filter are proposed to estimate the vehicle states. The estimated states of the vehicle are used to provide model predictive control with real-time control and judge vehicle stability. Furthermore, in order to decrease the cost of solving the nonlinear optimization, the linear time-varying model predictive control is used at each time step. The effectiveness of the proposed vehicle state estimation and model predictive control method is tested by driving simulator. The results of simulations and experiments show that great and robust performance is achieved for trajectory tracking and state estimation in different scenarios.

Trajectory-tracking control of underwater inspection robot for nuclear reactor internals using Time Delay Control

International Nuclear Information System (INIS)

Park, Joon-Young; Cho, Byung-Hak; Lee, Jae-Kyung

2009-01-01

This paper addresses the trajectory control problem of an underwater inspection robot for nuclear reactor internals. From the viewpoint of control engineering, the trajectory control of the underwater robot is a difficult task due to its nonlinear dynamics, which includes various hydraulic forces such as buoyancy and hydrodynamic damping, the difference between the centres of gravity and buoyancy, and disturbances from a tether cable. To solve such problems, we applied Time Delay Control to the underwater robot. This control law has a very simple structure not requiring nonlinear plant dynamics, and was proven to be highly robust against nonlinearities, uncertainties and disturbances. We confirmed its effectiveness through experiments.

Estimation Trajectory of the Low-Frequency Floating Car Considering the Traffic Control

Directory of Open Access Journals (Sweden)

Zhijian Wang

2013-01-01

Full Text Available Floating car equipped with GPS to detect traffic flow has been widely used in ITS research and applications. The trajectory estimation is the most critical and complex part in the floating vehicle information processing system. However, the trajectory estimation would be more difficult when using the low-frequency data sampling because of the high communication cost and the numerous data. Specifically, the ordinary algorithm cannot determine the specific vehicle paths with two anchor points across multiple intersections. Considering the accuracy in map matching, this paper used a delay matching algorithm and studied the trajectory estimation algorithm focusing on the issue of existence of a small road network between two anchor points. A method considering the three multiobjective factors of signal control and driving distance and number of intersections was developed. Firstly, an optimal solution set was acquired according to multiobjective decision theory and Pareto optimal principles in game theory. Then, the optimal solution set was evaluated synthetically based on the fuzzy set theory. Finally, the candidate trajectory which is the core evaluation factor was identified as the best possible travel path. The algorithm was validated by using the real traffic data in Wangjing area of Beijing. The results showed that the algorithm can get a better trajectory estimation and provide more traffic information to traffic management department.

Development of an Integrated Intelligent Multi -Objective Framework for UAV Trajectory Generation

Science.gov (United States)

Wilburn, Jennifer Nicole

. Finally, to increase the effectiveness and autonomy of these pose-based trajectory generation methodologies, an immunity-based evolutionary optimization algorithm is developed to select a viable and locally-optimal trajectory through an environment while observing desired points of interest and minimizing threat exposure, path length, and estimated fuel consumption. The algorithm is effective for both 2D and 3D routes, as well as combinations thereof. A brief demonstration is provided for this algorithm. Due to the calculation time requirements, this algorithm is recommended for offline use.

Fuel optimization for low-thrust Earth-Moon transfer via indirect optimal control

Science.gov (United States)

Pérez-Palau, Daniel; Epenoy, Richard

2018-02-01

The problem of designing low-energy transfers between the Earth and the Moon has attracted recently a major interest from the scientific community. In this paper, an indirect optimal control approach is used to determine minimum-fuel low-thrust transfers between a low Earth orbit and a Lunar orbit in the Sun-Earth-Moon Bicircular Restricted Four-Body Problem. First, the optimal control problem is formulated and its necessary optimality conditions are derived from Pontryagin's Maximum Principle. Then, two different solution methods are proposed to overcome the numerical difficulties arising from the huge sensitivity of the problem's state and costate equations. The first one consists in the use of continuation techniques. The second one is based on a massive exploration of the set of unknown variables appearing in the optimality conditions. The dimension of the search space is reduced by considering adapted variables leading to a reduction of the computational time. The trajectories found are classified in several families according to their shape, transfer duration and fuel expenditure. Finally, an analysis based on the dynamical structure provided by the invariant manifolds of the two underlying Circular Restricted Three-Body Problems, Earth-Moon and Sun-Earth is presented leading to a physical interpretation of the different families of trajectories.

Technical description of the RIVM trajectory model

Energy Technology Data Exchange (ETDEWEB)

De Waal, E.S.; Van Pul, W.A.J.

1995-12-01

The RIVM trajectory model, described in this report, enables calculation of a backward or forward trajectory. These trajectories are used to `follow` previous released air pollution in a backward mode or to `find` the origin of air pollution in a forward mode. The trajectories are used in the smog forecasting and in the TREND model for the distribution of materials in Europe. Presently 6-hourly ECMWF wind fields at 1000 and 850 hPa, with 3 deg x 3 deg latitude-longitude resolution are used. Wind fields with a different resolution in latitude-longitude can also be used after simple adjustments. An iterative method, described elsewhere, is applied to calculate the trajectories. Within limits, the user is free to choose the time step (1, 2 or 6-hour), transport height, length, starting or arrival date and starting or arrival position of the trajectory. The differences between the trajectories calculated with time steps of 1, 2 and 6 h were small. For the 96-hour trajectories at 1000 and 850 hPa the deviations were generally within 1 deg latitude and longitude, i.e. 100-200 km. The trajectory calculated with the 6-hour time step could be used without a great loss in accuracy compared to the calculations with the 1-hour time step. A typical error in the trajectory path at 1000 and 850 hPa was 500 km, which is about 30% of a typical travel distance. However, close to quickly changing weather systems, such as cyclones, the error can be as large as the travel distance and makes the calculations unreliable. The error in the forecasted trajectory was found to be larger than the above error estimation due to larger uncertainties in the forecasted compared to the analyzed wind fields. A manual on how to run the model is also given. 5 figs., 3 tabs., 5 refs., 6 appendices

Distinguished hyperbolic trajectories in time-dependent fluid flows: analytical and computational approach for velocity fields defined as data sets

Directory of Open Access Journals (Sweden)

K. Ide

2002-01-01

Full Text Available In this paper we develop analytical and numerical methods for finding special hyperbolic trajectories that govern geometry of Lagrangian structures in time-dependent vector fields. The vector fields (or velocity fields may have arbitrary time dependence and be realized only as data sets over finite time intervals, where space and time are discretized. While the notion of a hyperbolic trajectory is central to dynamical systems theory, much of the theoretical developments for Lagrangian transport proceed under the assumption that such a special hyperbolic trajectory exists. This brings in new mathematical issues that must be addressed in order for Lagrangian transport theory to be applicable in practice, i.e. how to determine whether or not such a trajectory exists and, if it does exist, how to identify it in a sequence of instantaneous velocity fields. We address these issues by developing the notion of a distinguished hyperbolic trajectory (DHT. We develop an existence criteria for certain classes of DHTs in general time-dependent velocity fields, based on the time evolution of Eulerian structures that are observed in individual instantaneous fields over the entire time interval of the data set. We demonstrate the concept of DHTs in inhomogeneous (or "forced" time-dependent linear systems and develop a theory and analytical formula for computing DHTs. Throughout this work the notion of linearization is very important. This is not surprising since hyperbolicity is a "linearized" notion. To extend the analytical formula to more general nonlinear time-dependent velocity fields, we develop a series of coordinate transforms including a type of linearization that is not typically used in dynamical systems theory. We refer to it as Eulerian linearization, which is related to the frame independence of DHTs, as opposed to the Lagrangian linearization, which is typical in dynamical systems theory, which is used in the computation of Lyapunov exponents. We

TH-C-12A-05: Dynamic Couch Motion for Improvement of Radiation Therapy Trajectories in DCA and VMAT

Energy Technology Data Exchange (ETDEWEB)

MacDonald, L [Dalhousie University, Halifax, Nova Scotia (Canada); Thomas, Christopher [MCCPM, Capital District Health Authority, Halifax, Nova Scotia (Canada)

2014-06-15

Purpose: To investigate the potential improvement in dosimetric external beam radiation therapy plan quality using an optimized dynamic gantry and couch motion trajectory which minimizes exposure to the organs at risk. Methods: Patient-specific anatomical information of head-and-neck and cranial cancer patients was used to quantify the geometric overlap between target volumes and organs-at-risk (OARs) based on their two-dimensional projection from source to a plane at isocentre as a function of gantry and couch angle. QUANTEC dose constraints were then used as weighting factors for the OARs to generate a map of couch-gantry coordinate space indicating degree of overlap at each point in space. A couch-gantry collision space was generated by direct measurement on a Varian Truebeam linac using an anthropomorphic solid-water phantom. A dynamic, fully customizable algorithm was written to generate a navigable ideal trajectory for the patient specific couch-gantry space. The advanced algorithm includes weighting factors which can be used to balance the implementation of absolute minimum values of overlap, with the clinical practicality of largescale couch motion and delivery time. Optimized trajectories were calculated for cranial DCA treatments and for head-and-neck VMAT treatments and compared to conventional DCA and VMAT treatment trajectories. Results: Comparison of optimized treatment trajectories with conventional treatment trajectories indicates a decrease in dose to the organs-at-risk between 4.64% and 6.82% (2.39 and 3.52 Gy) of the prescription dose per patient per organ at risk. Conclusion: Using simultaneous couch and gantry motion during radiation therapy to minimize the geometrical overlap in the beams-eye-view target volumes and the organs-at-risk can have an appreciable dose reduction to organs-at-risk.

TH-C-12A-05: Dynamic Couch Motion for Improvement of Radiation Therapy Trajectories in DCA and VMAT

International Nuclear Information System (INIS)

MacDonald, L; Thomas, Christopher

2014-01-01

Purpose: To investigate the potential improvement in dosimetric external beam radiation therapy plan quality using an optimized dynamic gantry and couch motion trajectory which minimizes exposure to the organs at risk. Methods: Patient-specific anatomical information of head-and-neck and cranial cancer patients was used to quantify the geometric overlap between target volumes and organs-at-risk (OARs) based on their two-dimensional projection from source to a plane at isocentre as a function of gantry and couch angle. QUANTEC dose constraints were then used as weighting factors for the OARs to generate a map of couch-gantry coordinate space indicating degree of overlap at each point in space. A couch-gantry collision space was generated by direct measurement on a Varian Truebeam linac using an anthropomorphic solid-water phantom. A dynamic, fully customizable algorithm was written to generate a navigable ideal trajectory for the patient specific couch-gantry space. The advanced algorithm includes weighting factors which can be used to balance the implementation of absolute minimum values of overlap, with the clinical practicality of largescale couch motion and delivery time. Optimized trajectories were calculated for cranial DCA treatments and for head-and-neck VMAT treatments and compared to conventional DCA and VMAT treatment trajectories. Results: Comparison of optimized treatment trajectories with conventional treatment trajectories indicates a decrease in dose to the organs-at-risk between 4.64% and 6.82% (2.39 and 3.52 Gy) of the prescription dose per patient per organ at risk. Conclusion: Using simultaneous couch and gantry motion during radiation therapy to minimize the geometrical overlap in the beams-eye-view target volumes and the organs-at-risk can have an appreciable dose reduction to organs-at-risk

Time-Optimal Real-Time Test Case Generation using UPPAAL

DEFF Research Database (Denmark)

Hessel, Anders; Larsen, Kim Guldstrand; Nielsen, Brian

2004-01-01

Testing is the primary software validation technique used by industry today, but remains ad hoc, error prone, and very expensive. A promising improvement is to automatically generate test cases from formal models of the system under test. We demonstrate how to automatically generate real...... test purposes or generated automatically from various coverage criteria of the model.......-time conformance test cases from timed automata specifications. Specifically we demonstrate how to fficiently generate real-time test cases with optimal execution time i.e test cases that are the fastest possible to execute. Our technique allows time optimal test cases to be generated using manually formulated...

Analysis of Methods of Determining the Safe Ship Trajectory

Directory of Open Access Journals (Sweden)

Jozef Lisowski

2016-07-01

Full Text Available The paper describes six methods of optimal and game theory and artificial neural network for synthesis of safe control in collision situations at sea. The application of optimal and game control algorithms to determine the own ship safe trajectory during the passing of other encountered ships in good and restricted visibility at sea is presented. The comparison of the safe ship control in collision situation: multi-step matrix non-cooperative and cooperative games, multi-stage positional non-cooperative and cooperative games have been introduced. The considerations have been illustrated with examples of computer simulation of the algorithms to determine safe of own ship trajectories in a navigational situation during passing of eight met ships.

Time-optimal path planning in uncertain flow fields using ensemble method

KAUST Repository

Wang, Tong

2016-01-06

An ensemble-based approach is developed to conduct time-optimal path planning in unsteady ocean currents under uncertainty. We focus our attention on two-dimensional steady and unsteady uncertain flows, and adopt a sampling methodology that is well suited to operational forecasts, where a set deterministic predictions is used to model and quantify uncertainty in the predictions. In the operational setting, much about dynamics, topography and forcing of the ocean environment is uncertain, and as a result a single path produced by a model simulation has limited utility. To overcome this limitation, we rely on a finitesize ensemble of deterministic forecasts to quantify the impact of variability in the dynamics. The uncertainty of flow field is parametrized using a finite number of independent canonical random variables with known densities, and the ensemble is generated by sampling these variables. For each the resulting realizations of the uncertain current field, we predict the optimal path by solving a boundary value problem (BVP), based on the Pontryagin maximum principle. A family of backward-in-time trajectories starting at the end position is used to generate suitable initial values for the BVP solver. This allows us to examine and analyze the performance of sampling strategy, and develop insight into extensions dealing with regional or general circulation models. In particular, the ensemble method enables us to perform a statistical analysis of travel times, and consequently develop a path planning approach that accounts for these statistics. The proposed methodology is tested for a number of scenarios. We first validate our algorithms by reproducing simple canonical solutions, and then demonstrate our approach in more complex flow fields, including idealized, steady and unsteady double-gyre flows.

Absolute continuity under time shift of trajectories and related stochastic calculus

CERN Document Server

Löbus, Jörg-Uwe

2017-01-01

The text is concerned with a class of two-sided stochastic processes of the form X=W+A. Here W is a two-sided Brownian motion with random initial data at time zero and A\\equiv A(W) is a function of W. Elements of the related stochastic calculus are introduced. In particular, the calculus is adjusted to the case when A is a jump process. Absolute continuity of (X,P) under time shift of trajectories is investigated. For example under various conditions on the initial density with respect to the Lebesgue measure, m, and on A with A_0=0 we verify \\frac{P(dX_{\\cdot -t})}{P(dX_\\cdot)}=\\frac{m(X_{-t})}{m(X_0)}\\cdot \\prod_i\\left|\

Distributed Algorithms for Time Optimal Reachability Analysis

DEFF Research Database (Denmark)

Zhang, Zhengkui; Nielsen, Brian; Larsen, Kim Guldstrand

2016-01-01

. We propose distributed computing to accelerate time optimal reachability analysis. We develop five distributed state exploration algorithms, implement them in \\uppaal enabling it to exploit the compute resources of a dedicated model-checking cluster. We experimentally evaluate the implemented...... algorithms with four models in terms of their ability to compute near- or proven-optimal solutions, their scalability, time and memory consumption and communication overhead. Our results show that distributed algorithms work much faster than sequential algorithms and have good speedup in general.......Time optimal reachability analysis is a novel model based technique for solving scheduling and planning problems. After modeling them as reachability problems using timed automata, a real-time model checker can compute the fastest trace to the goal states which constitutes a time optimal schedule...

Trajectory Planning of Satellite Formation Flying using Nonlinear Programming and Collocation

Directory of Open Access Journals (Sweden)

Hyung-Chu Lim

2008-12-01

Full Text Available Recently, satellite formation flying has been a topic of significant research interest in aerospace society because it provides potential benefits compared to a large spacecraft. Some techniques have been proposed to design optimal formation trajectories minimizing fuel consumption in the process of formation configuration or reconfiguration. In this study, a method is introduced to build fuel-optimal trajectories minimizing a cost function that combines the total fuel consumption of all satellites and assignment of fuel consumption rate for each satellite. This approach is based on collocation and nonlinear programming to solve constraints for collision avoidance and the final configuration. New constraints of nonlinear equality or inequality are derived for final configuration, and nonlinear inequality constraints are established for collision avoidance. The final configuration constraints are that three or more satellites should form a projected circular orbit and make an equilateral polygon in the horizontal plane. Example scenarios, including these constraints and the cost function, are simulated by the method to generate optimal trajectories for the formation configuration and reconfiguration of multiple satellites.

Dynamic optimization of dead-end membrane filtration

NARCIS (Netherlands)

Blankert, B.; Betlem, Bernardus H.L.; Roffel, B.; Marquardt, Wolfgang; Pantelides, Costas

2006-01-01

An operating strategy aimed at minimizing the energy consumption during the filtration phase of dead-end membrane filtration has been formulated. A method allowing fast calculation of trajectories is used to allow incorporation in a hierarchical optimization scheme. The optimal trajectory can be

Time-optimal feedback control for linear systems

International Nuclear Information System (INIS)

Mirica, S.

1976-01-01

The paper deals with the results of qualitative investigations of the time-optimal feedback control for linear systems with constant coefficients. In the first section, after some definitions and notations, two examples are given and it is shown that even the time-optimal control problem for linear systems with constant coefficients which looked like ''completely solved'' requires a further qualitative investigation of the stability to ''permanent perturbations'' of optimal feedback control. In the second section some basic results of the linear time-optimal control problem are reviewed. The third section deals with the definition of Boltyanskii's ''regular synthesis'' and its connection to Filippov's theory of right-hand side discontinuous differential equations. In the fourth section a theorem is proved concerning the stability to perturbations of time-optimal feedback control for linear systems with scalar control. In the last two sections it is proved that, if the matrix which defines the system has only real eigenvalues or is three-dimensional, the time-optimal feedback control defines a regular synthesis and therefore is stable to perturbations. (author)

The Locus of the apices of projectile trajectories under constant drag

OpenAIRE

Hernández-Saldaña, H.

2017-01-01

We present an analytical solution for the projectile coplanar motion under constant drag parametrised by the velocity angle. We found the locus formed by the apices of the projectile trajectories. The range and time of flight are obtained numerically and we find that the optimal launching angle is smaller than in the free drag case. This is a good example of problems with constant dissipation of energy that includes curvature, and it is proper for intermediate courses of mechanics.

Lung cancer care trajectory at a Canadian centre: an evaluation of how wait times affect clinical outcomes.

Science.gov (United States)

Kasymjanova, G; Small, D; Cohen, V; Jagoe, R T; Batist, G; Sateren, W; Ernst, P; Pepe, C; Sakr, L; Agulnik, J

2017-10-01

Lung cancer continues to be one of the most common cancers in Canada, with approximately 28,400 new cases diagnosed each year. Although timely care can contribute substantially to quality of life for patients, it remains unclear whether it also improves patient outcomes. In this work, we used a set of quality indicators that aim to describe the quality of care in lung cancer patients. We assessed adherence with existing guidelines for timeliness of lung cancer care and concordance with existing standards of treatment, and we examined the association between timeliness of care and lung cancer survival. Patients with lung cancer diagnosed between 2010 and 2015 were identified from the Pulmonary Division Lung Cancer Registry at our centre. We demonstrated that the interdisciplinary pulmonary oncology service successfully treated most of its patients within the recommended wait times. However, there is still work to be done to decrease variation in wait time. Our results demonstrate a significant association between wait time and survival, supporting the need for clinicians to optimize the patient care trajectory. It would be helpful for Canadian clinicians treating patients with lung cancer to have wait time guidelines for all treatment modalities, together with standard definitions for all time intervals. Any reductions in wait times should be balanced against the need for thorough investigation before initiating treatment. We believe that our unique model of care leads to an acceleration of diagnostic steps. Avoiding any delay associated with referral to a medical oncologist for treatment could be an acceptable strategy with respect to reducing wait time.

Real Time Visualization and Manipulation of the Metastatic Trajectory ofBreast Cancer Cell

Science.gov (United States)

2017-09-01

AWARD NUMBER: W81XWH-13-1-0173 TITLE: Real-Time Visualization and Manipulation of the Metastatic Trajectory of Breast Cancer Cells ...of this work was to engineer breast cancer cells to irreversibly alter the genome of nearby cells through exosomal transfer of Cre recombinase from...the cancer cells to surrounding cells . Our goal was to use this study to activate green fluorescent protein in the host reporter cells in the

Numerical static state feedback laws for closed-loop singular optimal control

NARCIS (Netherlands)

Graaf, de S.C.; Stigter, J.D.; Straten, van G.

2005-01-01

Singular and non-singular control trajectories of agricultural and (bio) chemical processes may need to be recalculated from time to time for use in closed-loop optimal control, because of unforeseen changes in state values and noise. This is time consuming. As an alternative, in this paper,

Prevalence, trajectories, and determinants of television viewing time in an ethnically diverse sample of young children from the UK.

Science.gov (United States)

Barber, Sally E; Kelly, Brian; Collings, Paul J; Nagy, Liana; Bywater, Tracey; Wright, John

2017-07-06

Excessive screen viewing in early childhood is associated with poor physical and psycho-social health and poor cognitive development. This study aimed to understand the prevalence, trajectory and determinants of television viewing time in early childhood to inform intervention development. In this prospective longitudinal study, mothers of 1558 children (589 white British, 757 Pakistani heritage, 212 other ethnicities) completed questionnaires when their children were approximately 6, 12, 18, 24 and 36 months old. Mothers answered questions about their own and their child's TV-time. TV-time trajectories were estimated by linear longitudinal multilevel modeling, potential determinants were considered in models. The modelled trajectory estimated that 75% of children aged 12 months exceeded guidelines of zero screen-time. At 12 months of age an accelerated increase in TV-time was observed (2 h/day by 30 months old). For every hour of mothers' TV-time and every hour the TV was on in the home, children's TV-time was 8 min and 1 min higher respectively at 6 months old (P child did not watch too much TV, had 17 min more TV-time than their counterparts (P television is on in the home and mothers' attitude towards child TV-time. These behaviours may be key components to address in interventions for parents. Mothers experiencing stress, first time mothers, and Pakistani heritage mothers (particularly those born outside of the UK), may be priority groups for intervention.

Intelligent landing strategy for the small bodies: from passive bounce to active trajectory control

Science.gov (United States)

Cui, Pingyuan; Liu, Yanjie; Yu, Zhengshi; Zhu, Shengying; Shao, Wei

2017-08-01

Landing exploration is an important way to improve the understanding of small bodies. Considering the weak gravity field as well as the strict attitude constraints which make bounce a common situation and a tough issue for safe landing on small bodies, a novel active trajectory control-based intelligent landing strategy is proposed to improve the safety and reliability of mission. The scenarios of intelligent landing strategy for both safe landing and hopping exploration are introduced in detail and a potential structure for autonomous navigation and control system is presented. Furthermore, a convex optimization-based control algorithm is developed, which is the key technology fulfilling the active trajectory control. Meanwhile a novel discretization method based on the fourth-order Runge-Kutta rule is proposed to improve the accuracy. A helpful adjustment process of time-to-landing is also introduced when the feasible trajectory does not exist. Comprehensive simulations about the proposed intelligent landing strategy are performed to demonstrate the improved safety and accuracy of both landing and hopping exploration on small bodies. Meanwhile, the performance and accuracy of the proposed convex optimization-based control algorithms is also compared and discussed thoroughly. Some useful conclusions for control system design are also obtained.

An Improved Genetic Algorithm to Optimize Spatial Locations for Double-Wishbone Type Suspension System with Time Delay

Directory of Open Access Journals (Sweden)

Qiang Li

2018-01-01

Full Text Available By taking account of double-wishbone independent suspension with two unequal-length arms, the coordinate values of articulated geometry are based on structural limitations and constraint equations of alignment parameters. The sensitivities of front wheel alignment parameters are analyzed using the space analytic geometry method with insight module in ADAMS® software. The multiobjective optimization functions are designed to calculate the coordinate values of hardpoints with front suspension since the effect of time delay due to wheelbase can be easily obtained by vehicle speed. The K&C characteristics have been investigated using GA solutions in the simulation environment. The camber angle decreases from 1.152° to 1.05° and toe-in angle reduces from 1.036° to 0.944°. The simulation results demonstrate that the suggested optimization method is able to satisfy the suspension motion to enhance ride comfort. Experimental results, obtained by K&C test bench, also indicate that the optimized suspension can track the desired trajectory while keeping the vehicle performance in various road conditions.

Optimization of time characteristics in activation analysis

International Nuclear Information System (INIS)

Gurvich, L.G.; Umaraliev, A.T.

2006-01-01

Full text: The activation analysis temporal characteristics optimization methods developed at present are aimed at determination of optimal values of the three important parameters - irradiation time, cooling time and measurement time. In the performed works, especially in [1-5] the activation analysis processes are described, the optimal values of optimization parameters are obtained from equations solved, and the computational results are given for these parameters for a number of elements. However, the equations presented in [2] were inaccurate, did not allow one to have optimization parameters results for one element content calculations, and it did not take into account background dependence of time. Therefore, we proposed modified equations to determine the optimal temporal parameters and iteration processes for the solution of these equations. It is well-known that the activity of studied sample during measurements does not change significantly, i.e. measurement time is much shorter than the half-life, thus the processes taking place can be described by the Poisson probability distribution, and in general case one can apply binomial distribution. The equation and iteration processes use in this research describe both probability distributions. Expectedly, the cooling time iteration expressions obtained for one element analysis case are similar for the both distribution types, as the optimised time values occurred to be of the same order as half-life values, whereas the cooling time, as we observed, depends on the ratio of the studied sample's peak value to the background peak, and can be significantly larger than the half-life value. This pattern is general, and can be derived from the optimized time expressions, which is supported by the experimental data on short-living isotopes [3,4]. For the isotopes with large half-lives, up to years, like cobalt-60, the cooling time values given in the above mentioned works are equal to months which, apparently

Aircraft 4D trajectories planning under uncertainties

OpenAIRE

Chaimatanan , Supatcha; Delahaye , Daniel; Mongeau , Marcel

2015-01-01

International audience; To sustain the rapidly increasing air traffic demand, the future air traffic management system will rely on a concept, called Trajectory-Based Operations (TBO), that will require aircraft to follow an assigned 4D trajectory (time-constrained trajectory) with high precision. TBO involves separating aircraft via strategic (long-term) trajectory deconfliction rather than the currently-practicing tactical (short-term) conflict resolution. In this context, this paper presen...

Automatic trajectory measurement of large numbers of crowded objects

Science.gov (United States)

Li, Hui; Liu, Ye; Chen, Yan Qiu

2013-06-01

Complex motion patterns of natural systems, such as fish schools, bird flocks, and cell groups, have attracted great attention from scientists for years. Trajectory measurement of individuals is vital for quantitative and high-throughput study of their collective behaviors. However, such data are rare mainly due to the challenges of detection and tracking of large numbers of objects with similar visual features and frequent occlusions. We present an automatic and effective framework to measure trajectories of large numbers of crowded oval-shaped objects, such as fish and cells. We first use a novel dual ellipse locator to detect the coarse position of each individual and then propose a variance minimization active contour method to obtain the optimal segmentation results. For tracking, cost matrix of assignment between consecutive frames is trainable via a random forest classifier with many spatial, texture, and shape features. The optimal trajectories are found for the whole image sequence by solving two linear assignment problems. We evaluate the proposed method on many challenging data sets.

Trajectories of Delinquency and Parenting Styles

OpenAIRE

Hoeve, Machteld; Blokland, Arjan; Dubas, Judith Semon; Loeber, Rolf; Gerris, Jan R. M.; van der Laan, Peter H.

2007-01-01

We investigated trajectories of adolescent delinquent development using data from the Pittsburgh Youth Study and examined the extent to which these different trajectories are differentially predicted by childhood parenting styles. Based on self-reported and official delinquency seriousness, covering ages 10?19, we identified five distinct delinquency trajectories differing in both level and change in seriousness over time: a nondelinquent, minor persisting, moderate desisting, serious persist...

Kinematically Optimal Robust Control of Redundant Manipulators

Science.gov (United States)

Galicki, M.

2017-12-01

This work deals with the problem of the robust optimal task space trajectory tracking subject to finite-time convergence. Kinematic and dynamic equations of a redundant manipulator are assumed to be uncertain. Moreover, globally unbounded disturbances are allowed to act on the manipulator when tracking the trajectory by the endeffector. Furthermore, the movement is to be accomplished in such a way as to minimize both the manipulator torques and their oscillations thus eliminating the potential robot vibrations. Based on suitably defined task space non-singular terminal sliding vector variable and the Lyapunov stability theory, we derive a class of chattering-free robust kinematically optimal controllers, based on the estimation of transpose Jacobian, which seem to be effective in counteracting both uncertain kinematics and dynamics, unbounded disturbances and (possible) kinematic and/or algorithmic singularities met on the robot trajectory. The numerical simulations carried out for a redundant manipulator of a SCARA type consisting of the three revolute kinematic pairs and operating in a two-dimensional task space, illustrate performance of the proposed controllers as well as comparisons with other well known control schemes.

WE-AB-209-06: Dynamic Collimator Trajectory Algorithm for Use in VMAT Treatment Deliveries

Energy Technology Data Exchange (ETDEWEB)

MacDonald, L [Department of Medical Physics, Dalhousie University, Halifax, Nova Scotia, CA (Canada); Thomas, C; Syme, A [Department of Medical Physics, Dalhousie University, Halifax, Nova Scotia, CA (Canada); Department of Radiation Oncology, Dalhousie University, Halifax, Nova Scotia (Canada); Medical Physics, Nova Scotia Cancer Centre, Halifax, Nova Scotia (Canada)

2016-06-15

Purpose: To develop advanced dynamic collimator positioning algorithms for optimal beam’s-eye-view (BEV) fitting of targets in VMAT procedures, including multiple metastases stereotactic radiosurgery procedures. Methods: A trajectory algorithm was developed, which can dynamically modify the angle of the collimator as a function of VMAT control point to provide optimized collimation of target volume(s). Central to this algorithm is a concept denoted “whitespace”, defined as area within the jaw-defined BEV field, outside of the PTV, and not shielded by the MLC when fit to the PTV. Calculating whitespace at all collimator angles and every control point, a two-dimensional topographical map depicting the tightness-of-fit of the MLC was generated. A variety of novel searching algorithms identified a number of candidate trajectories of continuous collimator motion. Ranking these candidate trajectories according to their accrued whitespace value produced an optimal solution for navigation of this map. Results: All trajectories were normalized to minimum possible (i.e. calculated without consideration of collimator motion constraints) accrued whitespace. On an acoustic neuroma case, a random walk algorithm generated a trajectory with 151% whitespace; random walk including a mandatory anchor point improved this to 148%; gradient search produced a trajectory with 137%; and bi-directional gradient search generated a trajectory with 130% whitespace. For comparison, a fixed collimator angle of 30° and 330° accumulated 272% and 228% of whitespace, respectively. The algorithm was tested on a clinical case with two metastases (single isocentre) and identified collimator angles that allow for simultaneous irradiation of the PTVs while minimizing normal tissue irradiation. Conclusion: Dynamic collimator trajectories have the potential to improve VMAT deliveries through increased efficiency and reduced normal tissue dose, especially in treatment of multiple cranial metastases

WE-AB-209-06: Dynamic Collimator Trajectory Algorithm for Use in VMAT Treatment Deliveries

International Nuclear Information System (INIS)

MacDonald, L; Thomas, C; Syme, A

2016-01-01

Purpose: To develop advanced dynamic collimator positioning algorithms for optimal beam’s-eye-view (BEV) fitting of targets in VMAT procedures, including multiple metastases stereotactic radiosurgery procedures. Methods: A trajectory algorithm was developed, which can dynamically modify the angle of the collimator as a function of VMAT control point to provide optimized collimation of target volume(s). Central to this algorithm is a concept denoted “whitespace”, defined as area within the jaw-defined BEV field, outside of the PTV, and not shielded by the MLC when fit to the PTV. Calculating whitespace at all collimator angles and every control point, a two-dimensional topographical map depicting the tightness-of-fit of the MLC was generated. A variety of novel searching algorithms identified a number of candidate trajectories of continuous collimator motion. Ranking these candidate trajectories according to their accrued whitespace value produced an optimal solution for navigation of this map. Results: All trajectories were normalized to minimum possible (i.e. calculated without consideration of collimator motion constraints) accrued whitespace. On an acoustic neuroma case, a random walk algorithm generated a trajectory with 151% whitespace; random walk including a mandatory anchor point improved this to 148%; gradient search produced a trajectory with 137%; and bi-directional gradient search generated a trajectory with 130% whitespace. For comparison, a fixed collimator angle of 30° and 330° accumulated 272% and 228% of whitespace, respectively. The algorithm was tested on a clinical case with two metastases (single isocentre) and identified collimator angles that allow for simultaneous irradiation of the PTVs while minimizing normal tissue irradiation. Conclusion: Dynamic collimator trajectories have the potential to improve VMAT deliveries through increased efficiency and reduced normal tissue dose, especially in treatment of multiple cranial metastases

Elastic LiDAR Fusion: Dense Map-Centric Continuous-Time SLAM

OpenAIRE

Park, Chanoh; Moghadam, Peyman; Kim, Soohwan; Elfes, Alberto; Fookes, Clinton; Sridharan, Sridha

2017-01-01

The concept of continuous-time trajectory representation has brought increased accuracy and efficiency to multi-modal sensor fusion in modern SLAM. However, regardless of these advantages, its offline property caused by the requirement of global batch optimization is critically hindering its relevance for real-time and life-long applications. In this paper, we present a dense map-centric SLAM method based on a continuous-time trajectory to cope with this problem. The proposed system locally f...

Trajectories of Achievement within Race/Ethnicity: "Catching Up" in Achievement across Time

Science.gov (United States)

Davis-Kean, Pamela E.; Jager, Justin

2014-01-01

The achievement gap has long been the focus of educational research, policy, and intervention. The authors took a new approach to examining the achievement gap by examining achievement trajectories within each racial group. To identify these trajectories they used the Early Childhood Longitudinal Study-Kindergarten Cohort, which is a nationally…

Time-optimal control of reactor power

International Nuclear Information System (INIS)

Bernard, J.A.

1987-01-01

Control laws that permit adjustments in reactor power to be made in minimum time and without overshoot have been formulated and demonstrated. These control laws which are derived from the standard and alternate dynamic period equations, are closed-form expressions of general applicability. These laws were deduced by noting that if a system is subject to one or more operating constraints, then the time-optimal response is to move the system along these constraints. Given that nuclear reactors are subject to limitations on the allowed reactor period, a time-optimal control law would step the period from infinity to the minimum allowed value, hold the period at that value for the duration of the transient, and then step the period back to infinity. The change in reactor would therefore be accomplished in minimum time. The resulting control laws are superior to other forms of time-optimal control because they are general-purpose, closed-form expressions that are both mathematically tractable and readily implanted. Moreover, these laws include provisions for the use of feedback. The results of simulation studies and actual experiments on the 5 MWt MIT Research Reactor in which these time-optimal control laws were used successfully to adjust the reactor power are presented

An engineering optimization method with application to STOL-aircraft approach and landing trajectories

Science.gov (United States)

Jacob, H. G.

1972-01-01

An optimization method has been developed that computes the optimal open loop inputs for a dynamical system by observing only its output. The method reduces to static optimization by expressing the inputs as series of functions with parameters to be optimized. Since the method is not concerned with the details of the dynamical system to be optimized, it works for both linear and nonlinear systems. The method and the application to optimizing longitudinal landing paths for a STOL aircraft with an augmented wing are discussed. Noise, fuel, time, and path deviation minimizations are considered with and without angle of attack, acceleration excursion, flight path, endpoint, and other constraints.

Engineering applications of discrete-time optimal control

DEFF Research Database (Denmark)

Vidal, Rene Victor Valqui; Ravn, Hans V.

1990-01-01

Many problems of design and operation of engineering systems can be formulated as optimal control problems where time has been discretisized. This is also true even if 'time' is not involved in the formulation of the problem, but rather another one-dimensional parameter. This paper gives a review...... of some well-known and new results in discrete time optimal control methods applicable to practical problem solving within engineering. Emphasis is placed on dynamic programming, the classical maximum principle and generalized versions of the maximum principle for optimal control of discrete time systems...

A Concept for Multi-Criteria Environmental Assessment of Aircraft Trajectories

Directory of Open Access Journals (Sweden)

Sigrun Matthes

2017-08-01

Full Text Available Comprehensive assessment of the environmental aspects of flight movements is of increasing interest to the aviation sector as a potential input for developing sustainable aviation strategies that consider climate impact, air quality and noise issues simultaneously. However, comprehensive assessments of all three environmental aspects do not yet exist and are in particular not yet operational practice in flight planning. The purpose of this study is to present a methodology which allows to establish a multi-criteria environmental impact assessment directly in the flight planning process. The method expands a concept developed for climate optimisation of aircraft trajectories, by representing additionally air quality and noise impacts as additional criteria or dimensions, together with climate impact of aircraft trajectory. We present the mathematical framework for environmental assessment and optimisation of aircraft trajectories. In that context we present ideas on future implementation of such advanced meteorological services into air traffic management and trajectory planning by relying on environmental change functions (ECFs. These ECFs represent environmental impact due to changes in air quality, noise and climate impact. In a case study for Europe prototype ECFs are implemented and a performance assessment of aircraft trajectories is performed for a one-day traffic sample. For a single flight fuel-optimal versus climate-optimized trajectory solution is evaluated using prototypic ECFs and identifying mitigation potential. The ultimate goal of such a concept is to make available a comprehensive assessment framework for environmental performance of aircraft operations, by providing key performance indicators on climate impact, air quality and noise, as well as a tool for environmental optimisation of aircraft trajectories. This framework would allow studying and characterising changes in traffic flows due to environmental optimisation, as well

Remaining Useful Life Estimation using Time Trajectory Tracking and Support Vector Machines

International Nuclear Information System (INIS)

Galar, D; Kumar, U; Lee, J; Zhao, W

2012-01-01

In this paper, a novel RUL prediction method inspired by feature maps and SVM classifiers is proposed. The historical instances of a system with life-time condition data are used to create a classification by SVM hyper planes. For a test instance of the same system, whose RUL is to be estimated, degradation speed is evaluated by computing the minimal distance defined based on the degradation trajectories, i.e. the approach of the system to the hyper plane that segregates good and bad condition data at different time horizon. Therefore, the final RUL of a specific component can be estimated and global RUL information can then be obtained by aggregating the multiple RUL estimations using a density estimation method.

Space-time trajectories of wind power generation: Parameterized precision matrices under a Gaussian copula approach

DEFF Research Database (Denmark)

Tastu, Julija; Pinson, Pierre; Madsen, Henrik

2015-01-01

-correlations. Estimation is performed in a maximum likelihood framework. Based on a test case application in Denmark, with spatial dependencies over 15 areas and temporal ones for 43 hourly lead times (hence, for a dimension of n = 645), it is shown that accounting for space-time effects is crucial for generating skilful......Emphasis is placed on generating space-time trajectories of wind power generation, consisting of paths sampled from high-dimensional joint predictive densities, describing wind power generation at a number of contiguous locations and successive lead times. A modelling approach taking advantage...

Trajectory averaging for stochastic approximation MCMC algorithms

KAUST Repository

Liang, Faming

2010-10-01

The subject of stochastic approximation was founded by Robbins and Monro [Ann. Math. Statist. 22 (1951) 400-407]. After five decades of continual development, it has developed into an important area in systems control and optimization, and it has also served as a prototype for the development of adaptive algorithms for on-line estimation and control of stochastic systems. Recently, it has been used in statistics with Markov chain Monte Carlo for solving maximum likelihood estimation problems and for general simulation and optimizations. In this paper, we first show that the trajectory averaging estimator is asymptotically efficient for the stochastic approximation MCMC (SAMCMC) algorithm under mild conditions, and then apply this result to the stochastic approximation Monte Carlo algorithm [Liang, Liu and Carroll J. Amer. Statist. Assoc. 102 (2007) 305-320]. The application of the trajectory averaging estimator to other stochastic approximationMCMC algorithms, for example, a stochastic approximation MLE algorithm for missing data problems, is also considered in the paper. © Institute of Mathematical Statistics, 2010.

Deep Brain Stimulation for Essential Tremor: Aligning Thalamic and Posterior Subthalamic Targets in 1 Surgical Trajectory.

Science.gov (United States)

Bot, Maarten; van Rootselaar, Fleur; Contarino, Maria Fiorella; Odekerken, Vincent; Dijk, Joke; de Bie, Rob; Schuurman, Richard; van den Munckhof, Pepijn

2017-12-21

Ventral intermediate nucleus (VIM) deep brain stimulation (DBS) and posterior subthalamic area (PSA) DBS suppress tremor in essential tremor (ET) patients, but it is not clear which target is optimal. Aligning both targets in 1 surgical trajectory would facilitate exploring stimulation of either target in a single patient. To evaluate aligning VIM and PSA in 1 surgical trajectory for DBS in ET. Technical aspects of trajectories, intraoperative stimulation findings, final electrode placement, target used for chronic stimulation, and adverse and beneficial effects were evaluated. In 17 patients representing 33 trajectories, we successfully aligned VIM and PSA targets in 26 trajectories. Trajectory distance between targets averaged 7.2 (range 6-10) mm. In all but 4 aligned trajectories, optimal intraoperative tremor suppression was obtained in the PSA. During follow-up, active electrode contacts were located in PSA in the majority of cases. Overall, successful tremor control was achieved in 69% of patients. Stimulation-induced dysarthria or gait ataxia occurred in, respectively, 56% and 44% of patients. Neither difference in tremor suppression or side effects was noted between aligned and nonaligned leads nor between the different locations of chronic stimulation. Alignment of VIM and PSA for DBS in ET is feasible and enables intraoperative exploration of both targets in 1 trajectory. This facilitates positioning of electrode contacts in both areas, where multiple effective points of stimulation can be found. In the majority of aligned leads, optimal intraoperative and chronic stimulation were located in the PSA. Copyright © 2017 by the Congress of Neurological Surgeons

Real-time maneuver optimization of space-based robots in a dynamic environment: Theory and on-orbit experiments

Science.gov (United States)

Chamitoff, Gregory E.; Saenz-Otero, Alvar; Katz, Jacob G.; Ulrich, Steve; Morrell, Benjamin J.; Gibbens, Peter W.

2018-01-01

This paper presents the development of a real-time path-planning optimization approach to controlling the motion of space-based robots. The algorithm is capable of planning three dimensional trajectories for a robot to navigate within complex surroundings that include numerous static and dynamic obstacles, path constraints and performance limitations. The methodology employs a unique transformation that enables rapid generation of feasible solutions for complex geometries, making it suitable for application to real-time operations and dynamic environments. This strategy was implemented on the Synchronized Position Hold Engage Reorient Experimental Satellite (SPHERES) test-bed on the International Space Station (ISS), and experimental testing was conducted onboard the ISS during Expedition 17 by the first author. Lessons learned from the on-orbit tests were used to further refine the algorithm for future implementations.

Nonparametric variational optimization of reaction coordinates

Energy Technology Data Exchange (ETDEWEB)

Banushkina, Polina V.; Krivov, Sergei V., E-mail: s.krivov@leeds.ac.uk [Astbury Center for Structural Molecular Biology, Faculty of Biological Sciences, University of Leeds, Leeds LS2 9JT (United Kingdom)

2015-11-14

State of the art realistic simulations of complex atomic processes commonly produce trajectories of large size, making the development of automated analysis tools very important. A popular approach aimed at extracting dynamical information consists of projecting these trajectories into optimally selected reaction coordinates or collective variables. For equilibrium dynamics between any two boundary states, the committor function also known as the folding probability in protein folding studies is often considered as the optimal coordinate. To determine it, one selects a functional form with many parameters and trains it on the trajectories using various criteria. A major problem with such an approach is that a poor initial choice of the functional form may lead to sub-optimal results. Here, we describe an approach which allows one to optimize the reaction coordinate without selecting its functional form and thus avoiding this source of error.

Following an Optimal Batch Bioreactor Operations Model

DEFF Research Database (Denmark)

Ibarra-Junquera, V.; Jørgensen, Sten Bay; Virgen-Ortíz, J.J.

2012-01-01

The problem of following an optimal batch operation model for a bioreactor in the presence of uncertainties is studied. The optimal batch bioreactor operation model (OBBOM) refers to the bioreactor trajectory for nominal cultivation to be optimal. A multiple-variable dynamic optimization of fed...... as the master system which includes the optimal cultivation trajectory for the feed flow rate and the substrate concentration. The “real” bioreactor, the one with unknown dynamics and perturbations, is considered as the slave system. Finally, the controller is designed such that the real bioreactor...

An optimal control strategy for collision avoidance of mobile robots in non-stationary environments

Science.gov (United States)

Kyriakopoulos, K. J.; Saridis, G. N.

1991-01-01

An optimal control formulation of the problem of collision avoidance of mobile robots in environments containing moving obstacles is presented. Collision avoidance is guaranteed if the minimum distance between the robot and the objects is nonzero. A nominal trajectory is assumed to be known from off-line planning. The main idea is to change the velocity along the nominal trajectory so that collisions are avoided. Furthermore, time consistency with the nominal plan is desirable. A numerical solution of the optimization problem is obtained. Simulation results verify the value of the proposed strategy.

Improved Sensitivity Relations in State Constrained Optimal Control

International Nuclear Information System (INIS)

Bettiol, Piernicola; Frankowska, Hélène; Vinter, Richard B.

2015-01-01

Sensitivity relations in optimal control provide an interpretation of the costate trajectory and the Hamiltonian, evaluated along an optimal trajectory, in terms of gradients of the value function. While sensitivity relations are a straightforward consequence of standard transversality conditions for state constraint free optimal control problems formulated in terms of control-dependent differential equations with smooth data, their verification for problems with either pathwise state constraints, nonsmooth data, or for problems where the dynamic constraint takes the form of a differential inclusion, requires careful analysis. In this paper we establish validity of both ‘full’ and ‘partial’ sensitivity relations for an adjoint state of the maximum principle, for optimal control problems with pathwise state constraints, where the underlying control system is described by a differential inclusion. The partial sensitivity relation interprets the costate in terms of partial Clarke subgradients of the value function with respect to the state variable, while the full sensitivity relation interprets the couple, comprising the costate and Hamiltonian, as the Clarke subgradient of the value function with respect to both time and state variables. These relations are distinct because, for nonsmooth data, the partial Clarke subdifferential does not coincide with the projection of the (full) Clarke subdifferential on the relevant coordinate space. We show for the first time (even for problems without state constraints) that a costate trajectory can be chosen to satisfy the partial and full sensitivity relations simultaneously. The partial sensitivity relation in this paper is new for state constraint problems, while the full sensitivity relation improves on earlier results in the literature (for optimal control problems formulated in terms of Lipschitz continuous multifunctions), because a less restrictive inward pointing hypothesis is invoked in the proof, and because

An Optimization Method of Time Window Based on Travel Time and Reliability

Directory of Open Access Journals (Sweden)

Fengjie Fu

2015-01-01

Full Text Available The dynamic change of urban road travel time was analyzed using video image detector data, and it showed cyclic variation, so the signal cycle length at the upstream intersection was conducted as the basic unit of time window; there was some evidence of bimodality in the actual travel time distributions; therefore, the fitting parameters of the travel time bimodal distribution were estimated using the EM algorithm. Then the weighted average value of the two means was indicated as the travel time estimation value, and the Modified Buffer Time Index (MBIT was expressed as travel time variability; based on the characteristics of travel time change and MBIT along with different time windows, the time window was optimized dynamically for minimum MBIT, requiring that the travel time change be lower than the threshold value and traffic incidents can be detected real time; finally, travel times on Shandong Road in Qingdao were estimated every 10 s, 120 s, optimal time windows, and 480 s and the comparisons demonstrated that travel time estimation in optimal time windows can exactly and steadily reflect the real-time traffic. It verifies the effectiveness of the optimization method.

On-Line Trajectory Retargeting for Alternate Landing Sites, Phase I

Data.gov (United States)

National Aeronautics and Space Administration — Barron Associates, Inc. proposes to develop a novel on-line trajectory optimization approach for Reusable Launch Vehicles (RLVs) under failure scenarios, targeting...

A Genetic Algorithm for Feeding Trajectory Optimisation of Fed-batch Fermentation Processes

Directory of Open Access Journals (Sweden)

Stoyan Tzonkov

2009-03-01

Full Text Available In this work a genetic algorithm is proposed with the purpose of the feeding trajectory optimization during a fed-batch fermentation of E. coli. The feed rate profiles are evaluated based on a number of objective functions. Optimization results obtained for different feeding trajectories demonstrate that the genetic algorithm works well and shows good computational performance. Developed optimal feed profiles meet the defined criteria. The ration of the substrate concentration and the difference between actual cell concentration and theoretical maximum cell concentration is defined as the most appropriate objective function. In this case the final cell concentration of 43 g·l-1 and final product concentration of 125 g·l-1 are achieved and there is not significant excess of substrate.

Novel Verification Method for Timing Optimization Based on DPSO

Directory of Open Access Journals (Sweden)

Chuandong Chen

2018-01-01

Full Text Available Timing optimization for logic circuits is one of the key steps in logic synthesis. Extant research data are mainly proposed based on various intelligence algorithms. Hence, they are neither comparable with timing optimization data collected by the mainstream electronic design automation (EDA tool nor able to verify the superiority of intelligence algorithms to the EDA tool in terms of optimization ability. To address these shortcomings, a novel verification method is proposed in this study. First, a discrete particle swarm optimization (DPSO algorithm was applied to optimize the timing of the mixed polarity Reed-Muller (MPRM logic circuit. Second, the Design Compiler (DC algorithm was used to optimize the timing of the same MPRM logic circuit through special settings and constraints. Finally, the timing optimization results of the two algorithms were compared based on MCNC benchmark circuits. The timing optimization results obtained using DPSO are compared with those obtained from DC, and DPSO demonstrates an average reduction of 9.7% in the timing delays of critical paths for a number of MCNC benchmark circuits. The proposed verification method directly ascertains whether the intelligence algorithm has a better timing optimization ability than DC.

Optimal scheduling using priced timed automata

DEFF Research Database (Denmark)

Behrmann, Gerd; Larsen, Kim Guldstrand; Rasmussen, Jacob Illum

2005-01-01

This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European...... projects VHS [20] and AMETIST [16] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [18, 5] specialized for cost-optimal reachability for the extended model of so-called priced timed automata....

Trajectory Optimization and Conceptual Study of Small Test Vehicles for a Hypersonic Engine Using a High-Altitude Balloon

Science.gov (United States)

Tsuchiya, Takeshi; Takenaka, Youichi; Taguchi, Hideyuki; Sawai, Shujiro

The Japan Aerospace Exploration Agency, JAXA, announced a long-term vision recently. In the vision, JAXA aims to develop hypersonic aircrafts. A pre-cooled turbojet engine has great potential as one of newly developed hypersonic airbreathing engines. We also expect the engine to be installed in space transportation vehicles in the future. For combustion test in the real flight conditions of the engines, JAXA has an experimental plan where a small test vehicle is released from a high-altitude balloon. This paper applies numerical analysis and optimization techniques to conceptual designs of the test vehicle in order to obtain the best configuration and trajectory for the flight test. The results show helpful knowledge for designing prototype vehicles.

Time Optimal Reachability Analysis Using Swarm Verification

DEFF Research Database (Denmark)

Zhang, Zhengkui; Nielsen, Brian; Larsen, Kim Guldstrand

2016-01-01

Time optimal reachability analysis employs model-checking to compute goal states that can be reached from an initial state with a minimal accumulated time duration. The model-checker may produce a corresponding diagnostic trace which can be interpreted as a feasible schedule for many scheduling...... and planning problems, response time optimization etc. We propose swarm verification to accelerate time optimal reachability using the real-time model-checker Uppaal. In swarm verification, a large number of model checker instances execute in parallel on a computer cluster using different, typically randomized...... search strategies. We develop four swarm algorithms and evaluate them with four models in terms scalability, and time- and memory consumption. Three of these cooperate by exchanging costs of intermediate solutions to prune the search using a branch-and-bound approach. Our results show that swarm...

Real time production optimization

Energy Technology Data Exchange (ETDEWEB)

Saputelli, Luigi; Otavio, Joao; Araujo, Turiassu; Escorcia, Alvaro [Halliburton, Houston, TX (United States). Landmark Division

2004-07-01

Production optimization encompasses various activities of measuring, analyzing, modeling, prioritizing and implementing actions to enhance productivity of a field. We present a state-of-the-art framework for optimizing production on a continuous basis as new sensor data is acquired in real time. Permanently acquired data is modeled and analyzed in order to create predictive models. A model based control strategy is used to regulate well and field instrumentation. The optimum field operating point, which changes with time, satisfies the maximum economic return. This work is a starting point for further development in automatic, intelligent reservoir technologies which get the most out of the abilities of permanent, instrumented wells and remotely activated downhole completions. The strategy, tested with history-matched data from a compartmentalised giant field, proved to reduce operating costs while increasing oil recovery by 27% in this field. (author)

Analysis of Load-Carrying Capacity for Redundant Free-Floating Space Manipulators in Trajectory Tracking Task

Directory of Open Access Journals (Sweden)

Qingxuan Jia

2014-01-01

Full Text Available The aim of this paper is to analyze load-carrying capacity of redundant free-floating space manipulators (FFSM in trajectory tracking task. Combined with the analysis of influential factors in load-carrying process, evaluation of maximum load-carrying capacity (MLCC is described as multiconstrained nonlinear programming problem. An efficient algorithm based on repeated line search within discontinuous feasible region is presented to determine MLCC for a given trajectory of the end-effector and corresponding joint path. Then, considering the influence of MLCC caused by different initial configurations for the starting point of given trajectory, a kind of maximum payload initial configuration planning method is proposed by using PSO algorithm. Simulations are performed for a particular trajectory tracking task of the 7-DOF space manipulator, of which MLCC is evaluated quantitatively. By in-depth research of the simulation results, significant gap between the values of MLCC when using different initial configurations is analyzed, and the discontinuity of allowable load-carrying capacity is illustrated. The proposed analytical method can be taken as theoretical foundation of feasibility analysis, trajectory optimization, and optimal control of trajectory tracking task in on-orbit load-carrying operations.

A population-feedback control based algorithm for well trajectory optimization using proxy model

Directory of Open Access Journals (Sweden)

Javad Kasravi

2017-04-01

Full Text Available Wellbore instability is one of the concerns in the field of drilling engineering. This phenomenon is affected by several factors such as azimuth, inclination angle, in-situ stress, mud weight, and rock strength parameters. Among these factors, azimuth, inclination angle, and mud weight are controllable. The objective of this paper is to introduce a new procedure based on elastoplastic theory in wellbore stability solution to determine the optimum well trajectory and global minimum mud pressure required (GMMPR. Genetic algorithm (GA was applied as a main optimization engine that employs proportional feedback controller to obtain the minimum mud pressure required (MMPR. The feedback function repeatedly calculated and updated the error between the simulated and set point of normalized yielded zone area (NYZA. To reduce computation expenses, an artificial neural network (ANN was used as a proxy (surrogate model to approximate the behavior of the actual wellbore model. The methodology was applied to a directional well in southwestern Iranian oilfield. The results demonstrated that the error between the predicted GMMPR and practical safe mud pressure was 4% for elastoplastic method, and 22% for conventional elastic solution.

Pointwise second-order necessary optimality conditions and second-order sensitivity relations in optimal control

Science.gov (United States)

Frankowska, Hélène; Hoehener, Daniel

2017-06-01

This paper is devoted to pointwise second-order necessary optimality conditions for the Mayer problem arising in optimal control theory. We first show that with every optimal trajectory it is possible to associate a solution p (ṡ) of the adjoint system (as in the Pontryagin maximum principle) and a matrix solution W (ṡ) of an adjoint matrix differential equation that satisfy a second-order transversality condition and a second-order maximality condition. These conditions seem to be a natural second-order extension of the maximum principle. We then prove a Jacobson like necessary optimality condition for general control systems and measurable optimal controls that may be only ;partially singular; and may take values on the boundary of control constraints. Finally we investigate the second-order sensitivity relations along optimal trajectories involving both p (ṡ) and W (ṡ).

Neural network-based optimal adaptive output feedback control of a helicopter UAV.

Science.gov (United States)

Nodland, David; Zargarzadeh, Hassan; Jagannathan, Sarangapani

2013-07-01

Helicopter unmanned aerial vehicles (UAVs) are widely used for both military and civilian operations. Because the helicopter UAVs are underactuated nonlinear mechanical systems, high-performance controller design for them presents a challenge. This paper introduces an optimal controller design via an output feedback for trajectory tracking of a helicopter UAV, using a neural network (NN). The output-feedback control system utilizes the backstepping methodology, employing kinematic and dynamic controllers and an NN observer. The online approximator-based dynamic controller learns the infinite-horizon Hamilton-Jacobi-Bellman equation in continuous time and calculates the corresponding optimal control input by minimizing a cost function, forward-in-time, without using the value and policy iterations. Optimal tracking is accomplished by using a single NN utilized for the cost function approximation. The overall closed-loop system stability is demonstrated using Lyapunov analysis. Finally, simulation results are provided to demonstrate the effectiveness of the proposed control design for trajectory tracking.

A parallel algorithm for 3D particle tracking and Lagrangian trajectory reconstruction

International Nuclear Information System (INIS)

Barker, Douglas; Zhang, Yuanhui; Lifflander, Jonathan; Arya, Anshu

2012-01-01

Particle-tracking methods are widely used in fluid mechanics and multi-target tracking research because of their unique ability to reconstruct long trajectories with high spatial and temporal resolution. Researchers have recently demonstrated 3D tracking of several objects in real time, but as the number of objects is increased, real-time tracking becomes impossible due to data transfer and processing bottlenecks. This problem may be solved by using parallel processing. In this paper, a parallel-processing framework has been developed based on frame decomposition and is programmed using the asynchronous object-oriented Charm++ paradigm. This framework can be a key step in achieving a scalable Lagrangian measurement system for particle-tracking velocimetry and may lead to real-time measurement capabilities. The parallel tracking algorithm was evaluated with three data sets including the particle image velocimetry standard 3D images data set #352, a uniform data set for optimal parallel performance and a computational-fluid-dynamics-generated non-uniform data set to test trajectory reconstruction accuracy, consistency with the sequential version and scalability to more than 500 processors. The algorithm showed strong scaling up to 512 processors and no inherent limits of scalability were seen. Ultimately, up to a 200-fold speedup is observed compared to the serial algorithm when 256 processors were used. The parallel algorithm is adaptable and could be easily modified to use any sequential tracking algorithm, which inputs frames of 3D particle location data and outputs particle trajectories

Conjugate gradient optimization programs for shuttle reentry

Science.gov (United States)

Powers, W. F.; Jacobson, R. A.; Leonard, D. A.

1972-01-01

Two computer programs for shuttle reentry trajectory optimization are listed and described. Both programs use the conjugate gradient method as the optimization procedure. The Phase 1 Program is developed in cartesian coordinates for a rotating spherical earth, and crossrange, downrange, maximum deceleration, total heating, and terminal speed, altitude, and flight path angle are included in the performance index. The programs make extensive use of subroutines so that they may be easily adapted to other atmospheric trajectory optimization problems.

Embedding Human Expert Cognition Into Autonomous UAS Trajectory Planning.

Science.gov (United States)

Narayan, Pritesh; Meyer, Patrick; Campbell, Duncan

2013-04-01

This paper presents a new approach for the inclusion of human expert cognition into autonomous trajectory planning for unmanned aerial systems (UASs) operating in low-altitude environments. During typical UAS operations, multiple objectives may exist; therefore, the use of multicriteria decision aid techniques can potentially allow for convergence to trajectory solutions which better reflect overall mission requirements. In that context, additive multiattribute value theory has been applied to optimize trajectories with respect to multiple objectives. A graphical user interface was developed to allow for knowledge capture from a human decision maker (HDM) through simulated decision scenarios. The expert decision data gathered are converted into value functions and corresponding criteria weightings using utility additive theory. The inclusion of preferences elicited from HDM data within an automated decision system allows for the generation of trajectories which more closely represent the candidate HDM decision preferences. This approach has been demonstrated in this paper through simulation using a fixed-wing UAS operating in low-altitude environments.

The power of a single trajectory

Science.gov (United States)

Schnellbächer, Nikolas D.; Schwarz, Ulrich S.

2018-03-01

Random walks are often evaluated in terms of their mean squared displacements, either for a large number of trajectories or for one very long trajectory. An alternative evaluation is based on the power spectral density, but here it is less clear which information can be extracted from a single trajectory. For continuous-time Brownian motion, Krapf et al now have mathematically proven that the one property that can be reliably extracted from a single trajectory is the frequency dependence of the ensemble-averaged power spectral density (Krapf et al 2018 New J. Phys. 20 023029). Their mathematical analysis also identifies the appropriate frequency window for this procedure and shows that the diffusion coefficient can be extracted by averaging over a small number of trajectories. The authors have verified their analytical results both by computer simulations and experiments.

Optimal and Autonomous Control Using Reinforcement Learning: A Survey.

Science.gov (United States)

Kiumarsi, Bahare; Vamvoudakis, Kyriakos G; Modares, Hamidreza; Lewis, Frank L

2018-06-01

This paper reviews the current state of the art on reinforcement learning (RL)-based feedback control solutions to optimal regulation and tracking of single and multiagent systems. Existing RL solutions to both optimal and control problems, as well as graphical games, will be reviewed. RL methods learn the solution to optimal control and game problems online and using measured data along the system trajectories. We discuss Q-learning and the integral RL algorithm as core algorithms for discrete-time (DT) and continuous-time (CT) systems, respectively. Moreover, we discuss a new direction of off-policy RL for both CT and DT systems. Finally, we review several applications.

Kick-Off Point (KOP and End of Buildup (EOB Data Analysis in Trajectory Design

Directory of Open Access Journals (Sweden)

Novrianti Novrianti

2017-06-01

Full Text Available Well X is a development well which is directionally drilled. Directional drilling is choosen because the coordinate target of Well X is above the buffer zone. The directional track plan needs accurate survey calculation in order to make the righ track for directional drilling. There are many survey calculation in directional drilling such as tangential, underbalance, average angle, radius of curvature, and mercury method. Minimum curvature method is used in this directional track plan calculation. This method is used because it gives less error than other method.  Kick-Off Point (KOP and End of Buildup (EOB analysis is done at 200 ft, 400 ft, and 600 ft depth to determine the trajectory design and optimal inclination. The hole problem is also determined in this trajectory track design. Optimal trajectory design determined at 200 ft depth because the inclination below 35º and also already reach the target quite well at 1632.28 ft TVD and 408.16 AHD. The optimal inclination at 200 ft KOP depth because the maximum inclination is 18.87º which is below 35º. Hole problem will occur if the trajectory designed at 600 ft. The problems are stuck pipe and the casing or tubing will not able to bend.

Quantum dynamics modeled by interacting trajectories

Science.gov (United States)

Cruz-Rodríguez, L.; Uranga-Piña, L.; Martínez-Mesa, A.; Meier, C.

2018-03-01

We present quantum dynamical simulations based on the propagation of interacting trajectories where the effect of the quantum potential is mimicked by effective pseudo-particle interactions. The method is applied to several quantum systems, both for bound and scattering problems. For the bound systems, the quantum ground state density and zero point energy are shown to be perfectly obtained by the interacting trajectories. In the case of time-dependent quantum scattering, the Eckart barrier and uphill ramp are considered, with transmission coefficients in very good agreement with standard quantum calculations. Finally, we show that via wave function synthesis along the trajectories, correlation functions and energy spectra can be obtained based on the dynamics of interacting trajectories.

Locus of the apices of projectile trajectories under constant drag

Science.gov (United States)

Hernández-Saldaña, H.

2017-11-01

Using the hodograph method, we present an analytical solution for projectile coplanar motion under constant drag, parametrised by the velocity angle. We find the locus formed by the apices of the projectile trajectories, and discuss its implementation for the motion of a particle on an inclined plane in presence of Coulomb friction. The range and time of flight are obtained numerically, and we find that the optimal launching angle is smaller than in the drag-free case. This is a good example of a problem with constant dissipation of energy that includes curvature; it is appropriate for intermediate courses of mechanics.

Distributed radar network for real-time tracking of bullet trajectory

Science.gov (United States)

Zhang, Yimin; Li, Xin; Jin, Yuanwei; Amin, Moeness G.; Eydgahi, Ali

2009-05-01

Gunshot detection, sniper localization, and bullet trajectory prediction are of significant importance in military and homeland security applications. While the majority of existing work is based on acoustic and electro-optical sensors, this paper develops a framework of networked radar systems that uses distributed radar sensor networks to achieve the aforementioned objectives. The use of radio frequency radar systems allows the achievement of subtime- of-flight tracking response, enabling to response before the bullet reaches its target and, as such, effectively leading to the reduction of injuries and casualties in military and homeland security operations. The focus of this paper is to examine the MIMO radar concept with concurrent transmission of low-correlation waveforms from multiple radar sets to ensure wide surveillance coverage and maintain a high waveform repetition frequency for long coherent time interval required to achieve return signal concentration.

New numerical methods for open-loop and feedback solutions to dynamic optimization problems

Science.gov (United States)

Ghosh, Pradipto

The topic of the first part of this research is trajectory optimization of dynamical systems via computational swarm intelligence. Particle swarm optimization is a nature-inspired heuristic search method that relies on a group of potential solutions to explore the fitness landscape. Conceptually, each particle in the swarm uses its own memory as well as the knowledge accumulated by the entire swarm to iteratively converge on an optimal or near-optimal solution. It is relatively straightforward to implement and unlike gradient-based solvers, does not require an initial guess or continuity in the problem definition. Although particle swarm optimization has been successfully employed in solving static optimization problems, its application in dynamic optimization, as posed in optimal control theory, is still relatively new. In the first half of this thesis particle swarm optimization is used to generate near-optimal solutions to several nontrivial trajectory optimization problems including thrust programming for minimum fuel, multi-burn spacecraft orbit transfer, and computing minimum-time rest-to-rest trajectories for a robotic manipulator. A distinct feature of the particle swarm optimization implementation in this work is the runtime selection of the optimal solution structure. Optimal trajectories are generated by solving instances of constrained nonlinear mixed-integer programming problems with the swarming technique. For each solved optimal programming problem, the particle swarm optimization result is compared with a nearly exact solution found via a direct method using nonlinear programming. Numerical experiments indicate that swarm search can locate solutions to very great accuracy. The second half of this research develops a new extremal-field approach for synthesizing nearly optimal feedback controllers for optimal control and two-player pursuit-evasion games described by general nonlinear differential equations. A notable revelation from this development

Parameterized data-driven fuzzy model based optimal control of a semi-batch reactor.

Science.gov (United States)

Kamesh, Reddi; Rani, K Yamuna

2016-09-01

A parameterized data-driven fuzzy (PDDF) model structure is proposed for semi-batch processes, and its application for optimal control is illustrated. The orthonormally parameterized input trajectories, initial states and process parameters are the inputs to the model, which predicts the output trajectories in terms of Fourier coefficients. Fuzzy rules are formulated based on the signs of a linear data-driven model, while the defuzzification step incorporates a linear regression model to shift the domain from input to output domain. The fuzzy model is employed to formulate an optimal control problem for single rate as well as multi-rate systems. Simulation study on a multivariable semi-batch reactor system reveals that the proposed PDDF modeling approach is capable of capturing the nonlinear and time-varying behavior inherent in the semi-batch system fairly accurately, and the results of operating trajectory optimization using the proposed model are found to be comparable to the results obtained using the exact first principles model, and are also found to be comparable to or better than parameterized data-driven artificial neural network model based optimization results. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Time-optimal control of infinite order distributed parabolic systems involving time lags

Directory of Open Access Journals (Sweden)

G.M. Bahaa

2014-06-01

Full Text Available A time-optimal control problem for linear infinite order distributed parabolic systems involving constant time lags appear both in the state equation and in the boundary condition is presented. Some particular properties of the optimal control are discussed.

Primer Vector Optimization: Survey of Theory, new Analysis and Applications

Science.gov (United States)

Guzman

This paper presents a preliminary study in developing a set of optimization tools for orbit rendezvous, transfer and station keeping. This work is part of a large scale effort undergoing at NASA Goddard Space Flight Center and a.i. solutions, Inc. to build generic methods, which will enable missions with tight fuel budgets. Since no single optimization technique can solve efficiently all existing problems, a library of tools where the user could pick the method most suited for the particular mission is envisioned. The first trajectory optimization technique explored is Lawden's primer vector theory [Ref. 1]. Primer vector theory can be considered as a byproduct of applying Calculus of Variations (COV) techniques to the problem of minimizing the fuel usage of impulsive trajectories. For an n-impulse trajectory, it involves the solution of n-1 two-point boundary value problems. In this paper, we look at some of the different formulations of the primer vector (dependent on the frame employed and on the force model). Also, the applicability of primer vector theory is examined in effort to understand when and why the theory can fail. Specifically, since COV is based on "small variations", singularities in the linearized (variational) equations of motion along the arcs must be taken into account. These singularities are a recurring problem in analyzes that employ "small variations" [Refs. 2, 3]. For example, singularities in the (2-body problem) variational equations along elliptic arcs occur when [Ref. 4], 1) the difference between the initial and final times is a multiple of the reference orbit period, 2) the difference between the initial and final true anomalies are given by k, for k= 0, 1, 2, 3,..., note that this cover the 3) the time of flight is a minimum for the given difference in true anomaly. For the N-body problem, the situation is more complex and is still under investigation. Several examples, such as the initialization of an orbit (ascent trajectory) and

A Formally Verified Conflict Detection Algorithm for Polynomial Trajectories

Science.gov (United States)

Narkawicz, Anthony; Munoz, Cesar

2015-01-01

In air traffic management, conflict detection algorithms are used to determine whether or not aircraft are predicted to lose horizontal and vertical separation minima within a time interval assuming a trajectory model. In the case of linear trajectories, conflict detection algorithms have been proposed that are both sound, i.e., they detect all conflicts, and complete, i.e., they do not present false alarms. In general, for arbitrary nonlinear trajectory models, it is possible to define detection algorithms that are either sound or complete, but not both. This paper considers the case of nonlinear aircraft trajectory models based on polynomial functions. In particular, it proposes a conflict detection algorithm that precisely determines whether, given a lookahead time, two aircraft flying polynomial trajectories are in conflict. That is, it has been formally verified that, assuming that the aircraft trajectories are modeled as polynomial functions, the proposed algorithm is both sound and complete.

Post-flight trajectory reconstruction of suborbital free-flyers using GPS raw data

Science.gov (United States)

Ivchenko, N.; Yuan, Y.; Linden, E.

2017-08-01

This paper describes the reconstruction of postflight trajectories of suborbital free flying units by using logged GPS raw data. We took the reconstruction as a global least squares optimization problem, using both the pseudo-range and Doppler observables, and solved it by using the trust-region-reflective algorithm, which enabled navigational solutions of high accuracy. The code tracking was implemented with a large number of correlators and least squares curve fitting, in order to improve the precision of the code start times, while a more conventional phased lock loop was used for Doppler tracking. We proposed a weighting scheme to account for fast signal strength variation due to free-flier fast rotation, and a penalty for jerk to achieve a smooth solution. We applied these methods to flight data of two suborbital free flying units launched on REXUS 12 sounding rocket, reconstructing the trajectory, receiver clock error and wind up rates. The trajectory exhibits a parabola with the apogee around 80 km, and the velocity profile shows the details of payloadwobbling. The wind up rates obtained match the measurements from onboard angular rate sensors.

Post-flight trajectory reconstruction of suborbital free-flyers using GPS raw data

Directory of Open Access Journals (Sweden)

Ivchenko N.

2017-08-01

Full Text Available This paper describes the reconstruction of postflight trajectories of suborbital free flying units by using logged GPS raw data. We took the reconstruction as a global least squares optimization problem, using both the pseudo-range and Doppler observables, and solved it by using the trust-region-reflective algorithm, which enabled navigational solutions of high accuracy. The code tracking was implemented with a large number of correlators and least squares curve fitting, in order to improve the precision of the code start times, while a more conventional phased lock loop was used for Doppler tracking. We proposed a weighting scheme to account for fast signal strength variation due to free-flier fast rotation, and a penalty for jerk to achieve a smooth solution. We applied these methods to flight data of two suborbital free flying units launched on REXUS 12 sounding rocket, reconstructing the trajectory, receiver clock error and wind up rates. The trajectory exhibits a parabola with the apogee around 80 km, and the velocity profile shows the details of payloadwobbling. The wind up rates obtained match the measurements from onboard angular rate sensors.

Underwater navigation using diffusion-based trajectory observers

DEFF Research Database (Denmark)

Jouffroy, Jerome; Opderbecke, Jan

2007-01-01

This paper addresses the issue of estimating underwater vehicle trajectories using gyro-Doppler (body-fixed velocities) and acoustic positioning signals (earth-fixed positions). The approach consists of diffusion-based observers processing a whole trajectory segment at a time, allowing the consid...

Optimal time points sampling in pathway modelling.

Science.gov (United States)

Hu, Shiyan

2004-01-01

Modelling cellular dynamics based on experimental data is at the heart of system biology. Considerable progress has been made to dynamic pathway modelling as well as the related parameter estimation. However, few of them gives consideration for the issue of optimal sampling time selection for parameter estimation. Time course experiments in molecular biology rarely produce large and accurate data sets and the experiments involved are usually time consuming and expensive. Therefore, to approximate parameters for models with only few available sampling data is of significant practical value. For signal transduction, the sampling intervals are usually not evenly distributed and are based on heuristics. In the paper, we investigate an approach to guide the process of selecting time points in an optimal way to minimize the variance of parameter estimates. In the method, we first formulate the problem to a nonlinear constrained optimization problem by maximum likelihood estimation. We then modify and apply a quantum-inspired evolutionary algorithm, which combines the advantages of both quantum computing and evolutionary computing, to solve the optimization problem. The new algorithm does not suffer from the morass of selecting good initial values and being stuck into local optimum as usually accompanied with the conventional numerical optimization techniques. The simulation results indicate the soundness of the new method.

Trajectories of delinquency and parenting styles.

Science.gov (United States)

Hoeve, Machteld; Blokland, Arjan; Dubas, Judith Semon; Loeber, Rolf; Gerris, Jan R M; van der Laan, Peter H

2008-02-01

We investigated trajectories of adolescent delinquent development using data from the Pittsburgh Youth Study and examined the extent to which these different trajectories are differentially predicted by childhood parenting styles. Based on self-reported and official delinquency seriousness, covering ages 10-19, we identified five distinct delinquency trajectories differing in both level and change in seriousness over time: a nondelinquent, minor persisting, moderate desisting, serious persisting, and serious desisting trajectory. More serious delinquents tended to more frequently engage in delinquency, and to report a higher proportion of theft. Proportionally, serious persistent delinquents were the most violent of all trajectory groups. Using cluster analysis we identified three parenting styles: authoritative, authoritarian (moderately supportive), and neglectful (punishing). Controlling for demographic characteristics and childhood delinquency, neglectful parenting was more frequent in moderate desisters, serious persisters, and serious desisters, suggesting that parenting styles differentiate non- or minor delinquents from more serious delinquents.

Path-based Queries on Trajectory Data

DEFF Research Database (Denmark)

Krogh, Benjamin Bjerre; Pelekis, Nikos; Theodoridis, Yannis

2014-01-01

In traffic research, management, and planning a number of path-based analyses are heavily used, e.g., for computing turn-times, evaluating green waves, or studying traffic flow. These analyses require retrieving the trajectories that follow the full path being analyzed. Existing path queries cannot...... sufficiently support such path-based analyses because they retrieve all trajectories that touch any edge in the path. In this paper, we define and formalize the strict path query. This is a novel query type tailored to support path-based analysis, where trajectories must follow all edges in the path...... a specific path by only retrieving data from the first and last edge in the path. To correctly answer strict path queries existing network-constrained trajectory indexes must retrieve data from all edges in the path. An extensive performance study of NETTRA using a very large real-world trajectory data set...

Towards Real-Time Maneuver Detection: Automatic State and Dynamics Estimation with the Adaptive Optimal Control Based Estimator

Science.gov (United States)

Lubey, D.; Scheeres, D.

Tracking objects in Earth orbit is fraught with complications. This is due to the large population of orbiting spacecraft and debris that continues to grow, passive (i.e. no direct communication) and data-sparse observations, and the presence of maneuvers and dynamics mismodeling. Accurate orbit determination in this environment requires an algorithm to capture both a system's state and its state dynamics in order to account for mismodelings. Previous studies by the authors yielded an algorithm called the Optimal Control Based Estimator (OCBE) - an algorithm that simultaneously estimates a system's state and optimal control policies that represent dynamic mismodeling in the system for an arbitrary orbit-observer setup. The stochastic properties of these estimated controls are then used to determine the presence of mismodelings (maneuver detection), as well as characterize and reconstruct the mismodelings. The purpose of this paper is to develop the OCBE into an accurate real-time orbit tracking and maneuver detection algorithm by automating the algorithm and removing its linear assumptions. This results in a nonlinear adaptive estimator. In its original form the OCBE had a parameter called the assumed dynamic uncertainty, which is selected by the user with each new measurement to reflect the level of dynamic mismodeling in the system. This human-in-the-loop approach precludes real-time application to orbit tracking problems due to their complexity. This paper focuses on the Adaptive OCBE, a version of the estimator where the assumed dynamic uncertainty is chosen automatically with each new measurement using maneuver detection results to ensure that state uncertainties are properly adjusted to account for all dynamic mismodelings. The paper also focuses on a nonlinear implementation of the estimator. Originally, the OCBE was derived from a nonlinear cost function then linearized about a nominal trajectory, which is assumed to be ballistic (i.e. the nominal optimal

Infinite-horizon optimal control problems in economics

International Nuclear Information System (INIS)

Aseev, Sergei M; Besov, Konstantin O; Kryazhimskii, Arkadii V

2012-01-01

This paper extends optimal control theory to a class of infinite-horizon problems that arise in studying models of optimal dynamic allocation of economic resources. In a typical problem of this sort the initial state is fixed, no constraints are imposed on the behaviour of the admissible trajectories at large times, and the objective functional is given by a discounted improper integral. We develop the method of finite-horizon approximations in a broad context and use it to derive complete versions of the Pontryagin maximum principle for such problems. We provide sufficient conditions for the normality of infinite-horizon optimal control problems and for the validity of the 'standard' limit transversality conditions with time going to infinity. As a meaningful example, we consider a new two-sector model of optimal economic growth subject to a random jump in prices. Bibliography: 53 titles.

Long Range Aircraft Trajectory Prediction

OpenAIRE

Magister, Tone

2009-01-01

The subject of the paper is the improvement of the aircraft future trajectory prediction accuracy for long-range airborne separation assurance. The strategic planning of safe aircraft flights and effective conflict avoidance tactics demand timely and accurate conflict detection based upon future four–dimensional airborne traffic situation prediction which is as accurate as each aircraft flight trajectory prediction. The improved kinematics model of aircraft relative flight considering flight ...

WE-AB-209-10: Optimizing the Delivery of Sequential Fluence Maps for Efficient VMAT Delivery

Energy Technology Data Exchange (ETDEWEB)

Craft, D [Massachusetts General Hospital, Cambridge, MA (United States); Balvert, M [Tilburg University, Tilburg (Netherlands)

2016-06-15

Purpose: To develop an optimization model and solution approach for computing MLC leaf trajectories and dose rates for high quality matching of a set of optimized fluence maps to be delivered sequentially around a patient in a VMAT treatment. Methods: We formulate the fluence map matching problem as a nonlinear optimization problem where time is discretized but dose rates and leaf positions are continuous variables. For a given allotted time, which is allocated across the fluence maps based on the complexity of each fluence map, the optimization problem searches for the best leaf trajectories and dose rates such that the original fluence maps are closely recreated. Constraints include maximum leaf speed, maximum dose rate, and leaf collision avoidance, as well as the constraint that the ending leaf positions for one map are the starting leaf positions for the next map. The resulting model is non-convex but smooth, and therefore we solve it by local searches from a variety of starting positions. We improve solution time by a custom decomposition approach which allows us to decouple the rows of the fluence maps and solve each leaf pair individually. This decomposition also makes the problem easily parallelized. Results: We demonstrate method on a prostate case and a head-and-neck case and show that one can recreate fluence maps to high degree of fidelity in modest total delivery time (minutes). Conclusion: We present a VMAT sequencing method that reproduces optimal fluence maps by searching over a vast number of possible leaf trajectories. By varying the total allotted time given, this approach is the first of its kind to allow users to produce VMAT solutions that span the range of wide-field coarse VMAT deliveries to narrow-field high-MU sliding window-like approaches.

Trajectory Planning of 7-DOF Space Manipulator for Minimizing Base Disturbance

Directory of Open Access Journals (Sweden)

Qiang Zhang

2016-03-01

Full Text Available In the free-floating mode, there is intense dynamic coupling existing between the space manipulator and the base, and the base attitude may change while performing a motion with its manipulator. Therefore, it is necessary to reduce the interference that resulted from the manipulator movement. For planning trajectories of the space manipulator with 7 degrees of freedom (7-DOF, simulated annealing particle swarm optimization (SAPSO algorithm is presented in the paper. Firstly, kinematics equations are setup. Secondly, the joint functions are parameterized by sinusoidal functions, and the objective function is defined according to the motion constraints of manipulator and accuracy requirements of the base attitude. Finally, SAPSO algorithm is used to search the optimal trajectory. The simulation results verify the proposed method.

Developmental trajectories of anxious and depressive problems during the transition from childhood to adolescence: personality × parenting interactions.

Science.gov (United States)

Prinzie, Peter; van Harten, Leanthe V; Deković, Maja; van den Akker, Alithe L; Shiner, Rebecca L

2014-11-01

This study examined separate developmental trajectories of anxious and depressive symptoms from childhood to adolescence (9-15 years) in a community-based sample (N = 290). At three measurement points, mothers and fathers reported on their children's anxious and depressive symptoms, and at Time 1 they reported on lower order child personality facets and on their parenting. By means of growth mixture modeling, three developmental trajectories were identified for anxious symptoms: steady low (82%), moderate increasing-decreasing (5.9%), and high declining groups (12.1%). For depressive symptoms, two developmental trajectories were found: steady low (94.1%) and moderate increasing groups (5.9%). Higher shyness, irritability, and altruism predicted membership in more problematic anxious and depressive groups. The personality facets energy, optimism, compliance, and anxiety were unique predictors for class membership for anxious symptoms, and the effects of shyness, irritability, and compliance were moderated by overreactive parenting. Shyness and irritability increased the probability of following the moderate increasing-decreasing anxiety trajectory, but only in the context of high or average levels of overreactive parenting. Compliance increased the probability of following the moderate increasing-decreasing and high decreasing trajectories in the context of high overreactive parenting. Our results indicate that childhood personality facets differentiate trajectories of anxious and depressive symptoms in theoretically compelling ways.

Sensitivity of trajectory calculations to the temporal frequency of wind data

Science.gov (United States)

Doty, Kevin G.; Perkey, Donald J.

1993-01-01

A mesoscale primitive equation model is used to create a 36-h simulation of the three-dimensional wind field of an intense maritime extratropical cyclone. The control experiment uses the simulated wind field every 15 min in a trajectory model to calculate back trajectories from various horizontal and vertical positions of interest relative to synoptic features of the storm. The latter trajectories are compared to trajectories that were calculated with the simulated wind data degraded in time to 30 min, 1 h, 3 h, 6h, and 12 h. Various error statistics reveal significant deterioration in trajectory accuracy between trajectories calculated with 1- and 3-h data frequencies. Trajectories calculated with 15-min, 30-min, and 1-h data frequencies yielded similar results, while trajectories calculated with data time frequencies 3 h and greater yielded results with unacceptably large errors.

Trajectories of women's abortion-related care: A conceptual framework.

Science.gov (United States)

Coast, Ernestina; Norris, Alison H; Moore, Ann M; Freeman, Emily

2018-03-01

We present a new conceptual framework for studying trajectories to obtaining abortion-related care. It assembles for the first time all of the known factors influencing a trajectory and encourages readers to consider the ways these macro- and micro-level factors operate in multiple and sometimes conflicting ways. Based on presentation to and feedback from abortion experts (researchers, providers, funders, policymakers and advisors, advocates) (n = 325) between 03/06/2014 and 22/08/2015, and a systematic mapping of peer-reviewed literature (n = 424) published between 01/01/2011 and 30/10/2017, our framework synthesises the factors shaping abortion trajectories, grouped into three domains: abortion-specific experiences, individual contexts, and (inter)national and sub-national contexts. Our framework includes time-dependent processes involved in an individual trajectory, starting with timing of pregnancy awareness. This framework can be used to guide testable hypotheses about enabling and inhibiting influences on care-seeking behaviour and consideration about how abortion trajectories might be influenced by policy or practice. Research based on understanding of trajectories has the potential to improve women's experiences and outcomes of abortion-related care. Copyright © 2018 The Author(s). Published by Elsevier Ltd.. All rights reserved.

Machine learning and evolutionary techniques in interplanetary trajectory design

OpenAIRE

Izzo, Dario; Sprague, Christopher; Tailor, Dharmesh

2018-01-01

After providing a brief historical overview on the synergies between artificial intelligence research, in the areas of evolutionary computations and machine learning, and the optimal design of interplanetary trajectories, we propose and study the use of deep artificial neural networks to represent, on-board, the optimal guidance profile of an interplanetary mission. The results, limited to the chosen test case of an Earth-Mars orbital transfer, extend the findings made previously for landing ...

Optimal, real-time control--colliders

International Nuclear Information System (INIS)

Spencer, J.E.

1991-05-01

With reasonable definitions, optimal control is possible for both classical and quantal systems with new approaches called PISC(Parallel) and NISC(Neural) from analogy with RISC (Reduced Instruction Set Computing). If control equals interaction, observation and comparison to some figure of merit with interaction via external fields, then optimization comes from varying these fields to give design or operating goals. Structural stability can then give us tolerance and design constraints. But simulations use simplified models, are not in real-time and assume fixed or stationary conditions, so optimal control goes far beyond convergence rates of algorithms. It is inseparable from design and this has many implications for colliders. 12 refs., 3 figs

Multi-step optimization strategy for fuel-optimal orbital transfer of low-thrust spacecraft

Science.gov (United States)

Rasotto, M.; Armellin, R.; Di Lizia, P.

2016-03-01

An effective method for the design of fuel-optimal transfers in two- and three-body dynamics is presented. The optimal control problem is formulated using calculus of variation and primer vector theory. This leads to a multi-point boundary value problem (MPBVP), characterized by complex inner constraints and a discontinuous thrust profile. The first issue is addressed by embedding the MPBVP in a parametric optimization problem, thus allowing a simplification of the set of transversality constraints. The second problem is solved by representing the discontinuous control function by a smooth function depending on a continuation parameter. The resulting trajectory optimization method can deal with different intermediate conditions, and no a priori knowledge of the control structure is required. Test cases in both the two- and three-body dynamics show the capability of the method in solving complex trajectory design problems.

GeoTravel: Harvesting Ambient Geographic Footprints from GPS Trajectories

OpenAIRE

Liew, Li Ching; Goh, Ong Sing

2014-01-01

This study is about harvesting point of interest from GPS trajectories. Trajectories are the paths that moving objects move by follow through space in a function of time while GPS trajectories generally are point-sequences with geographic coordinates, time stamp, speed and heading. User can get information from GPS enable device. For example, user can acquire present location, search the information around them and design driving routes to a destination and thus design travel itineraries. By ...

Optimizing departure times in vehicle routes

NARCIS (Netherlands)

Kok, A.L.; Hans, Elias W.; Schutten, Johannes M.J.

2008-01-01

Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice, temporal traffic congestions make that such solutions are not optimal with respect to minimizing the total duty time. Furthermore, VRPTW

Picking Robot Arm Trajectory Planning Method

Directory of Open Access Journals (Sweden)

Zhang Zhiyong

2014-01-01

Full Text Available The picking robot arm is scheduled to complete picking tasks in the working space, to overcome the shaking vibration to improve the picking stability, its movement should follow specific consistence trajectory points. Usually we should give definite multiple feature picking points, map their inverse kinematics to the joint space, establish motion equation for the corresponding point in the joint space, then follow these equations motion for the interpolation on the joint so that we can meet the movement requirements. Trajectory planning is decisive significance for accuracy and stability of controlling robot arm. The key issue that picking arm complete picking task will be come true by trajectory planning, namely, robot arm track the desired trajectory. which based on kinematics and statics picking analysis in a joint space according to the requirements of picking tasks, and obtain the position and orientation for picking robot arm, study and calculate the theory of trajectory parameters timely.

Trajectory Stability in the Traveling Salesman Problem

Directory of Open Access Journals (Sweden)

Sergio Sánchez

2018-01-01

Full Text Available Two generalizations of the traveling salesman problem in which sites change their position in time are presented. The way the rank of different trajectory lengths changes in time is studied using the rank diversity. We analyze the statistical properties of rank distributions and rank dynamics and give evidence that the shortest and longest trajectories are more predictable and robust to change, that is, more stable.

Tracking Lagrangian trajectories in position–velocity space

International Nuclear Information System (INIS)

Xu, Haitao

2008-01-01

Lagrangian particle-tracking algorithms are susceptible to intermittent loss of particle images on the sensors. The measured trajectories are often interrupted into short segments and the long-time Lagrangian statistics are difficult to obtain. We present an algorithm to connect the segments of Lagrangian trajectories from common particle-tracking algorithms. Our algorithm tracks trajectory segments in the six-dimensional position and velocity space. We describe the approach to determine parameters in the algorithm and demonstrate the validity of the algorithm with data from numerical simulations and the improvement of long-time Lagrangian statistics on experimental data. The algorithm has important applications in measurements with high particle seeding density and in obtaining multi-particle Lagrangian statistics

Genetic Algorithm Optimizes Q-LAW Control Parameters

Science.gov (United States)

Lee, Seungwon; von Allmen, Paul; Petropoulos, Anastassios; Terrile, Richard

2008-01-01

A document discusses a multi-objective, genetic algorithm designed to optimize Lyapunov feedback control law (Q-law) parameters in order to efficiently find Pareto-optimal solutions for low-thrust trajectories for electronic propulsion systems. These would be propellant-optimal solutions for a given flight time, or flight time optimal solutions for a given propellant requirement. The approximate solutions are used as good initial solutions for high-fidelity optimization tools. When the good initial solutions are used, the high-fidelity optimization tools quickly converge to a locally optimal solution near the initial solution. Q-law control parameters are represented as real-valued genes in the genetic algorithm. The performances of the Q-law control parameters are evaluated in the multi-objective space (flight time vs. propellant mass) and sorted by the non-dominated sorting method that assigns a better fitness value to the solutions that are dominated by a fewer number of other solutions. With the ranking result, the genetic algorithm encourages the solutions with higher fitness values to participate in the reproduction process, improving the solutions in the evolution process. The population of solutions converges to the Pareto front that is permitted within the Q-law control parameter space.

Indirect Optimization of Three-Dimensional Multiple-Impulse Moon-to-Earth Transfers

Science.gov (United States)

Shen, Hong-Xin; Casalino, Lorenzo

2014-11-01

This paper illustrates an indirect method to optimize multiple-impulse trajectories from circular lunar orbit to Earth. Optimization is performed in the circular restricted three-body problem, and the necessary optimality conditions are found through optimal control theory. In order to overcome the difficulty of initial adjoints estimation, a homotopic approach, which is based on an auxiliary optimization problem with known solution, is developed; this approach proves to be robust and efficient. Examples are presented for a range of lunar orbit orientations to assess the impact on velocity impulse requirements. Optimization results for trajectories with different number of impulses are also compared. The developed procedure can support fast and accurate evaluation of the transfer costs for Moon-to-Earth trajectories both in nominal conditions and for contingency plans.

Growth Trajectories of Health Behaviors from Adolescence through Young Adulthood

Directory of Open Access Journals (Sweden)

Nora Wiium

2015-10-01

Full Text Available Based on nine waves of data collected during a period of 17 years (1990–2007, the present study explored different developmental trajectories of the following unhealthy behaviors: regular smoking, lack of regular exercise, lack of daily fruit intake, and drunkenness. A baseline sample of 1195 13-year-old pupils was from 22 randomly selected schools in the Hordaland County in western Norway. Latent class growth analysis revealed three developmental trajectories. The first trajectory was a conventional trajectory, comprising 36.3% of participants, who showed changes in smoking, physical exercise, fruit intake, and drunkenness consistent with the prevailing age specific norms of these behaviors in the Norwegian society at the time. The second trajectory was a passive trajectory, comprising 25.5% of participants, who reported low levels of both healthy and unhealthy behaviors during the 17-year period. The third trajectory was an unhealthy trajectory, comprising 38.2% of participants, who had high levels of unhealthy behaviors over time. Several covariates were examined, but only sex and mother’s and father’s educational levels were found to be significantly associated with the identified trajectories. While these findings need to be replicated in future studies, the identification of the different trajectories suggests the need to tailor intervention according to specific needs.

Growth Trajectories of Health Behaviors from Adolescence through Young Adulthood

Science.gov (United States)

Wiium, Nora; Breivik, Kyrre; Wold, Bente

2015-01-01

Based on nine waves of data collected during a period of 17 years (1990–2007), the present study explored different developmental trajectories of the following unhealthy behaviors: regular smoking, lack of regular exercise, lack of daily fruit intake, and drunkenness. A baseline sample of 1195 13-year-old pupils was from 22 randomly selected schools in the Hordaland County in western Norway. Latent class growth analysis revealed three developmental trajectories. The first trajectory was a conventional trajectory, comprising 36.3% of participants, who showed changes in smoking, physical exercise, fruit intake, and drunkenness consistent with the prevailing age specific norms of these behaviors in the Norwegian society at the time. The second trajectory was a passive trajectory, comprising 25.5% of participants, who reported low levels of both healthy and unhealthy behaviors during the 17-year period. The third trajectory was an unhealthy trajectory, comprising 38.2% of participants, who had high levels of unhealthy behaviors over time. Several covariates were examined, but only sex and mother’s and father’s educational levels were found to be significantly associated with the identified trajectories. While these findings need to be replicated in future studies, the identification of the different trajectories suggests the need to tailor intervention according to specific needs. PMID:26516889

Growth Trajectories of Health Behaviors from Adolescence through Young Adulthood.

Science.gov (United States)

Wiium, Nora; Breivik, Kyrre; Wold, Bente

2015-10-28

Based on nine waves of data collected during a period of 17 years (1990-2007), the present study explored different developmental trajectories of the following unhealthy behaviors: regular smoking, lack of regular exercise, lack of daily fruit intake, and drunkenness. A baseline sample of 1195 13-year-old pupils was from 22 randomly selected schools in the Hordaland County in western Norway. Latent class growth analysis revealed three developmental trajectories. The first trajectory was a conventional trajectory, comprising 36.3% of participants, who showed changes in smoking, physical exercise, fruit intake, and drunkenness consistent with the prevailing age specific norms of these behaviors in the Norwegian society at the time. The second trajectory was a passive trajectory, comprising 25.5% of participants, who reported low levels of both healthy and unhealthy behaviors during the 17-year period. The third trajectory was an unhealthy trajectory, comprising 38.2% of participants, who had high levels of unhealthy behaviors over time. Several covariates were examined, but only sex and mother's and father's educational levels were found to be significantly associated with the identified trajectories. While these findings need to be replicated in future studies, the identification of the different trajectories suggests the need to tailor intervention according to specific needs.

Shadowing of physical trajectories in chaotic dynamics: Containment and refinement

International Nuclear Information System (INIS)

Grebogi, C.; Hammel, S.M.; Yorke, J.A.; Sauer, T.

1990-01-01

For a chaotic system, a noisy trajectory diverges rapidly from the true trajectory with the same initial condition. To understand in what sense the noisy trajectory reflects the true dynamics of the actual system, we developed a rigorous procedure to show that some true trajectories remain close to the noisy one for long times. The procedure involves a combination of containment, which establishes the existence of an uncountable number of true trajectories close to the noisy one, and refinement, which produces a less noisy trajectory. Our procedure is applied to noisy chaotic trajectories of the standard map and the driven pendulum

An Orthogonal Multi-Swarm Cooperative PSO Algorithm with a Particle Trajectory Knowledge Base

Directory of Open Access Journals (Sweden)

Jun Yang

2017-01-01

Full Text Available A novel orthogonal multi-swarm cooperative particle swarm optimization (PSO algorithm with a particle trajectory knowledge base is presented in this paper. Different from the traditional PSO algorithms and other variants of PSO, the proposed orthogonal multi-swarm cooperative PSO algorithm not only introduces an orthogonal initialization mechanism and a particle trajectory knowledge base for multi-dimensional optimization problems, but also conceives a new adaptive cooperation mechanism to accomplish the information interaction among swarms and particles. Experiments are conducted on a set of benchmark functions, and the results show its better performance compared with traditional PSO algorithm in aspects of convergence, computational efficiency and avoiding premature convergence.

Puff-trajectory modelling for long-duration releases

International Nuclear Information System (INIS)

Underwood, B.Y.

1988-01-01

This investigation considers some aspects of the interpretation and application of the puff-trajectory technique which is increasingly being considered for use in accident consequence assessment. It firsthigh lights the problems of applying the straight-line Gaussian model to releases of many hours duration and the drawbacks of using the ad hoc technique of multiple straight-line plumes, thereby pointing to the advantages of allowing curved trajectories. A number of fundamental questions are asked about the conventional puff-trajectory approach such as: what is the justification for using ensemble-average spread parameters (σ values) in constructing particular realizations of the concentration field and to what sampling time should these σ values correspond. These questions are answered in the present work by returning to basics: an interpretation of the puff-trajectory method is developed which establishes a correspondence between the omission of wind-field fluctuations with period below a given value in the generation of trajectories and the achievable spatial resolution of the estimates of time-integrated concentration. In application to accident consequence assessment, this focusses attention on what spatial resolution is necessary for particular consequence types or is implicit in the computational discretization employed

Rapid Onboard Trajectory Design for Autonomous Spacecraft in Multibody Systems

Science.gov (United States)

Trumbauer, Eric Michael

This research develops automated, on-board trajectory planning algorithms in order to support current and new mission concepts. These include orbiter missions to Phobos or Deimos, Outer Planet Moon orbiters, and robotic and crewed missions to small bodies. The challenges stem from the limited on-board computing resources which restrict full trajectory optimization with guaranteed convergence in complex dynamical environments. The approach taken consists of leveraging pre-mission computations to create a large database of pre-computed orbits and arcs. Such a database is used to generate a discrete representation of the dynamics in the form of a directed graph, which acts to index these arcs. This allows the use of graph search algorithms on-board in order to provide good approximate solutions to the path planning problem. Coupled with robust differential correction and optimization techniques, this enables the determination of an efficient path between any boundary conditions with very little time and computing effort. Furthermore, the optimization methods developed here based on sequential convex programming are shown to have provable convergence properties, as well as generating feasible major iterates in case of a system interrupt -- a key requirement for on-board application. The outcome of this project is thus the development of an algorithmic framework which allows the deployment of this approach in a variety of specific mission contexts. Test cases related to missions of interest to NASA and JPL such as a Phobos orbiter and a Near Earth Asteroid interceptor are demonstrated, including the results of an implementation on the RAD750 flight processor. This method fills a gap in the toolbox being developed to create fully autonomous space exploration systems.

Health-related quality of life and life satisfaction in colorectal cancer survivors: trajectories of adjustment.

Science.gov (United States)

Dunn, Jeff; Ng, Shu Kay; Breitbart, William; Aitken, Joanne; Youl, Pip; Baade, Peter D; Chambers, Suzanne K

2013-03-14

This longitudinal study describes the five year trajectories of health-related quality of life (HR-QOL) and life satisfaction in long term colorectal cancer survivors. A population-based sample of 1966 colorectal cancer survivors were surveyed at six time points from five months to five years post-diagnosis. Predictor variables were: socio-demographic variables, optimism; cancer threat appraisal; perceived social support. Quality of life was assessed with the Functional Assessment of Cancer Therapy-Colorectal (HR-QOL); and the Satisfaction with Life Scale. Growth mixture models were applied to identify trajectory classes and their predictors. Distinct adjustment trajectories were identified for HR-QOL and life satisfaction. Lower optimism, poorer social support, a more negative cognitive appraisal, and younger age were associated with poorer life satisfaction, while survivors with less than 8 years of education had higher life satisfaction. This pattern was similar for overall HR-QOL except that educational level was not a significant predictor and later stage disease and female gender emerged as related to poorer outcomes. One in five survivors reported poorer constant HR-QOL (19.2%) and a small group had poor life satisfaction (7.2%); 26.2% reported constant high HR-QOL and 48.8% had high constant life satisfaction. Socioeconomic disadvantage and remoteness of residence uniquely predicted poorer outcomes in the colorectal cancer specific HR-QOL sub domain. Although HR-QOL and subjective cognitive QOL share similar antecedents their trajectory patterns suggested they are distinct adjustment outcomes; with life satisfaction emerging as temporally stable phenomenon. Unique patterns of risk support suggest the need to account for heterogeneity in adjustment in longitudinal QOL studies with cancer survivors.

Optimizing Departure Times in Vehicle Routes

NARCIS (Netherlands)

Kok, A.L.; Hans, Elias W.; Schutten, Johannes M.J.

2011-01-01

Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporary traffic congestion make such solutions non-optimal with respect to minimizing the total duty time. Furthermore, the VRPTW does not

Power-limited low-thrust trajectory optimization with operation point detection

Science.gov (United States)

Chi, Zhemin; Li, Haiyang; Jiang, Fanghua; Li, Junfeng

2018-06-01

The power-limited solar electric propulsion system is considered more practical in mission design. An accurate mathematical model of the propulsion system, based on experimental data of the power generation system, is used in this paper. An indirect method is used to deal with the time-optimal and fuel-optimal control problems, in which the solar electric propulsion system is described using a finite number of operation points, which are characterized by different pairs of thruster input power. In order to guarantee the integral accuracy for the discrete power-limited problem, a power operation detection technique is embedded in the fourth-order Runge-Kutta algorithm with fixed step. Moreover, the logarithmic homotopy method and normalization technique are employed to overcome the difficulties caused by using indirect methods. Three numerical simulations with actual propulsion systems are given to substantiate the feasibility and efficiency of the proposed method.

Optimal control of hydroelectric facility incorporating pump storage

International Nuclear Information System (INIS)

Zhao, Guangzhi; Davison, Matt

2009-01-01

We consider a simple model of a pump-assisted hydroelectric facility operating in a market with time-varying but deterministic power prices and constant water inflows. The engineering details of the facility are described by a model containing several parameters. We present an algorithm for optimizing first the energy and then the profit produced by these plants. This algorithm allows us to describe the relationships between control trajectory and time, and between inflow and price. Remarkably, we see that under some reasonable choices of facility parameters and for power prices that are not extremely variable, the optimal profit operation of these facilities is not too different from their optimal energy operation, and the control is less affected by the price as the inflow rate increases. (author)

Real-time prediction of hand trajectory by ensembles of cortical neurons in primates

Science.gov (United States)

Wessberg, Johan; Stambaugh, Christopher R.; Kralik, Jerald D.; Beck, Pamela D.; Laubach, Mark; Chapin, John K.; Kim, Jung; Biggs, S. James; Srinivasan, Mandayam A.; Nicolelis, Miguel A. L.

2000-11-01

Signals derived from the rat motor cortex can be used for controlling one-dimensional movements of a robot arm. It remains unknown, however, whether real-time processing of cortical signals can be employed to reproduce, in a robotic device, the kind of complex arm movements used by primates to reach objects in space. Here we recorded the simultaneous activity of large populations of neurons, distributed in the premotor, primary motor and posterior parietal cortical areas, as non-human primates performed two distinct motor tasks. Accurate real-time predictions of one- and three-dimensional arm movement trajectories were obtained by applying both linear and nonlinear algorithms to cortical neuronal ensemble activity recorded from each animal. In addition, cortically derived signals were successfully used for real-time control of robotic devices, both locally and through the Internet. These results suggest that long-term control of complex prosthetic robot arm movements can be achieved by simple real-time transformations of neuronal population signals derived from multiple cortical areas in primates.

Eco-Approach and Departure System for Left-Turn Vehicles at a Fixed-Time Signalized Intersection

Directory of Open Access Journals (Sweden)

Huifu Jiang

2018-01-01

Full Text Available This research proposed an eco-approach and departure system for left-turn vehicles at a fixed-time signalized intersection. This system gives higher priority to enhancing traffic safety than improving mobility and fuel efficiency, and optimizes the entire traffic consisted of connected and automated vehicles (CAVs and conventional human-driven vehicles by providing ecological speed trajectories for left-turn CAVs. All the ecological speed trajectories are offline optimized before the implementation of system. The speed trajectory optimization is constructed in Pontryagin’s Minimum Principle structure. The before and after evaluation of the proposed system shows the percentage of vehicles that drive pass the intersection at safe speed increases by 2.14% to 45.65%, fuel consumption benefits range 0.53% to 18.44%, emission benefits range from 0.57% to 15.69%, no significant throughput benefits is observed. The proposed system significantly enhances the traffic safety and improves the fuel efficiency and emission reduction of left-turn vehicles with no adverse effect on mobility, and has a good robustness against the randomness of traffic. The investigation also indicates that the computation time of proposed system is greatly reduced compared to previous eco-driving system with online speed optimization. The computation time is up to 0.01 s. The proposed system is ready for real-time application.

Finding the Quickest Straight-Line Trajectory for a Three-Wheeled Omnidirectional Robot under Input Voltage Constraints

Directory of Open Access Journals (Sweden)

Ki Bum Kim

2015-01-01

Full Text Available We provide an analytical solution to the problem of generating the quickest straight-line trajectory for a three-wheeled omnidirectional mobile robot, under the practical constraint of limited voltage. Applying the maximum principle to the geometric properties of the input constraints, we find that an optimal input vector of motor voltages has at least one extreme value when the orientation of the robot is fixed and two extreme values when rotation is allowed. We can find an explicit representation of the optimal vector for a motion under fixed orientation. We derive several properties of quickest straight-line trajectories and verify them through simulation. We show that the quickest trajectory when rotation is allowed is always faster than the quickest with fixed orientation.

Energy-efficient Trajectory Tracking for Mobile Devices

DEFF Research Database (Denmark)

Kjærgaard, Mikkel Baun; Bhattacharya, Sourav; Blunck, Henrik

2011-01-01

Emergent location-aware applications often require tracking trajectories of mobile devices over a long period of time. To be useful, the tracking has to be energy-efficient to avoid having a major impact on the battery life of the mobile de vice. Furthermore, when trajectory information needs to ...

Three-year latent class trajectories of attention-deficit/hyperactivity disorder (ADHD) symptoms in a clinical sample not selected for ADHD.

Science.gov (United States)

Arnold, L Eugene; Ganocy, Stephen J; Mount, Katherine; Youngstrom, Eric A; Frazier, Thomas; Fristad, Mary; Horwitz, Sarah M; Birmaher, Boris; Findling, Robert; Kowatch, Robert A; Demeter, Christine; Axelson, David; Gill, Mary Kay; Marsh, Linda

2014-07-01

This study aims to examine trajectories of attention-deficit/hyperactivity disorder (ADHD) symptoms in the Longitudinal Assessment of Manic Symptoms (LAMS) sample. The LAMS study assessed 684 children aged 6 to 12 years with the Kiddie-Schedule for Affective Disorders and Schizophrenia (K-SADS) and rating scales semi-annually for 3 years. Although they were selected for elevated manic symptoms, 526 children had baseline ADHD diagnoses. With growth mixture modeling (GMM), we separately analyzed inattentive and hyperactive/impulsive symptoms, covarying baseline age. Multiple standard methods determined optimal fit. The χ(2) and Kruskal-Wallis analysis of variance compared resulting latent classes/trajectories on clinical characteristics and medication. Three latent class trajectories best described inattentive symptoms, and 4 classes best described hyperactive/impulsive symptoms. Inattentive trajectories maintained their relative position over time. Hyperactive/impulsive symptoms had 2 consistent trajectories (least and most severe). A third trajectory (4.5%) started mild, then escalated; and a fourth (14%) started severe but improved dramatically. The improving trajectory was associated with the highest rate of ADHD and lowest rate of bipolar diagnoses. Three-fourths of the mildest inattention class were also in the mildest hyperactive/impulsive class; 72% of the severest inattentive class were in the severest hyperactive/impulsive class, but the severest inattention class also included 62% of the improving hyperactive-impulsive class. An ADHD rather than bipolar diagnosis prognosticates a better course of hyperactive/impulsive, but not inattentive, symptoms. High overlap of relative severity between inattention and hyperactivity/impulsivity confirms the link between these symptom clusters. Hyperactive/impulsive symptoms wane more over time. Group means are insufficient to understand individual ADHD prognosis. A small subgroup deteriorates over time in

Infinite-horizon optimal control problems in economics

Energy Technology Data Exchange (ETDEWEB)

Aseev, Sergei M; Besov, Konstantin O; Kryazhimskii, Arkadii V

2012-04-30

This paper extends optimal control theory to a class of infinite-horizon problems that arise in studying models of optimal dynamic allocation of economic resources. In a typical problem of this sort the initial state is fixed, no constraints are imposed on the behaviour of the admissible trajectories at large times, and the objective functional is given by a discounted improper integral. We develop the method of finite-horizon approximations in a broad context and use it to derive complete versions of the Pontryagin maximum principle for such problems. We provide sufficient conditions for the normality of infinite-horizon optimal control problems and for the validity of the 'standard' limit transversality conditions with time going to infinity. As a meaningful example, we consider a new two-sector model of optimal economic growth subject to a random jump in prices. Bibliography: 53 titles.

Lane changing trajectory planning and tracking control for intelligent vehicle on curved road.

Science.gov (United States)

Wang, Lukun; Zhao, Xiaoying; Su, Hao; Tang, Gongyou

2016-01-01

This paper explores lane changing trajectory planning and tracking control for intelligent vehicle on curved road. A novel arcs trajectory is planned for the desired lane changing trajectory. A kinematic controller and a dynamics controller are designed to implement the trajectory tracking control. Firstly, the kinematic model and dynamics model of intelligent vehicle with non-holonomic constraint are established. Secondly, two constraints of lane changing on curved road in practice (LCCP) are proposed. Thirdly, two arcs with same curvature are constructed for the desired lane changing trajectory. According to the geometrical characteristics of arcs trajectory, equations of desired state can be calculated. Finally, the backstepping method is employed to design a kinematic trajectory tracking controller. Then the sliding-mode dynamics controller is designed to ensure that the motion of the intelligent vehicle can follow the desired velocity generated by kinematic controller. The stability of control system is proved by Lyapunov theory. Computer simulation demonstrates that the desired arcs trajectory and state curves with B-spline optimization can meet the requirements of LCCP constraints and the proposed control schemes can make tracking errors to converge uniformly.

Optimal Time-Abstract Schedulers for CTMDPs and Markov Games

Directory of Open Access Journals (Sweden)

Markus Rabe

2010-06-01

Full Text Available We study time-bounded reachability in continuous-time Markov decision processes for time-abstract scheduler classes. Such reachability problems play a paramount role in dependability analysis and the modelling of manufacturing and queueing systems. Consequently, their analysis has been studied intensively, and techniques for the approximation of optimal control are well understood. From a mathematical point of view, however, the question of approximation is secondary compared to the fundamental question whether or not optimal control exists. We demonstrate the existence of optimal schedulers for the time-abstract scheduler classes for all CTMDPs. Our proof is constructive: We show how to compute optimal time-abstract strategies with finite memory. It turns out that these optimal schedulers have an amazingly simple structure---they converge to an easy-to-compute memoryless scheduling policy after a finite number of steps. Finally, we show that our argument can easily be lifted to Markov games: We show that both players have a likewise simple optimal strategy in these more general structures.

Cellular dynamical mechanisms for encoding the time and place of events along spatiotemporal trajectories in episodic memory.

Science.gov (United States)

Hasselmo, Michael E; Giocomo, Lisa M; Brandon, Mark P; Yoshida, Motoharu

2010-12-31

Understanding the mechanisms of episodic memory requires linking behavioral data and lesion effects to data on the dynamics of cellular membrane potentials and population interactions within brain regions. Linking behavior to specific membrane channels and neurochemicals has implications for therapeutic applications. Lesions of the hippocampus, entorhinal cortex and subcortical nuclei impair episodic memory function in humans and animals, and unit recording data from these regions in behaving animals indicate episodic memory processes. Intracellular recording in these regions demonstrates specific cellular properties including resonance, membrane potential oscillations and bistable persistent spiking that could underlie the encoding and retrieval of episodic trajectories. A model presented here shows how intrinsic dynamical properties of neurons could mediate the encoding of episodic memories as complex spatiotemporal trajectories. The dynamics of neurons allow encoding and retrieval of unique episodic trajectories in multiple continuous dimensions including temporal intervals, personal location, the spatial coordinates and sensory features of perceived objects and generated actions, and associations between these elements. The model also addresses how cellular dynamics could underlie unit firing data suggesting mechanisms for coding continuous dimensions of space, time, sensation and action. Copyright © 2010 Elsevier B.V. All rights reserved.

Discrete-time optimal control and games on large intervals

CERN Document Server

Zaslavski, Alexander J

2017-01-01

Devoted to the structure of approximate solutions of discrete-time optimal control problems and approximate solutions of dynamic discrete-time two-player zero-sum games, this book presents results on properties of approximate solutions in an interval that is independent lengthwise, for all sufficiently large intervals. Results concerning the so-called turnpike property of optimal control problems and zero-sum games in the regions close to the endpoints of the time intervals are the main focus of this book. The description of the structure of approximate solutions on sufficiently large intervals and its stability will interest graduate students and mathematicians in optimal control and game theory, engineering, and economics. This book begins with a brief overview and moves on to analyze the structure of approximate solutions of autonomous nonconcave discrete-time optimal control Lagrange problems.Next the structures of approximate solutions of autonomous discrete-time optimal control problems that are discret...

User Oriented Trajectory Search for Trip Recommendation

KAUST Repository

Ding, Ruogu

2012-07-08

Trajectory sharing and searching have received significant attention in recent years. In this thesis, we propose and investigate the methods to find and recommend the best trajectory to the traveler, and mainly focus on a novel technique named User Oriented Trajectory Search (UOTS) query processing. In contrast to conventional trajectory search by locations (spatial domain only), we consider both spatial and textual domains in the new UOTS query. Given a trajectory data set, the query input contains a set of intended places given by the traveler and a set of textual attributes describing the traveler’s preference. If a trajectory is connecting/close to the specified query locations, and the textual attributes of the trajectory are similar to the traveler’s preference, it will be recommended to the traveler. This type of queries can enable many popular applications such as trip planning and recommendation. There are two challenges in UOTS query processing, (i) how to constrain the searching range in two domains and (ii) how to schedule multiple query sources effectively. To overcome the challenges and answer the UOTS query efficiently, a novel collaborative searching approach is developed. Conceptually, the UOTS query processing is conducted in the spatial and textual domains alternately. A pair of upper and lower bounds are devised to constrain the searching range in two domains. In the meantime, a heuristic searching strategy based on priority ranking is adopted for scheduling the multiple query sources, which can further reduce the searching range and enhance the query efficiency notably. Furthermore, the devised collaborative searching approach can be extended to situations where the query locations are ordered. Extensive experiments are conducted on both real and synthetic trajectory data in road networks. Our approach is verified to be effective in reducing both CPU time and disk I/O time.

The timing of family commitments in the early work career: Work-family trajectories of young adults in Flanders

Directory of Open Access Journals (Sweden)

Suzana Koelet

2015-03-01

Full Text Available Objective: This article examines the diverse ways in which young adults develop both their professional career and family life in the years immediately after they complete their education. Building a career and starting a family often occur simultaneously in this stage of life. By studying the simultaneous developments in these life domains, we can gain a better understanding of this complex interplay. Methods: The data consist of a sample of 1,657 young adults born in 1976 who were interviewed as part of the SONAR survey of Flanders at ages 23, 26, and 29 about their education, their entry into and early years on the labour market, and their family life. Sequence analysis is used to study the timing of union formation and having children among these young adults, as well as how these events are related to their work career. Multinomial regression analysis is applied to help us gain a better understanding of the extent to which these life course patterns are determined by education and economic status at the start of the career. Results: The results reveal a set of work-family trajectories which vary in terms of the extent of labour market participation and the type and timing of family formation. Various aspects of the trajectory are found to be determined by different dimensions of an individual's educational career (duration, level, field of study. Education is more relevant for women than for men, as a man's trajectory is more likely than a woman's to be determined by the first job. Conclusions: By using a simultaneous approach which takes into account both family and work, this life course analysis confirms that men have a head start on the labour market, and examines the factors which influence the distinct trajectories of young women and men.

Straight trajectory planning for keyhole neurosurgery in sheep with automatic brain structures segmentation

Science.gov (United States)

Favaro, Alberto; Lad, Akash; Formenti, Davide; Zani, Davide Danilo; De Momi, Elena

2017-03-01

In a translational neuroscience/neurosurgery perspective, sheep are considered good candidates to study because of the similarity between their brain and the human one. Automatic planning systems for safe keyhole neurosurgery maximize the probe/catheter distance from vessels and risky structures. This work consists in the development of a trajectories planner for straight catheters placement intended to be used for investigating the drug diffusivity mechanisms in sheep brain. Automatic brain segmentation of gray matter, white matter and cerebrospinal fluid is achieved using an online available sheep atlas. Ventricles, midbrain and cerebellum segmentation have been also carried out. The veterinary surgeon is asked to select a target point within the white matter to be reached by the probe and to define an entry area on the brain cortex. To mitigate the risk of hemorrhage during the insertion process, which can prevent the success of the insertion procedure, the trajectory planner performs a curvature analysis of the brain cortex and wipes out from the poll of possible entry points the sulci, as part of brain cortex where superficial blood vessels are naturally located. A limited set of trajectories is then computed and presented to the surgeon, satisfying an optimality criteria based on a cost function which considers the distance from critical brain areas and the whole trajectory length. The planner proved to be effective in defining rectilinear trajectories accounting for the safety constraints determined by the brain morphology. It also demonstrated a short computational time and good capability in segmenting gyri and sulci surfaces.

Constrained Burn Optimization for the International Space Station

Science.gov (United States)

Brown, Aaron J.; Jones, Brandon A.

2017-01-01

In long-term trajectory planning for the International Space Station (ISS), translational burns are currently targeted sequentially to meet the immediate trajectory constraints, rather than simultaneously to meet all constraints, do not employ gradient-based search techniques, and are not optimized for a minimum total deltav (v) solution. An analytic formulation of the constraint gradients is developed and used in an optimization solver to overcome these obstacles. Two trajectory examples are explored, highlighting the advantage of the proposed method over the current approach, as well as the potential v and propellant savings in the event of propellant shortages.

Integrated trajectory control and collision avoidance for automated driving

NARCIS (Netherlands)

Verhaegh, J.; Ploeg, J.; Nunen, E. van; Teerhuis, A.

2017-01-01

This paper presents a method for trajectory control, based on feedback linearization to guide an Automatic Guided Vehicle (AGV). The novelty of this work, is the adaptation of a reference trajectory with respect to a desired velocity in real-time to avoid collisions using a time-scaling mechanism.

A new design and rationale for 3D orthogonally oversampled k-space trajectories.

Science.gov (United States)

Pipe, James G; Zwart, Nicholas R; Aboussouan, Eric A; Robison, Ryan K; Devaraj, Ajit; Johnson, Kenneth O

2011-11-01

A novel center-out 3D trajectory for sampling magnetic resonance data is presented. The trajectory set is based on a single Fermat spiral waveform, which is substantially undersampled in the center of k-space. Multiple trajectories are combined in a "stacked cone" configuration to give very uniform sampling throughout a "hub," which is very efficient in terms of gradient performance and uniform trajectory spacing. The fermat looped, orthogonally encoded trajectories (FLORET) design produces less gradient-efficient trajectories near the poles, so multiple orthogonal hub designs are shown. These multihub designs oversample k-space twice with orthogonal trajectories, which gives unique properties but also doubles the minimum scan time for critical sampling of k-space. The trajectory is shown to be much more efficient than the conventional stack of cones trajectory, and has nearly the same signal-to-noise ratio efficiency (but twice the minimum scan time) as a stack of spirals trajectory. As a center-out trajectory, it provides a shorter minimum echo time than stack of spirals, and its spherical k-space coverage can dramatically reduce Gibbs ringing. Copyright © 2011 Wiley Periodicals, Inc.

Interplanetary Trajectory Design for the Asteroid Robotic Redirect Mission Alternate Approach Trade Study

Science.gov (United States)

Merrill, Raymond Gabriel; Qu, Min; Vavrina, Matthew A.; Englander, Jacob A.; Jones, Christopher A.

2014-01-01

This paper presents mission performance analysis methods and results for the Asteroid Robotic Redirect Mission (ARRM) option to capture a free standing boulder on the surface of a 100 m or larger NEA. It details the optimization and design of heliocentric low-thrust trajectories to asteroid targets for the ARRM solar electric propulsion spacecraft. Extensive searches were conducted to determine asteroid targets with large pick-up mass potential and potential observation opportunities. Interplanetary trajectory approximations were developed in method based tools for Itokawa, Bennu, 1999 JU3, and 2008 EV5 and were validated by end-to-end integrated trajectories.

Trajectory Design to Mitigate Risk on the Transiting Exoplanet Survey Satellite (TESS) Mission

Science.gov (United States)

Dichmann, Donald

2016-01-01

The Transiting Exoplanet Survey Satellite (TESS) will employ a highly eccentric Earth orbit, in 2:1 lunar resonance, reached with a lunar flyby preceded by 3.5 phasing loops. The TESS mission has limited propellant and several orbit constraints. Based on analysis and simulation, we have designed the phasing loops to reduce delta-V and to mitigate risk due to maneuver execution errors. We have automated the trajectory design process and use distributed processing to generate and to optimize nominal trajectories, check constraint satisfaction, and finally model the effects of maneuver errors to identify trajectories that best meet the mission requirements.

Analytical Ballistic Trajectories with Approximately Linear Drag

Directory of Open Access Journals (Sweden)

Giliam J. P. de Carpentier

2014-01-01

Full Text Available This paper introduces a practical analytical approximation of projectile trajectories in 2D and 3D roughly based on a linear drag model and explores a variety of different planning algorithms for these trajectories. Although the trajectories are only approximate, they still capture many of the characteristics of a real projectile in free fall under the influence of an invariant wind, gravitational pull, and terminal velocity, while the required math for these trajectories and planners is still simple enough to efficiently run on almost all modern hardware devices. Together, these properties make the proposed approach particularly useful for real-time applications where accuracy and performance need to be carefully balanced, such as in computer games.

Optimal Guaranteed Service Time and Service Level Decision with Time and Service Level Sensitive Demand

Directory of Open Access Journals (Sweden)

Sangjun Park

2014-01-01

Full Text Available We consider a two-stage supply chain with one supplier and one retailer. The retailer sells a product to customer and the supplier provides a product in a make-to-order mode. In this case, the supplier’s decisions on service time and service level and the retailer’s decision on retail price have effects on customer demand. We develop optimization models to determine the optimal retail price, the optimal guaranteed service time, the optimal service level, and the optimal capacity to maximize the expected profit of the whole supply chain. The results of numerical experiments show that it is more profitable to determine the optimal price, the optimal guaranteed service time, and the optimal service level simultaneously and the proposed model is more profitable in service level sensitive market.

Quantum trajectory phase transitions in the micromaser.

Science.gov (United States)

Garrahan, Juan P; Armour, Andrew D; Lesanovsky, Igor

2011-08-01

We study the dynamics of the single-atom maser, or micromaser, by means of the recently introduced method of thermodynamics of quantum jump trajectories. We find that the dynamics of the micromaser displays multiple space-time phase transitions, i.e., phase transitions in ensembles of quantum jump trajectories. This rich dynamical phase structure becomes apparent when trajectories are classified by dynamical observables that quantify dynamical activity, such as the number of atoms that have changed state while traversing the cavity. The space-time transitions can be either first order or continuous, and are controlled not just by standard parameters of the micromaser but also by nonequilibrium "counting" fields. We discuss how the dynamical phase behavior relates to the better known stationary-state properties of the micromaser.

Trajectory Generation Method with Convolution Operation on Velocity Profile

Energy Technology Data Exchange (ETDEWEB)

Lee, Geon [Hanyang Univ., Seoul (Korea, Republic of); Kim, Doik [Korea Institute of Science and Technology, Daejeon (Korea, Republic of)

2014-03-15

The use of robots is no longer limited to the field of industrial robots and is now expanding into the fields of service and medical robots. In this light, a trajectory generation method that can respond instantaneously to the external environment is strongly required. Toward this end, this study proposes a method that enables a robot to change its trajectory in real-time using a convolution operation. The proposed method generates a trajectory in real time and satisfies the physical limits of the robot system such as acceleration and velocity limit. Moreover, a new way to improve the previous method, which generates inefficient trajectories in some cases owing to the characteristics of the trapezoidal shape of trajectories, is proposed by introducing a triangle shape. The validity and effectiveness of the proposed method is shown through a numerical simulation and a comparison with the previous convolution method.

Real-Time Optimization and Control of Next-Generation Distribution

Science.gov (United States)

-Generation Distribution Infrastructure Real-Time Optimization and Control of Next-Generation Distribution developing a system-theoretic distribution network management framework that unifies real-time voltage and Infrastructure | Grid Modernization | NREL Real-Time Optimization and Control of Next

Trajectories of suicidal ideation in patients with first-episode psychosis