Ni, Jianjun; Wu, Liuying; Shi, Pengfei; Yang, Simon X
2017-01-01
Real-time path planning for autonomous underwater vehicle (AUV) is a very difficult and challenging task. Bioinspired neural network (BINN) has been used to deal with this problem for its many distinct advantages: that is, no learning process is needed and realization is also easy. However, there are some shortcomings when BINN is applied to AUV path planning in a three-dimensional (3D) unknown environment, including complex computing problem when the environment is very large and repeated path problem when the size of obstacles is bigger than the detection range of sensors. To deal with these problems, an improved dynamic BINN is proposed in this paper. In this proposed method, the AUV is regarded as the core of the BINN and the size of the BINN is based on the detection range of sensors. Then the BINN will move with the AUV and the computing could be reduced. A virtual target is proposed in the path planning method to ensure that the AUV can move to the real target effectively and avoid big-size obstacles automatically. Furthermore, a target attractor concept is introduced to improve the computing efficiency of neural activities. Finally, some experiments are conducted under various 3D underwater environments. The experimental results show that the proposed BINN based method can deal with the real-time path planning problem for AUV efficiently.
A Distributed Framework for Real Time Path Planning in Practical Multi-agent Systems
Abdelkader, Mohamed; Jaleel, Hassan; Shamma, Jeff S.
2017-01-01
We present a framework for distributed, energy efficient, and real time implementable algorithms for path planning in multi-agent systems. The proposed framework is presented in the context of a motivating example of capture the flag which
MR-based real time path planning for cardiac operations with transapical access.
Yeniaras, Erol; Navkar, Nikhil V; Sonmez, Ahmet E; Shah, Dipan J; Deng, Zhigang; Tsekos, Nikolaos V
2011-01-01
Minimally invasive surgeries (MIS) have been perpetually evolving due to their potential high impact on improving patient management and overall cost effectiveness. Currently, MIS are further strengthened by the incorporation of magnetic resonance imaging (MRI) for amended visualization and high precision. Motivated by the fact that real-time MRI is emerging as a feasible modality especially for guiding interventions and surgeries in the beating heart; in this paper we introduce a real-time path planning algorithm for intracardiac procedures. Our approach creates a volumetric safety zone inside a beating heart and updates it on-the-fly using real-time MRI during the deployment of a robotic device. In order to prove the concept and assess the feasibility of the introduced method, a realistic operational scenario of transapical aortic valve replacement in a beating heart is chosen as the virtual case study.
Real-time Collision Avoidance and Path Optimizer for Semi-autonomous UAVs.
Hawary, A. F.; Razak, N. A.
2018-05-01
Whilst UAV offers a potentially cheaper and more localized observation platform than current satellite or land-based approaches, it requires an advance path planner to reveal its true potential, particularly in real-time missions. Manual control by human will have limited line-of-sights and prone to errors due to careless and fatigue. A good alternative solution is to equip the UAV with semi-autonomous capabilities that able to navigate via a pre-planned route in real-time fashion. In this paper, we propose an easy-and-practical path optimizer based on the classical Travelling Salesman Problem and adopts a brute force search method to re-optimize the route in the event of collisions using range finder sensor. The former utilizes a Simple Genetic Algorithm and the latter uses Nearest Neighbour algorithm. Both algorithms are combined to optimize the route and avoid collision at once. Although many researchers proposed various path planning algorithms, we find that it is difficult to integrate on a basic UAV model and often lacks of real-time collision detection optimizer. Therefore, we explore a practical benefit from this approach using on-board Arduino and Ardupilot controllers by manually emulating the motion of an actual UAV model prior to test on the flying site. The result showed that the range finder sensor provides a real-time data to the algorithm to find a collision-free path and eventually optimized the route successfully.
A Distributed Framework for Real Time Path Planning in Practical Multi-agent Systems
Abdelkader, Mohamed
2017-10-19
We present a framework for distributed, energy efficient, and real time implementable algorithms for path planning in multi-agent systems. The proposed framework is presented in the context of a motivating example of capture the flag which is an adversarial game played between two teams of autonomous agents called defenders and attackers. We start with the centralized formulation of the problem as a linear program because of its computational efficiency. Then we present an approximation framework in which each agent solves a local version of the centralized linear program by communicating with its neighbors only. The premise in this work is that for practical multi-agent systems, real time implementability of distributed algorithms is more crucial then global optimality. Thus, instead of verifying the proposed framework by performing offline simulations in MATLAB, we run extensive simulations in a robotic simulator V-REP, which includes a detailed dynamic model of quadrotors. Moreover, to create a realistic scenario, we allow a human operator to control the attacker quadrotor through a joystick in a single attacker setup. These simulations authenticate that the proposed framework is real time implementable and results in a performance that is comparable with the global optimal solution under the considered scenarios.
The Waypoint Planning Tool: Real Time Flight Planning for Airborne Science
He, M.; Goodman, H. M.; Blakeslee, R.; Hall, J. M.
2010-12-01
NASA Earth science research utilizes both spaceborne and airborne real time observations in the planning and operations of its field campaigns. The coordination of air and space components is critical to achieve the goals and objectives and ensure the success of an experiment. Spaceborne imagery provides regular and continual coverage of the Earth and it is a significant component in all NASA field experiments. Real time visible and infrared geostationary images from GOES satellites and multi-spectral data from the many elements of the NASA suite of instruments aboard the TRMM, Terra, Aqua, Aura, and other NASA satellites have become norm. Similarly, the NASA Airborne Science Program draws upon a rich pool of instrumented aircraft. The NASA McDonnell Douglas DC-8, Lockheed P3 Orion, DeHavilland Twin Otter, King Air B200, Gulfstream-III are all staples of a NASA’s well-stocked, versatile hangar. A key component in many field campaigns is coordinating the aircraft with satellite overpasses, other airplanes and the constantly evolving, dynamic weather conditions. Given the variables involved, developing a good flight plan that meets the objectives of the field experiment can be a challenging and time consuming task. Planning a research aircraft mission within the context of meeting the science objectives is complex task because it is much more than flying from point A to B. Flight plans typically consist of flying a series of transects or involve dynamic path changes when “chasing” a hurricane or forest fire. These aircraft flight plans are typically designed by the mission scientists then verified and implemented by the navigator or pilot. Flight planning can be an arduous task requiring frequent sanity checks by the flight crew. This requires real time situational awareness of the weather conditions that affect the aircraft track. Scientists at the University of Alabama-Huntsville and the NASA Marshall Space Flight Center developed the Waypoint Planning Tool
Minimum Time Path Planning for Robotic Manipulator in Drilling/ Spot Welding Tasks
Directory of Open Access Journals (Sweden)
Qiang Zhang
2016-04-01
Full Text Available In this paper, a minimum time path planning strategy is proposed for multi points manufacturing problems in drilling/spot welding tasks. By optimizing the travelling schedule of the set points and the detailed transfer path between points, the minimum time manufacturing task is realized under fully utilizing the dynamic performance of robotic manipulator. According to the start-stop movement in drilling/spot welding task, the path planning problem can be converted into a traveling salesman problem (TSP and a series of point to point minimum time transfer path planning problems. Cubic Hermite interpolation polynomial is used to parameterize the transfer path and then the path parameters are optimized to obtain minimum point to point transfer time. A new TSP with minimum time index is constructed by using point-point transfer time as the TSP parameter. The classical genetic algorithm (GA is applied to obtain the optimal travelling schedule. Several minimum time drilling tasks of a 3-DOF robotic manipulator are used as examples to demonstrate the effectiveness of the proposed approach.
An adaptive dual-optimal path-planning technique for unmanned air vehicles
Directory of Open Access Journals (Sweden)
Whitfield Clifford A.
2016-01-01
Full Text Available A multi-objective technique for unmanned air vehicle path-planning generation through task allocation has been developed. The dual-optimal path-planning technique generates real-time adaptive flight paths based on available flight windows and environmental influenced objectives. The environmentally-influenced flight condition determines the aircraft optimal orientation within a downstream virtual window of possible vehicle destinations that is based on the vehicle’s kinematics. The intermittent results are then pursued by a dynamic optimization technique to determine the flight path. This path-planning technique is a multi-objective optimization procedure consisting of two goals that do not require additional information to combine the conflicting objectives into a single-objective. The technique was applied to solar-regenerative high altitude long endurance flight which can benefit significantly from an adaptive real-time path-planning technique. The objectives were to determine the minimum power required flight paths while maintaining maximum solar power for continual surveillance over an area of interest (AOI. The simulated path generation technique prolonged the flight duration over a sustained turn loiter flight path by approximately 2 months for a year of flight. The potential for prolonged solar powered flight was consistent for all latitude locations, including 2 months of available flight at 60° latitude, where sustained turn flight was no longer capable.
Real-time interactive treatment planning
International Nuclear Information System (INIS)
Otto, Karl
2014-01-01
The goal of this work is to develop an interactive treatment planning platform that permits real-time manipulation of dose distributions including DVHs and other dose metrics. The hypothesis underlying the approach proposed here is that the process of evaluating potential dose distribution options and deciding on the best clinical trade-offs may be separated from the derivation of the actual delivery parameters used for the patient’s treatment. For this purpose a novel algorithm for deriving an Achievable Dose Estimate (ADE) was developed. The ADE algorithm is computationally efficient so as to update dose distributions in effectively real-time while accurately incorporating the limits of what can be achieved in practice. The resulting system is a software environment for interactive real-time manipulation of dose that permits the clinician to rapidly develop a fully customized 3D dose distribution. Graphical navigation of dose distributions is achieved by a sophisticated method of identifying contributing fluence elements, modifying those elements and re-computing the entire dose distribution. 3D dose distributions are calculated in ∼2–20 ms. Including graphics processing overhead, clinicians may visually interact with the dose distribution (e.g. ‘drag’ a DVH) and display updates of the dose distribution at a rate of more than 20 times per second. Preliminary testing on various sites shows that interactive planning may be completed in ∼1–5 min, depending on the complexity of the case (number of targets and OARs). Final DVHs are derived through a separate plan optimization step using a conventional VMAT planning system and were shown to be achievable within 2% and 4% in high and low dose regions respectively. With real-time interactive planning trade-offs between Target(s) and OARs may be evaluated efficiently providing a better understanding of the dosimetric options available to each patient in static or adaptive RT. (paper)
Model Checking Real Time Java Using Java PathFinder
Lindstrom, Gary; Mehlitz, Peter C.; Visser, Willem
2005-01-01
The Real Time Specification for Java (RTSJ) is an augmentation of Java for real time applications of various degrees of hardness. The central features of RTSJ are real time threads; user defined schedulers; asynchronous events, handlers, and control transfers; a priority inheritance based default scheduler; non-heap memory areas such as immortal and scoped, and non-heap real time threads whose execution is not impeded by garbage collection. The Robust Software Systems group at NASA Ames Research Center has JAVA PATHFINDER (JPF) under development, a Java model checker. JPF at its core is a state exploring JVM which can examine alternative paths in a Java program (e.g., via backtracking) by trying all nondeterministic choices, including thread scheduling order. This paper describes our implementation of an RTSJ profile (subset) in JPF, including requirements, design decisions, and current implementation status. Two examples are analyzed: jobs on a multiprogramming operating system, and a complex resource contention example involving autonomous vehicles crossing an intersection. The utility of JPF in finding logic and timing errors is illustrated, and the remaining challenges in supporting all of RTSJ are assessed.
Learning to improve path planning performance
International Nuclear Information System (INIS)
Chen, Pang C.
1995-04-01
In robotics, path planning refers to finding a short. collision-free path from an initial robot configuration to a desired configuratioin. It has to be fast to support real-time task-level robot programming. Unfortunately, current planning techniques are still too slow to be effective, as they often require several minutes, if not hours of computation. To remedy this situation, we present and analyze a learning algorithm that uses past experience to increase future performance. The algorithm relies on an existing path planner to provide solutions to difficult tasks. From these solutions, an evolving sparse network of useful robot configurations is learned to support faster planning. More generally, the algorithm provides a speedup-learning framework in which a slow but capable planner may be improved both cost-wise and capability-wise by a faster but less capable planner coupled with experience. The basic algorithm is suitable for stationary environments, and can be extended to accommodate changing environments with on-demand experience repair and object-attached experience abstraction. To analyze the algorithm, we characterize the situations in which the adaptive planner is useful, provide quantitative bounds to predict its behavior, and confirm our theoretical results with experiments in path planning of manipulators. Our algorithm and analysis are sufficiently, general that they may also be applied to other planning domains in which experience is useful
Path planning in changeable environments
Nieuwenhuisen, D.
2007-01-01
This thesis addresses path planning in changeable environments. In contrast to traditional path planning that deals with static environments, in changeable environments objects are allowed to change their configurations over time. In many cases, path planning algorithms must facilitate quick
Cooperative organic mine avoidance path planning
McCubbin, Christopher B.; Piatko, Christine D.; Peterson, Adam V.; Donnald, Creighton R.; Cohen, David
2005-06-01
The JHU/APL Path Planning team has developed path planning techniques to look for paths that balance the utility and risk associated with different routes through a minefield. Extending on previous years' efforts, we investigated real-world Naval mine avoidance requirements and developed a tactical decision aid (TDA) that satisfies those requirements. APL has developed new mine path planning techniques using graph based and genetic algorithms which quickly produce near-minimum risk paths for complicated fitness functions incorporating risk, path length, ship kinematics, and naval doctrine. The TDA user interface, a Java Swing application that obtains data via Corba interfaces to path planning databases, allows the operator to explore a fusion of historic and in situ mine field data, control the path planner, and display the planning results. To provide a context for the minefield data, the user interface also renders data from the Digital Nautical Chart database, a database created by the National Geospatial-Intelligence Agency containing charts of the world's ports and coastal regions. This TDA has been developed in conjunction with the COMID (Cooperative Organic Mine Defense) system. This paper presents a description of the algorithms, architecture, and application produced.
PSO-Based Robot Path Planning for Multisurvivor Rescue in Limited Survival Time
Directory of Open Access Journals (Sweden)
N. Geng
2014-01-01
Full Text Available Since the strength of a trapped person often declines with time in urgent and dangerous circumstances, adopting a robot to rescue as many survivors as possible in limited time is of considerable significance. However, as one key issue in robot navigation, how to plan an optimal rescue path of a robot has not yet been fully solved. This paper studies robot path planning for multisurvivor rescue in limited survival time using a representative heuristic, particle swarm optimization (PSO. First, the robot path planning problem including multiple survivors is formulated as a discrete optimization one with high constraint, where the number of rescued persons is taken as the unique objective function, and the strength of a trapped person is used to constrain the feasibility of a path. Then, a new integer PSO algorithm is presented to solve the mathematical model, and several new operations, such as the update of a particle, the insertion and inversion operators, and the rapidly local search method, are incorporated into the proposed algorithm to improve its effectiveness. Finally, the simulation results demonstrate the capacity of our method in generating optimal paths with high quality.
Feasible Path Planning for Autonomous Vehicles
Directory of Open Access Journals (Sweden)
Vu Trieu Minh
2014-01-01
Full Text Available The objective of this paper is to find feasible path planning algorithms for nonholonomic vehicles including flatness, polynomial, and symmetric polynomial trajectories subject to the real vehicle dynamical constraints. Performances of these path planning methods are simulated and compared to evaluate the more realistic and smoother generated trajectories. Results show that the symmetric polynomial algorithm provides the smoothest trajectory. Therefore, this algorithm is recommended for the development of an automatic control for autonomous vehicles.
Mobile Robots Path Planning Using the Overall Conflict Resolution and Time Baseline Coordination
Directory of Open Access Journals (Sweden)
Yong Ma
2014-01-01
Full Text Available This paper aims at resolving the path planning problem in a time-varying environment based on the idea of overall conflict resolution and the algorithm of time baseline coordination. The basic task of the introduced path planning algorithms is to fulfill the automatic generation of the shortest paths from the defined start poses to their end poses with consideration of generous constraints for multiple mobile robots. Building on this, by using the overall conflict resolution, within the polynomial based paths, we take into account all the constraints including smoothness, motion boundary, kinematics constraints, obstacle avoidance, and safety constraints among robots together. And time baseline coordination algorithm is proposed to process the above formulated problem. The foremost strong point is that much time can be saved with our approach. Numerical simulations verify the effectiveness of our approach.
Minimum dose method for walking-path planning of nuclear facilities
International Nuclear Information System (INIS)
Liu, Yong-kuo; Li, Meng-kun; Xie, Chun-li; Peng, Min-jun; Wang, Shuang-yu; Chao, Nan; Liu, Zhong-kun
2015-01-01
Highlights: • For radiation environment, the environment model is proposed. • For the least dose walking path problem, a path-planning method is designed. • The path-planning virtual–real mixed simulation program is developed. • The program can plan walking path and simulate. - Abstract: A minimum dose method based on staff walking road network model was proposed for the walking-path planning in nuclear facilities. A virtual–reality simulation program was developed using C# programming language and Direct X engine. The simulation program was used in simulations dealing with virtual nuclear facilities. Simulation results indicated that the walking-path planning method was effective in providing safety for people walking in nuclear facilities
Li, Dachuan; Li, Qing; Cheng, Nong; Song, Jingyan
2014-11-18
This paper presents a real-time motion planning approach for autonomous vehicles with complex dynamics and state uncertainty. The approach is motivated by the motion planning problem for autonomous vehicles navigating in GPS-denied dynamic environments, which involves non-linear and/or non-holonomic vehicle dynamics, incomplete state estimates, and constraints imposed by uncertain and cluttered environments. To address the above motion planning problem, we propose an extension of the closed-loop rapid belief trees, the closed-loop random belief trees (CL-RBT), which incorporates predictions of the position estimation uncertainty, using a factored form of the covariance provided by the Kalman filter-based estimator. The proposed motion planner operates by incrementally constructing a tree of dynamically feasible trajectories using the closed-loop prediction, while selecting candidate paths with low uncertainty using efficient covariance update and propagation. The algorithm can operate in real-time, continuously providing the controller with feasible paths for execution, enabling the vehicle to account for dynamic and uncertain environments. Simulation results demonstrate that the proposed approach can generate feasible trajectories that reduce the state estimation uncertainty, while handling complex vehicle dynamics and environment constraints.
Cooperative path planning for multi-USV based on improved artificial bee colony algorithm
Cao, Lu; Chen, Qiwei
2018-03-01
Due to the complex constraints, more uncertain factors and critical real-time demand of path planning for multiple unmanned surface vehicle (multi-USV), an improved artificial bee colony (I-ABC) algorithm were proposed to solve the model of cooperative path planning for multi-USV. First the Voronoi diagram of battle field space is conceived to generate the optimal area of USVs paths. Then the chaotic searching algorithm is used to initialize the collection of paths, which is regard as foods of the ABC algorithm. With the limited data, the initial collection can search the optimal area of paths perfectly. Finally simulations of the multi-USV path planning under various threats have been carried out. Simulation results verify that the I-ABC algorithm can improve the diversity of nectar source and the convergence rate of algorithm. It can increase the adaptability of dynamic battlefield and unexpected threats for USV.
Time-optimal path planning in uncertain flow fields using ensemble method
Wang, Tong; Le Maitre, Olivier; Hoteit, Ibrahim; Knio, Omar
2016-01-01
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
An Efficient Energy Constraint Based UAV Path Planning for Search and Coverage
Directory of Open Access Journals (Sweden)
German Gramajo
2017-01-01
Full Text Available A path planning strategy for a search and coverage mission for a small UAV that maximizes the area covered based on stored energy and maneuverability constraints is presented. The proposed formulation has a high level of autonomy, without requiring an exact choice of optimization parameters, and is appropriate for real-time implementation. The computed trajectory maximizes spatial coverage while closely satisfying terminal constraints on the position of the vehicle and minimizing the time of flight. Comparisons of this formulation to a path planning algorithm based on those with time constraint show equivalent coverage performance but improvement in prediction of overall mission duration and accuracy of the terminal position of the vehicle.
Path Planning Algorithms for the Adaptive Sensor Fleet
Stoneking, Eric; Hosler, Jeff
2005-01-01
The Adaptive Sensor Fleet (ASF) is a general purpose fleet management and planning system being developed by NASA in coordination with NOAA. The current mission of ASF is to provide the capability for autonomous cooperative survey and sampling of dynamic oceanographic phenomena such as current systems and algae blooms. Each ASF vessel is a software model that represents a real world platform that carries a variety of sensors. The OASIS platform will provide the first physical vessel, outfitted with the systems and payloads necessary to execute the oceanographic observations described in this paper. The ASF architecture is being designed for extensibility to accommodate heterogenous fleet elements, and is not limited to using the OASIS platform to acquire data. This paper describes the path planning algorithms developed for the acquisition phase of a typical ASF task. Given a polygonal target region to be surveyed, the region is subdivided according to the number of vessels in the fleet. The subdivision algorithm seeks a solution in which all subregions have equal area and minimum mean radius. Once the subregions are defined, a dynamic programming method is used to find a minimum-time path for each vessel from its initial position to its assigned region. This path plan includes the effects of water currents as well as avoidance of known obstacles. A fleet-level planning algorithm then shuffles the individual vessel assignments to find the overall solution which puts all vessels in their assigned regions in the minimum time. This shuffle algorithm may be described as a process of elimination on the sorted list of permutations of a cost matrix. All these path planning algorithms are facilitated by discretizing the region of interest onto a hexagonal tiling.
International Nuclear Information System (INIS)
Mak, C. H.
2009-01-01
A practical method to tackle the sign problem in real-time path integral simulations is proposed based on the multilevel blocking idea. The formulation is made possible by using a cumulant expansion of the action, which in addition to addressing the sign problem, provides an unbiased estimator for the action from a statistically noisy sample of real-time paths. The cumulant formulation also allows the analytical gradients of the action to be computed with little extra computational effort, and it can easily be implemented in a massively parallel environment.
Sci—Thur PM: Planning and Delivery — 06: Real-Time Interactive Treatment Planning
International Nuclear Information System (INIS)
Matthews, Q; Mestrovic, A; Otto, K
2014-01-01
Purpose: To describe and evaluate a novel system for generalized Real-Time Interactive Planning (RTIP) applied to head and neck (H and N) VMAT. Methods: The clinician interactively manipulates dose distributions using DVHs, isodoses, or rate of dose fall-off, which may be subjected to user-defined constraints. Dose is calculated using a fast Achievable Dose Estimate (ADE) algorithm, which simulates the limits of what can be achieved during treatment. After each manipulation contributing fluence elements are modified and the dose distribution updates in effectively real-time. For H and N VMAT planning, structure sets for 11 patients were imported into RTIP. Each dose distribution was interactively modified to minimize OAR dose while constraining target DVHs. The resulting RTIP DVHs were transferred to the Eclipse™ VMAT optimizer, and conventional VMAT optimization was performed. Results: Dose calculation and update times for the ADE algorithm ranged from 2.4 to 22.6 milliseconds, thus facilitating effectively real-time manipulation of dose distributions. For each of the 11 H and N VMAT cases, the RTIP process took ∼2–10 minutes. All RTIP plans exhibited acceptable PTV coverage, mean dose, and max dose. 10 of 11 RTIP plans achieved substantially improved sparing of one or more OARs without compromising dose to targets or other OARs. Importantly, 10 of the 11 RTIP plans required only one or two post-RTIP optimizations. Conclusions: RTIP is a novel system for manipulating and updating achievable dose distributions in real-time. H and N VMAT plans generated using RTIP demonstrate improved OAR sparing and planning efficiency. Disclosures: One author has a commercial interest in the presented materials
A timed-automata approach for critical path detection in a soft real-time application
Yildiz, Bugra Mehmet; Bockisch, Christoph; Rensink, Arend; Aksit, Mehmet
In this paper, we report preliminary ideas from our project called “Time Performance Improvement With Parallel Processing Systems‿ (TIPS). In the TIPS project, we plan to take advantage of multi-core platforms for performance improvement by parallelizing a complex soft real-time application. In
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...
Time-optimal path planning in uncertain flow fields using ensemble method
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.
Reasoning on the Self-Organizing Incremental Associative Memory for Online Robot Path Planning
Kawewong, Aram; Honda, Yutaro; Tsuboyama, Manabu; Hasegawa, Osamu
Robot path-planning is one of the important issues in robotic navigation. This paper presents a novel robot path-planning approach based on the associative memory using Self-Organizing Incremental Neural Networks (SOINN). By the proposed method, an environment is first autonomously divided into a set of path-fragments by junctions. Each fragment is represented by a sequence of preliminarily generated common patterns (CPs). In an online manner, a robot regards the current path as the associative path-fragments, each connected by junctions. The reasoning technique is additionally proposed for decision making at each junction to speed up the exploration time. Distinct from other methods, our method does not ignore the important information about the regions between junctions (path-fragments). The resultant number of path-fragments is also less than other method. Evaluation is done via Webots physical 3D-simulated and real robot experiments, where only distance sensors are available. Results show that our method can represent the environment effectively; it enables the robot to solve the goal-oriented navigation problem in only one episode, which is actually less than that necessary for most of the Reinforcement Learning (RL) based methods. The running time is proved finite and scales well with the environment. The resultant number of path-fragments matches well to the environment.
Fractional path planning and path tracking
International Nuclear Information System (INIS)
Melchior, P.; Jallouli-Khlif, R.; Metoui, B.
2011-01-01
This paper presents the main results of the application of fractional approach in path planning and path tracking. A new robust path planning design for mobile robot was studied in dynamic environment. The normalized attractive force applied to the robot is based on a fictitious fractional attractive potential. This method allows to obtain robust path planning despite robot mass variation. The danger level of each obstacles is characterized by the fractional order of the repulsive potential of the obstacles. Under these conditions, the robot dynamic behavior was studied by analyzing its X - Y path planning with dynamic target or dynamic obstacles. The case of simultaneously mobile obstacles and target is also considered. The influence of the robot mass variation is studied and the robustness analysis of the obtained path shows the robustness improvement due to the non integer order properties. Pre shaping approach is used to reduce system vibration in motion control. Desired systems inputs are altered so that the system finishes the requested move without residual vibration. This technique, developed by N.C. Singer and W.P.Seering, is used for flexible structure control, particularly in the aerospace field. In a previous work, this method was extended for explicit fractional derivative systems and applied to second generation CRONE control, the robustness was also studied. CRONE (the French acronym of C ommande Robuste d'Ordre Non Entier ) control system design is a frequency-domain based methodology using complex fractional integration.
Planning to cheat: EU fiscal policy in real time
Beetsma, R.; Giuliodori, M.; Wierts, P.
2009-01-01
Using real-time data from Europe's Stability and Convergence Programs, we explore how fiscal plans and their implementation in the EU are determined. We find that (1) implemented budgetary adjustment falls systematically short of planned adjustment and this shortfall increases with the projection
Survey of Robot 3D Path Planning Algorithms
Directory of Open Access Journals (Sweden)
Liang Yang
2016-01-01
Full Text Available Robot 3D (three-dimension path planning targets for finding an optimal and collision-free path in a 3D workspace while taking into account kinematic constraints (including geometric, physical, and temporal constraints. The purpose of path planning, unlike motion planning which must be taken into consideration of dynamics, is to find a kinematically optimal path with the least time as well as model the environment completely. We discuss the fundamentals of these most successful robot 3D path planning algorithms which have been developed in recent years and concentrate on universally applicable algorithms which can be implemented in aerial robots, ground robots, and underwater robots. This paper classifies all the methods into five categories based on their exploring mechanisms and proposes a category, called multifusion based algorithms. For all these algorithms, they are analyzed from a time efficiency and implementable area perspective. Furthermore a comprehensive applicable analysis for each kind of method is presented after considering their merits and weaknesses.
Real-time inverse planning for Gamma KnifeTM radiosurgery
International Nuclear Information System (INIS)
Wu, Q. Jackie; Chankong, Vira; Jitprapaikulsarn, Suradet; Wessels, Barry W.; Einstein, Douglas B.; Mathayomchan, Boonyanit; Kinsella, Timothy J.
2003-01-01
The challenges of real-time Gamma Knife TM inverse planning are the large number of variables involved and the unknown search space a priori. With limited collimator sizes, shots have to be heavily overlapped to form a smooth prescription isodose line that conforms to the irregular target shape. Such overlaps greatly influence the total number of shots per plan, making pre-determination of the total number of shots impractical. However, this total number of shots usually defines the search space, a pre-requisite for most of the optimization methods. Since each shot only covers part of the target, a collection of shots in different locations and various collimator sizes selected makes up the global dose distribution that conforms to the target. Hence, planning or placing these shots is a combinatorial optimization process that is computationally expensive by nature. We have previously developed a theory of shot placement and optimization based on skeletonization. The real-time inverse planning process, reported in this paper, is an expansion and the clinical implementation of this theory. The complete planning process consists of two steps. The first step is to determine an optimal number of shots including locations and sizes and to assign initial collimator size to each of the shots. The second step is to fine-tune the weights using a linear-programming technique. The objective function is to minimize the total dose to the target boundary (i.e., maximize the dose conformity). Results of an ellipsoid test target and ten clinical cases are presented. The clinical cases are also compared with physician's manual plans. The target coverage is more than 99% for manual plans and 97% for all the inverse plans. The RTOG PITV conformity indices for the manual plans are between 1.16 and 3.46, compared to 1.36 to 2.4 for the inverse plans. All the inverse plans are generated in less than 2 min, making real-time inverse planning a reality
The Boltzmann-Langevin Equation derived from the real-time path formalism
International Nuclear Information System (INIS)
Suraud, E.; Reinhard, P.G.
1991-01-01
We derive the Boltzmann-Langevin equation using Green's functions techniques in the real-time path formalism. We start from the Martin-Schwinger hierarchy and close it approximately at the two-body level. A careful discussion of the initial conditions for the free two-body Green's function provides the flexibility to recover the discarded correlations as fluctuations leading to the Langevin force. The derivation is generalized to the T-matrix approach which allows to prove that one can use the same effective interaction in the mean-field as well as in the collision term and Langevin force
An Efficient Energy Constraint Based UAV Path Planning for Search and Coverage
Gramajo, German; Shankar, Praveen
2017-01-01
A path planning strategy for a search and coverage mission for a small UAV that maximizes the area covered based on stored energy and maneuverability constraints is presented. The proposed formulation has a high level of autonomy, without requiring an exact choice of optimization parameters, and is appropriate for real-time implementation. The computed trajectory maximizes spatial coverage while closely satisfying terminal constraints on the position of the vehicle and minimizing the time of ...
Makri, Nancy
2014-10-07
The real-time path integral representation of the reduced density matrix for a discrete system in contact with a dissipative medium is rewritten in terms of the number of blips, i.e., elementary time intervals over which the forward and backward paths are not identical. For a given set of blips, it is shown that the path sum with respect to the coordinates of all remaining time points is isomorphic to that for the wavefunction of a system subject to an external driving term and thus can be summed by an inexpensive iterative procedure. This exact decomposition reduces the number of terms by a factor that increases exponentially with propagation time. Further, under conditions (moderately high temperature and/or dissipation strength) that lead primarily to incoherent dynamics, the "fully incoherent limit" zero-blip term of the series provides a reasonable approximation to the dynamics, and the blip series converges rapidly to the exact result. Retention of only the blips required for satisfactory convergence leads to speedup of full-memory path integral calculations by many orders of magnitude.
Ramos, A G; García-Garrido, V J; Mancho, A M; Wiggins, S; Coca, J; Glenn, S; Schofield, O; Kohut, J; Aragon, D; Kerfoot, J; Haskins, T; Miles, T; Haldeman, C; Strandskov, N; Allsup, B; Jones, C; Shapiro, J
2018-03-15
Transoceanic Gliders are Autonomous Underwater Vehicles (AUVs) for which there is a developing and expanding range of applications in open-seas research, technology and underwater clean transport. Mature glider autonomy, operating depth (0-1000 meters) and low energy consumption without a CO 2 footprint enable evolutionary access across ocean basins. Pursuant to the first successful transatlantic glider crossing in December 2009, the Challenger Mission has opened the door to long-term, long-distance routine transoceanic AUV missions. These vehicles, which glide through the water column between 0 and 1000 meters depth, are highly sensitive to the ocean current field. Consequently, it is essential to exploit the complex space-time structure of the ocean current field in order to plan a path that optimizes scientific payoff and navigation efficiency. This letter demonstrates the capability of dynamical system theory for achieving this goal by realizing the real-time navigation strategy for the transoceanic AUV named Silbo, which is a Slocum deep-glider (0-1000 m), that crossed the North Atlantic from April 2016 to March 2017. Path planning in real time based on this approach has facilitated an impressive speed up of the AUV to unprecedented velocities resulting in major battery savings on the mission, offering the potential for routine transoceanic long duration missions.
GPU-accelerated ray-tracing for real-time treatment planning
International Nuclear Information System (INIS)
Heinrich, H; Ziegenhein, P; Kamerling, C P; Oelfke, U; Froening, H
2014-01-01
Dose calculation methods in radiotherapy treatment planning require the radiological depth information of the voxels that represent the patient volume to correct for tissue inhomogeneities. This information is acquired by time consuming ray-tracing-based calculations. For treatment planning scenarios with changing geometries and real-time constraints this is a severe bottleneck. We implemented an algorithm for the graphics processing unit (GPU) which implements a ray-matrix approach to reduce the number of rays to trace. Furthermore, we investigated the impact of different strategies of accessing memory in kernel implementations as well as strategies for rapid data transfers between main memory and memory of the graphics device. Our study included the overlapping of computations and memory transfers to reduce the overall runtime using Hyper-Q. We tested our approach on a prostate case (9 beams, coplanar). The measured execution times for a complete ray-tracing range from 28 msec for the computations on the GPU to 99 msec when considering data transfers to and from the graphics device. Our GPU-based algorithm performed the ray-tracing in real-time. The strategies efficiently reduce the time consumption of memory accesses and data transfer overhead. The achieved runtimes demonstrate the viability of this approach and allow improved real-time performance for dose calculation methods in clinical routine.
Directory of Open Access Journals (Sweden)
Yogang Singh
2018-03-01
Full Text Available The growing need of ocean surveying and exploration for scientific and industrial application has led to the requirement of routing strategies for ocean vehicles which are optimal in nature. Most of the op-timal path planning for marine vehicles had been conducted offline in a self-made environment. This paper takes into account a practical marine environment, i.e. Portsmouth Harbour, for finding an optimal path in terms of computational time between source and end points on a real time map for an USV. The current study makes use of a grid map generated from original and uses a Dijkstra algorithm to find the shortest path for a single USV. In order to benchmark the study, a path planning study using a well-known local path planning method artificial path planning (APF has been conducted in a real time marine environment and effectiveness is measured in terms of path length and computational time.
Mission-directed path planning for planetary rover exploration
Tompkins, Paul
2005-07-01
Robotic rovers uniquely benefit planetary exploration---they enable regional exploration with the precision of in-situ measurements, a combination impossible from an orbiting spacecraft or fixed lander. Mission planning for planetary rover exploration currently utilizes sophisticated software for activity planning and scheduling, but simplified path planning and execution approaches tailored for localized operations to individual targets. This approach is insufficient for the investigation of multiple, regionally distributed targets in a single command cycle. Path planning tailored for this task must consider the impact of large scale terrain on power, speed and regional access; the effect of route timing on resource availability; the limitations of finite resource capacity and other operational constraints on vehicle range and timing; and the mutual influence between traverses and upstream and downstream stationary activities. Encapsulating this reasoning in an efficient autonomous planner would allow a rover to continue operating rationally despite significant deviations from an initial plan. This research presents mission-directed path planning that enables an autonomous, strategic reasoning capability for robotic explorers. Planning operates in a space of position, time and energy. Unlike previous hierarchical approaches, it treats these dimensions simultaneously to enable globally-optimal solutions. The approach calls on a near incremental search algorithm designed for planning and re-planning under global constraints, in spaces of higher than two dimensions. Solutions under this method specify routes that avoid terrain obstacles, optimize the collection and use of rechargable energy, satisfy local and global mission constraints, and account for the time and energy of interleaved mission activities. Furthermore, the approach efficiently re-plans in response to updates in vehicle state and world models, and is well suited to online operation aboard a robot
A New Method of Global Path Planning for AGV
Institute of Scientific and Technical Information of China (English)
SHI En-xiu; HUANG Yu-mei
2006-01-01
Path planning is important in the research of a mobile robot (MR). Methods for it have been used in different applications. An automated guided vehicle(AGV), which is a kind of MR, is used in a flexible manufacturing system(FMS). Path planning for it is essential to improve the efficiency of FMS. A new method was proposed with known obstacle space FMS in this paper. FMS is described by the Augmented Pos Matrix of a Machine (APMM) and Relative Pos Matrix of Machines (RPMM), which is smaller. The optimum path can be obtained according to the probability of the path and the maximal probability path. The suggested algorithm of path planning was good performance through simulation result: simplicity, saving time and reliability.
Flexible integration of path-planning capabilities
Stobie, Iain C.; Tambe, Milind; Rosenbloom, Paul S.
1993-05-01
Robots pursuing complex goals must plan paths according to several criteria of quality, including shortness, safety, speed and planning time. Many sources and kinds of knowledge, such as maps, procedures and perception, may be available or required. Both the quality criteria and sources of knowledge may vary widely over time, and in general they will interact. One approach to address this problem is to express all criteria and goals numerically in a single weighted graph, and then to search this graph to determine a path. Since this is problematic with symbolic or uncertain data and interacting criteria, we propose that what is needed instead is an integration of many kinds of planning capabilities. We describe a hybrid approach to integration, based on experiments with building simulated mobile robots using Soar, an integrated problem-solving and learning system. For flexibility, we have implemented a combination of internal planning, reactive capabilities and specialized tools. We illustrate how these components can complement each other's limitations and produce plans which integrate geometric and task knowledge.
Directory of Open Access Journals (Sweden)
Vahid Behravesh
2012-08-01
Full Text Available Presented article is studying the issue of path navigating for numerous robots. Our presented approach is based on both priority and the robust method for path finding in repetitive dynamic. Presented model can be generally implementable and useable: We do not assume any restriction regarding the quantity of levels of freedom for robots, and robots of diverse kinds can be applied at the same time. We proposed a random method and hill-climbing technique in the area based on precedence plans, which is used to determine a solution to a given trajectory planning problem and to make less the extent of total track. Our method plans trajectories for particular robots in the setting-time scope. Therefore, in order to specifying the interval of constant objects similar to other robots and the extent of the tracks which is traversed. For measuring the hazard for robots to conflict with each other it applied a method based on probability of the movements of robots. This algorithm applied to real robots with successful results. The proposed method performed and judged on both real robots and in simulation. We performed sequence of100tests with 8 robots for comparing with coordination method and current performances are effective. However, maximizing the performance is still possible. These performances estimations performed on Windows operating system and 3GHz Intel Pentium IV with and compiles with GCC 3.4. We used our PCGA robot for all experiments. For a large environment of 19×15m2where we accomplished 40tests, our model is competent to plan high-quality paths in a severely short time (less than a second. Moreover, this article utilized lookup tables to keep expenses the formerly navigated robots made, increasing the number of robots don’t expand computation time.
Cooperative path planning of unmanned aerial vehicles
Tsourdos, Antonios; Shanmugavel, Madhavan
2010-01-01
An invaluable addition to the literature on UAV guidance and cooperative control, Cooperative Path Planning of Unmanned Aerial Vehicles is a dedicated, practical guide to computational path planning for UAVs. One of the key issues facing future development of UAVs is path planning: it is vital that swarm UAVs/ MAVs can cooperate together in a coordinated manner, obeying a pre-planned course but able to react to their environment by communicating and cooperating. An optimized path is necessary in order to ensure a UAV completes its mission efficiently, safely, and successfully. Focussing on the path planning of multiple UAVs for simultaneous arrival on target, Cooperative Path Planning of Unmanned Aerial Vehicles also offers coverage of path planners that are applicable to land, sea, or space-borne vehicles. Cooperative Path Planning of Unmanned Aerial Vehicles is authored by leading researchers from Cranfield University and provides an authoritative resource for researchers, academics and engineers working in...
Hu, Xuemin; Chen, Long; Tang, Bo; Cao, Dongpu; He, Haibo
2018-02-01
This paper presents a real-time dynamic path planning method for autonomous driving that avoids both static and moving obstacles. The proposed path planning method determines not only an optimal path, but also the appropriate acceleration and speed for a vehicle. In this method, we first construct a center line from a set of predefined waypoints, which are usually obtained from a lane-level map. A series of path candidates are generated by the arc length and offset to the center line in the s - ρ coordinate system. Then, all of these candidates are converted into Cartesian coordinates. The optimal path is selected considering the total cost of static safety, comfortability, and dynamic safety; meanwhile, the appropriate acceleration and speed for the optimal path are also identified. Various types of roads, including single-lane roads and multi-lane roads with static and moving obstacles, are designed to test the proposed method. The simulation results demonstrate the effectiveness of the proposed method, and indicate its wide practical application to autonomous driving.
Strategic Team AI Path Plans: Probabilistic Pathfinding
Directory of Open Access Journals (Sweden)
Tng C. H. John
2008-01-01
Full Text Available This paper proposes a novel method to generate strategic team AI pathfinding plans for computer games and simulations using probabilistic pathfinding. This method is inspired by genetic algorithms (Russell and Norvig, 2002, in that, a fitness function is used to test the quality of the path plans. The method generates high-quality path plans by eliminating the low-quality ones. The path plans are generated by probabilistic pathfinding, and the elimination is done by a fitness test of the path plans. This path plan generation method has the ability to generate variation or different high-quality paths, which is desired for games to increase replay values. This work is an extension of our earlier work on team AI: probabilistic pathfinding (John et al., 2006. We explore ways to combine probabilistic pathfinding and genetic algorithm to create a new method to generate strategic team AI pathfinding plans.
The Robot Path Planning Based on Improved Artificial Fish Swarm Algorithm
Directory of Open Access Journals (Sweden)
Yi Zhang
2016-01-01
Full Text Available Path planning is critical to the efficiency and fidelity of robot navigation. The solution of robot path planning is to seek a collision-free and the shortest path from the start node to target node. In this paper, we propose a new improved artificial fish swarm algorithm (IAFSA to process the mobile robot path planning problem in a real environment. In IAFSA, an attenuation function is introduced to improve the visual of standard AFSA and get the balance of global search and local search; also, an adaptive operator is introduced to enhance the adaptive ability of step. Besides, a concept of inertia weight factor is proposed in IAFSA inspired by PSO intelligence algorithm to improve the convergence rate and accuracy of IAFSA. Five unconstrained optimization test functions are given to illustrate the strong searching ability and ideal convergence of IAFSA. Finally, the ROS (robot operation system based experiment is carried out on a Pioneer 3-DX mobile robot; the experiment results also show the superiority of IAFSA.
Walking path-planning method for multiple radiation areas
International Nuclear Information System (INIS)
Liu, Yong-kuo; Li, Meng-kun; Peng, Min-jun; Xie, Chun-li; Yuan, Cheng-qian; Wang, Shuang-yu; Chao, Nan
2016-01-01
Highlights: • Radiation environment modeling method is designed. • Path-evaluating method and segmented path-planning method are proposed. • Path-planning simulation platform for radiation environment is built. • The method avoids to be misled by minimum dose path in single area. - Abstract: Based on minimum dose path-searching method, walking path-planning method for multiple radiation areas was designed to solve minimum dose path problem in single area and find minimum dose path in the whole space in this paper. Path-planning simulation platform was built using C# programming language and DirectX engine. The simulation platform was used in simulations dealing with virtual nuclear facilities. Simulation results indicated that the walking-path planning method is effective in providing safety for people walking in nuclear facilities.
Real time uncertainty in fiscal planning and debt accumulation in the euro area
Paloviita, Maritta
2012-01-01
This study explores real time uncertainty in euro area fiscal policies since the late 1990s. Using real time data from the OECD Economic Outlook publications we investigate the impact of real time uncertainty on fiscal planning and debt accumulation separately for two country groups in the euro area: countries in geographical periphery (Greece, Ireland, Italy, Portugal and Spain) and other euro area countries (Austria, Belgium, Finland, France, Germany and the Netherlands). The results indica...
Integrated flight path planning system and flight control system for unmanned helicopters.
Jan, Shau Shiun; Lin, Yu Hsiang
2011-01-01
This paper focuses on the design of an integrated navigation and guidance system for unmanned helicopters. The integrated navigation system comprises two systems: the Flight Path Planning System (FPPS) and the Flight Control System (FCS). The FPPS finds the shortest flight path by the A-Star (A*) algorithm in an adaptive manner for different flight conditions, and the FPPS can add a forbidden zone to stop the unmanned helicopter from crossing over into dangerous areas. In this paper, the FPPS computation time is reduced by the multi-resolution scheme, and the flight path quality is improved by the path smoothing methods. Meanwhile, the FCS includes the fuzzy inference systems (FISs) based on the fuzzy logic. By using expert knowledge and experience to train the FIS, the controller can operate the unmanned helicopter without dynamic models. The integrated system of the FPPS and the FCS is aimed at providing navigation and guidance to the mission destination and it is implemented by coupling the flight simulation software, X-Plane, and the computing software, MATLAB. Simulations are performed and shown in real time three-dimensional animations. Finally, the integrated system is demonstrated to work successfully in controlling the unmanned helicopter to operate in various terrains of a digital elevation model (DEM).
Integrated Flight Path Planning System and Flight Control System for Unmanned Helicopters
Jan, Shau Shiun; Lin, Yu Hsiang
2011-01-01
This paper focuses on the design of an integrated navigation and guidance system for unmanned helicopters. The integrated navigation system comprises two systems: the Flight Path Planning System (FPPS) and the Flight Control System (FCS). The FPPS finds the shortest flight path by the A-Star (A*) algorithm in an adaptive manner for different flight conditions, and the FPPS can add a forbidden zone to stop the unmanned helicopter from crossing over into dangerous areas. In this paper, the FPPS computation time is reduced by the multi-resolution scheme, and the flight path quality is improved by the path smoothing methods. Meanwhile, the FCS includes the fuzzy inference systems (FISs) based on the fuzzy logic. By using expert knowledge and experience to train the FIS, the controller can operate the unmanned helicopter without dynamic models. The integrated system of the FPPS and the FCS is aimed at providing navigation and guidance to the mission destination and it is implemented by coupling the flight simulation software, X-Plane, and the computing software, MATLAB. Simulations are performed and shown in real time three-dimensional animations. Finally, the integrated system is demonstrated to work successfully in controlling the unmanned helicopter to operate in various terrains of a digital elevation model (DEM). PMID:22164029
Reliability modeling of a hard real-time system using the path-space approach
International Nuclear Information System (INIS)
Kim, Hagbae
2000-01-01
A hard real-time system, such as a fly-by-wire system, fails catastrophically (e.g. losing stability) if its control inputs are not updated by its digital controller computer within a certain timing constraint called the hard deadline. To assess and validate those systems' reliabilities by using a semi-Markov model that explicitly contains the deadline information, we propose a path-space approach deriving the upper and lower bounds of the probability of system failure. These bounds are derived by using only simple parameters, and they are especially suitable for highly reliable systems which should recover quickly. Analytical bounds are derived for both exponential and Wobble failure distributions encountered commonly, which have proven effective through numerical examples, while considering three repair strategies: repair-as-good-as-new, repair-as-good-as-old, and repair-better-than-old
Energy Technology Data Exchange (ETDEWEB)
Vandewouw, Marlee M., E-mail: marleev@mie.utoronto.ca; Aleman, Dionne M. [Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Ontario M5S 3G8 (Canada); Jaffray, David A. [Radiation Medicine Program, Princess Margaret Cancer Centre, Toronto, Ontario M5G 2M9 (Canada)
2016-08-15
Purpose: Continuous dose delivery in radiation therapy treatments has been shown to decrease total treatment time while improving the dose conformity and distribution homogeneity over the conventional step-and-shoot approach. The authors develop an inverse treatment planning method for Gamma Knife® Perfexion™ that continuously delivers dose along a path in the target. Methods: The authors’ method is comprised of two steps: find a path within the target, then solve a mixed integer optimization model to find the optimal collimator configurations and durations along the selected path. Robotic path-finding techniques, specifically, simultaneous localization and mapping (SLAM) using an extended Kalman filter, are used to obtain a path that travels sufficiently close to selected isocentre locations. SLAM is novelly extended to explore a 3D, discrete environment, which is the target discretized into voxels. Further novel extensions are incorporated into the steering mechanism to account for target geometry. Results: The SLAM method was tested on seven clinical cases and compared to clinical, Hamiltonian path continuous delivery, and inverse step-and-shoot treatment plans. The SLAM approach improved dose metrics compared to the clinical plans and Hamiltonian path continuous delivery plans. Beam-on times improved over clinical plans, and had mixed performance compared to Hamiltonian path continuous plans. The SLAM method is also shown to be robust to path selection inaccuracies, isocentre selection, and dose distribution. Conclusions: The SLAM method for continuous delivery provides decreased total treatment time and increased treatment quality compared to both clinical and inverse step-and-shoot plans, and outperforms existing path methods in treatment quality. It also accounts for uncertainty in treatment planning by accommodating inaccuracies.
International Nuclear Information System (INIS)
Vandewouw, Marlee M.; Aleman, Dionne M.; Jaffray, David A.
2016-01-01
Purpose: Continuous dose delivery in radiation therapy treatments has been shown to decrease total treatment time while improving the dose conformity and distribution homogeneity over the conventional step-and-shoot approach. The authors develop an inverse treatment planning method for Gamma Knife® Perfexion™ that continuously delivers dose along a path in the target. Methods: The authors’ method is comprised of two steps: find a path within the target, then solve a mixed integer optimization model to find the optimal collimator configurations and durations along the selected path. Robotic path-finding techniques, specifically, simultaneous localization and mapping (SLAM) using an extended Kalman filter, are used to obtain a path that travels sufficiently close to selected isocentre locations. SLAM is novelly extended to explore a 3D, discrete environment, which is the target discretized into voxels. Further novel extensions are incorporated into the steering mechanism to account for target geometry. Results: The SLAM method was tested on seven clinical cases and compared to clinical, Hamiltonian path continuous delivery, and inverse step-and-shoot treatment plans. The SLAM approach improved dose metrics compared to the clinical plans and Hamiltonian path continuous delivery plans. Beam-on times improved over clinical plans, and had mixed performance compared to Hamiltonian path continuous plans. The SLAM method is also shown to be robust to path selection inaccuracies, isocentre selection, and dose distribution. Conclusions: The SLAM method for continuous delivery provides decreased total treatment time and increased treatment quality compared to both clinical and inverse step-and-shoot plans, and outperforms existing path methods in treatment quality. It also accounts for uncertainty in treatment planning by accommodating inaccuracies.
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.
Aircraft path planning for optimal imaging using dynamic cost functions
Christie, Gordon; Chaudhry, Haseeb; Kochersberger, Kevin
2015-05-01
Unmanned aircraft development has accelerated with recent technological improvements in sensing and communications, which has resulted in an "applications lag" for how these aircraft can best be utilized. The aircraft are becoming smaller, more maneuverable and have longer endurance to perform sensing and sampling missions, but operating them aggressively to exploit these capabilities has not been a primary focus in unmanned systems development. This paper addresses a means of aerial vehicle path planning to provide a realistic optimal path in acquiring imagery for structure from motion (SfM) reconstructions and performing radiation surveys. This method will allow SfM reconstructions to occur accurately and with minimal flight time so that the reconstructions can be executed efficiently. An assumption is made that we have 3D point cloud data available prior to the flight. A discrete set of scan lines are proposed for the given area that are scored based on visibility of the scene. Our approach finds a time-efficient path and calculates trajectories between scan lines and over obstacles encountered along those scan lines. Aircraft dynamics are incorporated into the path planning algorithm as dynamic cost functions to create optimal imaging paths in minimum time. Simulations of the path planning algorithm are shown for an urban environment. We also present our approach for image-based terrain mapping, which is able to efficiently perform a 3D reconstruction of a large area without the use of GPS data.
Directory of Open Access Journals (Sweden)
Hao-Ting Lin
2017-06-01
Full Text Available This project aims to develop a novel large stroke asymmetric pneumatic servo system of a hardware-in-the-loop for path tracking control under variable loads based on the MATLAB Simulink real-time system. High pressure compressed air provided by the air compressor is utilized for the pneumatic proportional servo valve to drive the large stroke asymmetric rod-less pneumatic actuator. Due to the pressure differences between two chambers, the pneumatic actuator will operate. The highly nonlinear mathematical models of the large stroke asymmetric pneumatic system were analyzed and developed. The functional approximation technique based on the sliding mode controller (FASC is developed as a controller to solve the uncertain time-varying nonlinear system. The MATLAB Simulink real-time system was a main control unit of a hardware-in-the-loop system proposed to establish driver blocks for analog and digital I/O, a linear encoder, a CPU and a large stroke asymmetric pneumatic rod-less system. By the position sensor, the position signals of the cylinder will be measured immediately. The measured signals will be viewed as the feedback signals of the pneumatic servo system for the study of real-time positioning control and path tracking control. Finally, real-time control of a large stroke asymmetric pneumatic servo system with measuring system, a large stroke asymmetric pneumatic servo system, data acquisition system and the control strategy software will be implemented. Thus, upgrading the high position precision and the trajectory tracking performance of the large stroke asymmetric pneumatic servo system will be realized to promote the high position precision and path tracking capability. Experimental results show that fifth order paths in various strokes and the sine wave path are successfully implemented in the test rig. Also, results of variable loads under the different angle were implemented experimentally.
Lin, Hao-Ting
2017-06-04
This project aims to develop a novel large stroke asymmetric pneumatic servo system of a hardware-in-the-loop for path tracking control under variable loads based on the MATLAB Simulink real-time system. High pressure compressed air provided by the air compressor is utilized for the pneumatic proportional servo valve to drive the large stroke asymmetric rod-less pneumatic actuator. Due to the pressure differences between two chambers, the pneumatic actuator will operate. The highly nonlinear mathematical models of the large stroke asymmetric pneumatic system were analyzed and developed. The functional approximation technique based on the sliding mode controller (FASC) is developed as a controller to solve the uncertain time-varying nonlinear system. The MATLAB Simulink real-time system was a main control unit of a hardware-in-the-loop system proposed to establish driver blocks for analog and digital I/O, a linear encoder, a CPU and a large stroke asymmetric pneumatic rod-less system. By the position sensor, the position signals of the cylinder will be measured immediately. The measured signals will be viewed as the feedback signals of the pneumatic servo system for the study of real-time positioning control and path tracking control. Finally, real-time control of a large stroke asymmetric pneumatic servo system with measuring system, a large stroke asymmetric pneumatic servo system, data acquisition system and the control strategy software will be implemented. Thus, upgrading the high position precision and the trajectory tracking performance of the large stroke asymmetric pneumatic servo system will be realized to promote the high position precision and path tracking capability. Experimental results show that fifth order paths in various strokes and the sine wave path are successfully implemented in the test rig. Also, results of variable loads under the different angle were implemented experimentally.
In vivo real-time rectal wall dosimetry for prostate radiotherapy
International Nuclear Information System (INIS)
Hardcastle, Nicholas; Cutajar, Dean L; Metcalfe, Peter E; Lerch, Michael L F; Tome, Wolfgang A; Rosenfeld, Anatoly B; Perevertaylo, Vladimir L
2010-01-01
Rectal balloons are used in external beam prostate radiotherapy to provide reproducible anatomy and rectal dose reductions. This is an investigation into the combination of a MOSFET radiation detector with a rectal balloon for real-time in vivo rectal wall dosimetry. The MOSFET used in the study is a radiation detector that provides a water equivalent depth of measurement of 70 μm. Two MOSFETs were combined in a face-to-face orientation. The reproducibility, sensitivity and angular dependence were measured for the dual MOSFET in a 6 MV photon beam. The dual MOSFET was combined with a rectal balloon and irradiated with hypothetical prostate treatments in a phantom. The anterior rectal wall dose was measured in real time and compared with the planning system calculated dose. The dual MOSFET showed angular dependence within ±2.5% in the azimuth and +2.5%/-4% in the polar axes. When compared with an ion chamber measurement in a phantom, the dual MOSFET agreed within 2.5% for a range of radiation path lengths and incident angles. The dual MOSFET had reproducible sensitivity for fraction sizes of 2-10 Gy. For the hypothetical prostate treatments the measured anterior rectal wall dose was 2.6 and 3.2% lower than the calculated dose for 3DCRT and IMRT plans. This was expected due to limitations of the dose calculation method used at the balloon cavity interface. A dual MOSFET combined with a commercial rectal balloon was shown to provide reproducible measurements of the anterior rectal wall dose in real time. The measured anterior rectal wall dose agreed with the expected dose from the treatment plan for 3DCRT and IMRT plans. The dual MOSFET could be read out in real time during the irradiation, providing the capability for real-time dose monitoring of the rectal wall dose during treatment.
Double path-integral migration velocity analysis: a real data example
International Nuclear Information System (INIS)
Costa, Jessé C; Schleicher, Jörg
2011-01-01
Path-integral imaging forms an image with no knowledge of the velocity model by summing over the migrated images obtained for a set of migration velocity models. Double path-integral imaging migration extracts the stationary velocities, i.e. those velocities at which common-image gathers align horizontally, as a byproduct. An application of the technique to a real data set demonstrates that quantitative information about the time migration velocity model can be determined by double path-integral migration velocity analysis. Migrated images using interpolations with different regularizations of the extracted velocities prove the high quality of the resulting time-migration velocity information. The so-obtained velocity model can then be used as a starting model for subsequent velocity analysis tools like migration tomography or other tomographic methods
Directory of Open Access Journals (Sweden)
Domokos Kiss
2017-01-01
Full Text Available In this paper we introduce a novel method for obtaining good quality paths for autonomous road vehicles (e.g., cars or buses in narrow environments. There are many traffic situations in urban scenarios where nontrivial maneuvering in narrow places is necessary. Navigating in cluttered parking lots or having to avoid obstacles blocking the way and finding a detour even in narrow streets are challenging, especially if the vehicle has large dimensions like a bus. We present a combined approximation-based approach to solve the path planning problem in such situations. Our approach consists of a global planner which generates a preliminary path consisting of straight and turning-in-place primitives and a local planner which is used to make the preliminary path feasible to car-like vehicles. The approximation methodology is well known in the literature; however, both components proposed in this paper differ from existing similar planning methods. The approximation process with the proposed local planner is proven to be convergent for any preliminary global paths. The resulting path has continuous curvature which renders our method well suited for application on real vehicles. Simulation experiments show that the proposed method outperforms similar approaches in terms of path quality in complicated planning tasks.
International Nuclear Information System (INIS)
Zelefsky, Michael J.; Yamada, Yoshiya; Cohen, Gil'ad N.; Sharma, Neha; Shippy, Alison M.; Fridman, David; Zaider, Marco
2007-01-01
Purpose: To report the dosimetric outcome of patients with clinically localized prostate cancer treated with I-125 permanent implantation using an intraoperative real-time conformal planning technique. Methods and materials: Five hundred and sixty-two patients with prostate cancer were treated with I-125 permanent interstitial implantation using a transrectal ultrasound-guided approach. Real-time intraoperative treatment planning software that incorporates inverse planning optimization was used. Dose-volume constraints for this inverse-planning system included: prostate V100 ≥95%, maximal urethral dose ≤120%, and average rectal dose 3 of the rectum was exposed to the prescription dose, the incidence of late grade 2 toxicity rectal toxicity was 9% compared to 4% for smaller volumes of the rectum exposed to similar doses (p = 0.003). No dosimetric parameter in these patients with tight dose confines for the urethra influenced acute or late urinary toxicity. Conclusion: Real-time intraoperative planning was associated with a 90% consistency of achieving the planned intraoperative dose constraints for target coverage and maintaining planned urethral and rectal constraints in a high percentage of implants. Rectal volumes of ≥2.5 cm 3 exposed to the prescription doses were associated with an increased incidence of grade 2 rectal bleeding. Further enhancements in imaging guidance for optimal seed deposition are needed to guarantee optimal dose distribution for all patients. Whether such improvements lead to further reduction in acute and late morbidities associated with therapy requires further study
Real-Time Motion Planning and Safe Navigation in Dynamic Multi-Robot Environments
National Research Council Canada - National Science Library
Bruce, James R
2006-01-01
.... While motion planning has been used for high level robot navigation, or limited to semi-static or single-robot domains, it has often been dismissed for the real-time low-level control of agents due...
Sensor-Oriented Path Planning for Multiregion Surveillance with a Single Lightweight UAV SAR
Li, Jincheng; Chen, Jie; Wang, Pengbo; Li, Chunsheng
2018-01-01
In the surveillance of interested regions by unmanned aerial vehicle (UAV), system performance relies greatly on the motion control strategy of the UAV and the operation characteristics of the onboard sensors. This paper investigates the 2D path planning problem for the lightweight UAV synthetic aperture radar (SAR) system in an environment of multiple regions of interest (ROIs), the sizes of which are comparable to the radar swath width. Taking into account the special requirements of the SAR system on the motion of the platform, we model path planning for UAV SAR as a constrained multiobjective optimization problem (MOP). Based on the fact that the UAV route can be designed in the map image, an image-based path planner is proposed in this paper. First, the neighboring ROIs are merged by the morphological operation. Then, the parts of routes for data collection of the ROIs can be located according to the geometric features of the ROIs and the observation geometry of UAV SAR. Lastly, the route segments for ROIs surveillance are connected by a path planning algorithm named the sampling-based sparse A* search (SSAS) algorithm. Simulation experiments in real scenarios demonstrate that the proposed sensor-oriented path planner can improve the reconnaissance performance of lightweight UAV SAR greatly compared with the conventional zigzag path planner. PMID:29439447
Sensor-Oriented Path Planning for Multiregion Surveillance with a Single Lightweight UAV SAR.
Li, Jincheng; Chen, Jie; Wang, Pengbo; Li, Chunsheng
2018-02-11
In the surveillance of interested regions by unmanned aerial vehicle (UAV), system performance relies greatly on the motion control strategy of the UAV and the operation characteristics of the onboard sensors. This paper investigates the 2D path planning problem for the lightweight UAV synthetic aperture radar (SAR) system in an environment of multiple regions of interest (ROIs), the sizes of which are comparable to the radar swath width. Taking into account the special requirements of the SAR system on the motion of the platform, we model path planning for UAV SAR as a constrained multiobjective optimization problem (MOP). Based on the fact that the UAV route can be designed in the map image, an image-based path planner is proposed in this paper. First, the neighboring ROIs are merged by the morphological operation. Then, the parts of routes for data collection of the ROIs can be located according to the geometric features of the ROIs and the observation geometry of UAV SAR. Lastly, the route segments for ROIs surveillance are connected by a path planning algorithm named the sampling-based sparse A* search (SSAS) algorithm. Simulation experiments in real scenarios demonstrate that the proposed sensor-oriented path planner can improve the reconnaissance performance of lightweight UAV SAR greatly compared with the conventional zigzag path planner.
Hierarchical path planning and control of a small fixed-wing UAV: Theory and experimental validation
Jung, Dongwon
2007-12-01
problem is formulated by setting up geometric linear constraints as well as boundary conditions. Subsequently, we construct B-spline path templates by solving a set of distinct optimization problems. For application in UAV motion planning, the path templates are incorporated to replace parts of the entire path by the smooth B-spline paths. Each path segment is stitched together while preserving continuity to obtain a final smooth reference path to be used for path following control. The path following control for a small fixed-wing UAV to track the prescribed smooth reference path is also addressed. Assuming the UAV is equipped with an autopilot for low level control, we adopt a kinematic error model with respect to the moving Serret-Frenet frame attached to a path for tracking controller design. A kinematic path following control law that commands heading rate is presented. Backstepping is applied to derive the roll angle command by taking into account the approximate closed-loop roll dynamics. A parameter adaptation technique is employed to account for the inaccurate time constant of the closed-loop roll dynamics during actual implementation. Finally, we implement the proposed hierarchical path control of a small UAV on the actual hardware platform, which is based on an 1/5 scale R/C model airframe (Decathlon) and the autopilot hardware and software. Based on the hardware-in-the-loop (HIL) simulation environment, the proposed hierarchical path control algorithm has been validated through on-line, real-time implementation on a small micro-controller. By a seamless integration of the control algorithms for path planning, path smoothing, and path following, it has been demonstrated that the UAV equipped with a small autopilot having limited computational resources manages to accomplish the path control objective to reach the goal while avoiding obstacles with minimal human intervention.
Interactive multi-objective path planning through a palette-based user interface
Shaikh, Meher T.; Goodrich, Michael A.; Yi, Daqing; Hoehne, Joseph
2016-05-01
n a problem where a human uses supervisory control to manage robot path-planning, there are times when human does the path planning, and if satisfied commits those paths to be executed by the robot, and the robot executes that plan. In planning a path, the robot often uses an optimization algorithm that maximizes or minimizes an objective. When a human is assigned the task of path planning for robot, the human may care about multiple objectives. This work proposes a graphical user interface (GUI) designed for interactive robot path-planning when an operator may prefer one objective over others or care about how multiple objectives are traded off. The GUI represents multiple objectives using the metaphor of an artist's palette. A distinct color is used to represent each objective, and tradeoffs among objectives are balanced in a manner that an artist mixes colors to get the desired shade of color. Thus, human intent is analogous to the artist's shade of color. We call the GUI an "Adverb Palette" where the word "Adverb" represents a specific type of objective for the path, such as the adverbs "quickly" and "safely" in the commands: "travel the path quickly", "make the journey safely". The novel interactive interface provides the user an opportunity to evaluate various alternatives (that tradeoff between different objectives) by allowing her to visualize the instantaneous outcomes that result from her actions on the interface. In addition to assisting analysis of various solutions given by an optimization algorithm, the palette has additional feature of allowing the user to define and visualize her own paths, by means of waypoints (guiding locations) thereby spanning variety for planning. The goal of the Adverb Palette is thus to provide a way for the user and robot to find an acceptable solution even though they use very different representations of the problem. Subjective evaluations suggest that even non-experts in robotics can carry out the planning tasks with a
Multiagent path-finding in strategic games
Mihevc, Simon
2014-01-01
In this thesis I worked on creating, comparing and improving algorithms for multi-agent path planning on a domain typical for real-time strategy games. I implemented and compared Multiagent pathfinding using clearance and Multiagent pathfinding using independence detection and operator decomposition. I discovered that they had problems maintaining group compactness and took too long to calculate the path. I considerably improved the efficiency of both algorithms.
International Nuclear Information System (INIS)
Poulin, Eric; Gardi, Lori; Fenster, Aaron; Pouliot, Jean; Beaulieu, Luc
2015-01-01
Two different end-to-end procedures were tested for real-time planning in breast HDR brachytherapy treatment. Both methods are using a 3D ultrasound (3DUS) system and a freehand catheter optimization algorithm. They were found fast and efficient. We demonstrated a proof-of-concept approach for personalized real-time guidance and planning to breast HDR brachytherapy treatments
Employing Multiple Unmanned Aerial Vehicles for Co-Operative Path Planning
Directory of Open Access Journals (Sweden)
Durdana Habib
2013-05-01
Full Text Available Abstract In this paper, we work to develop a path planning solution for a group of Unmanned Aerial Vehicles (UAVs using a Mixed Integer Linear Programming (MILP approach. Co-operation among team members not only helps reduce mission time, it makes the execution more robust in dynamic environments. However, the problem becomes more challenging as it requires optimal resource allocation and is NP-hard. Since UAVs may be lost or may suffer significant damage during the course of the mission, plans may need to be modified in real-time as the mission proceeds. Therefore, multiple UAVs have a better chance of completing a mission in the face of failures. Such military operations can be treated as a variant of the Multiple Depot Vehicle Routing Problem (MDVRP. The proposed solution must be such that m UAVs start from multiple source locations to visit n targets and return to a set of destination locations such that (1 each target is visited exactly by one of the chosen UAVs (2 the total distance travelled by the group is minimized and (3 the number of targets that each UAV visits may not be less than K or greater than L.
International Nuclear Information System (INIS)
Wu Guoping; Zou Dongfang; Sun Jian; Dong Weihua
2007-01-01
Objective: To determine the clinical value of real time interventional ultrasound guidance in family planning reproduction operation. Methods: Under the guidance of ultrasound monitoring, 522 cases with high risk and difficult uterine operation were undertaken in our department. Results: The abdominal endoscopic contraceptive uterine operation under real time ultrasound monitoring was carried out for 522 cases in 4 years, with successful rates for high risk pregnancy as 287/289 cases, high risk troublesome withdrawal of contraceptive ring as 129/130 cases and puzzling uterine operation as 103/103 cases. The total successful rate reached 99.42%, without uterine rupture and other complications. Conclusion: The former complex, blind and difficult uterine operations turn to be simple, safe and reliable under the guidance of real time ultrasound. (authors)
Curvature-Continuous 3D Path-Planning Using QPMI Method
Directory of Open Access Journals (Sweden)
Seong-Ryong Chang
2015-06-01
Full Text Available It is impossible to achieve vertex movement and rapid velocity control in aerial robots and aerial vehicles because of momentum from the air. A continuous-curvature path ensures such robots and vehicles can fly with stable and continuous movements. General continuous path-planning methods use spline interpolation, for example B-spline and Bézier curves. However, these methods cannot be directly applied to continuous path planning in a 3D space. These methods use a subset of the waypoints to decide curvature and some waypoints are not included in the planned path. This paper proposes a method for constructing a curvature-continuous path in 3D space that includes every waypoint. The movements in each axis, x, y and z, are separated by the parameter u. Waypoint groups are formed, each with its own continuous path derived using quadratic polynomial interpolation. The membership function then combines each continuous path into one continuous path. The continuity of the path is verified and the curvature-continuous path is produced using the proposed method.
Wei, Kun; Ren, Bingyin
2018-02-13
In a future intelligent factory, a robotic manipulator must work efficiently and safely in a Human-Robot collaborative and dynamic unstructured environment. Autonomous path planning is the most important issue which must be resolved first in the process of improving robotic manipulator intelligence. Among the path-planning methods, the Rapidly Exploring Random Tree (RRT) algorithm based on random sampling has been widely applied in dynamic path planning for a high-dimensional robotic manipulator, especially in a complex environment because of its probability completeness, perfect expansion, and fast exploring speed over other planning methods. However, the existing RRT algorithm has a limitation in path planning for a robotic manipulator in a dynamic unstructured environment. Therefore, an autonomous obstacle avoidance dynamic path-planning method for a robotic manipulator based on an improved RRT algorithm, called Smoothly RRT (S-RRT), is proposed. This method that targets a directional node extends and can increase the sampling speed and efficiency of RRT dramatically. A path optimization strategy based on the maximum curvature constraint is presented to generate a smooth and curved continuous executable path for a robotic manipulator. Finally, the correctness, effectiveness, and practicability of the proposed method are demonstrated and validated via a MATLAB static simulation and a Robot Operating System (ROS) dynamic simulation environment as well as a real autonomous obstacle avoidance experiment in a dynamic unstructured environment for a robotic manipulator. The proposed method not only provides great practical engineering significance for a robotic manipulator's obstacle avoidance in an intelligent factory, but also theoretical reference value for other type of robots' path planning.
System Design and Implementation of Intelligent Fire Engine Path Planning based on SAT Algorithm
Institute of Scientific and Technical Information of China (English)
CAI Li-sha[1; ZENG Wei-peng[1; HAN Bao-ru[1
2016-01-01
In this paper, in order to make intelligent fi re car complete autonomy path planning in simulation map. Proposed system design of intelligent fi re car path planning based on SAT. The system includes a planning module, a communication module, a control module. Control module via the communication module upload the initial state and the goal state to planning module. Planning module solve this planning solution,and then download planning solution to control module, control the movement of the car fi re. Experiments show this the system is tracking short time, higher planning effi ciency.
Analysis of construction dynamic plan using fuzzy critical path method
Directory of Open Access Journals (Sweden)
Kurij Kazimir V.
2014-01-01
Full Text Available Critical Path Method (CPM technique has become widely recognized as valuable tool for the planning and scheduling large construction projects. The aim of this paper is to present an analytical method for finding the Critical Path in the precedence network diagram where the duration of each activity is represented by a trapezoidal fuzzy number. This Fuzzy Critical Path Method (FCPM uses a defuzzification formula for trapezoidal fuzzy number and applies it on the total float (slack time for each activity in the fuzzy precedence network to find the critical path. The method presented in this paper is very effective in determining the critical activities and finding the critical paths.
Path planning algorithms for assembly sequence planning. [in robot kinematics
Krishnan, S. S.; Sanderson, Arthur C.
1991-01-01
Planning for manipulation in complex environments often requires reasoning about the geometric and mechanical constraints which are posed by the task. In planning assembly operations, the automatic generation of operations sequences depends on the geometric feasibility of paths which permit parts to be joined into subassemblies. Feasible locations and collision-free paths must be present for part motions, robot and grasping motions, and fixtures. This paper describes an approach to reasoning about the feasibility of straight-line paths among three-dimensional polyhedral parts using an algebra of polyhedral cones. A second method recasts the feasibility conditions as constraints in a nonlinear optimization framework. Both algorithms have been implemented and results are presented.
Construction of Time-Stamped Mobility Map for Path Tracking via Smith-Waterman Measurement Matching
Directory of Open Access Journals (Sweden)
Mu Zhou
2014-01-01
Full Text Available Path tracking in wireless and mobile environments is a fundamental technology for ubiquitous location-based services (LBSs. In particular, it is very challenging to develop highly accurate and cost-efficient tracking systems applied to the anonymous areas where the floor plans are not available for security and privacy reasons. This paper proposes a novel path tracking approach for large Wi-Fi areas based on the time-stamped unlabeled mobility map which is constructed from Smith-Waterman received signal strength (RSS measurement matching. Instead of conventional location fingerprinting, we construct mobility map with the technique of dimension reduction from the raw measurement space into a low-dimensional embedded manifold. The feasibility of our proposed approach is verified by the real-world experiments in the HKUST campus Wi-Fi networks, sMobileNet. The experimental results prove that our approach is adaptive and capable of achieving an adequate precision level in path tracking.
Path Planning with a Lazy Significant Edge Algorithm (LSEA
Directory of Open Access Journals (Sweden)
Joseph Polden
2013-04-01
Full Text Available Probabilistic methods have been proven to be effective for robotic path planning in a geometrically complex environment. In this paper, we propose a novel approach, which utilizes a specialized roadmap expansion phase, to improve lazy probabilistic path planning. This expansion phase analyses roadmap connectivity information to bias sampling towards objects in the workspace that have not yet been navigated by the robot. A new method to reduce the number of samples required to navigate narrow passages is also proposed and tested. Experimental results show that the new algorithm is more efficient than the traditional path planning methodologies. It was able to generate solutions for a variety of path planning problems faster, using fewer samples to arrive at a valid solution.
Points-Based Safe Path Planning of Continuum Robots
Directory of Open Access Journals (Sweden)
Khuram Shahzad
2015-07-01
Full Text Available Continuum robots exhibit great potential in a number of challenging applications where traditional rigid link robots pose certain limitations, e.g., working in unstructured environments. In order to enable the usage of continuum robots in safety-critical applications, such as surgery and nuclear decontamination, it is extremely important to ensure a safe path for the robot's movement. Existing algorithms for continuum robot path planning have certain limitations that need to be addressed. These include the fact that none of the algorithms provide safety assurance parameters and control for path planning. They are computationally expensive, applicable to a specific type of continuum robots, and mostly they do not incorporate design and kinematics constraints. In this paper, we propose a points-based path planning (PoPP algorithm for continuum robots that computes the path by imposing safety constraints and improves upon the limitations of existing approaches. In the algorithm, we exploit the constant curvature-bending property of continuum robots in their path planning process. The algorithm is computationally efficient and provides a good tradeoff between accuracy and efficiency that can be implemented to enable the safety-critical application of continuum robots. This algorithm also provides information regarding path volume and flexibility in movement. Simulation results confirm that the algorithm possesses promising potential for all types of continuum robots (following the constant curvature-bending property. We believe that this effectively balances the desired safety and efficiency requirements.
Autonomous path planning solution for industrial robot manipulator using backpropagation algorithm
Directory of Open Access Journals (Sweden)
PeiJiang Yuan
2015-12-01
Full Text Available Here, we propose an autonomous path planning solution using backpropagation algorithm. The mechanism of movement used by humans in controlling their arms is analyzed and then applied to control a robot manipulator. Autonomous path planning solution is a numerical method. The model of industrial robot manipulator used in this article is a KUKA KR 210 R2700 EXTRA robot. In order to show the performance of the autonomous path planning solution, an experiment validation of path tracking is provided. Experiment validation consists of implementation of the autonomous path planning solution and the control of physical robot. The process of converging to target solution is provided. The mean absolute error of position for tool center point is also analyzed. Comparison between autonomous path planning solution and the numerical methods based on Newton–Raphson algorithm is provided to demonstrate the efficiency and accuracy of the autonomous path planning solution.
Path Planning Methods in an Environment with Obstacles (A Review
Directory of Open Access Journals (Sweden)
W. Liu
2018-01-01
Full Text Available Planning the path is the most important task in the mobile robot navigation. This task involves basically three aspects. First, the planned path must run from a given starting point to a given endpoint. Secondly, it should ensure robot’s collision-free movement. Thirdly, among all the possible paths that meet the first two requirements it must be, in a certain sense, optimal.Methods of path planning can be classified according to different characteristics. In the context of using intelligent technologies, they can be divided into traditional methods and heuristic ones. By the nature of the environment, it is possible to divide planning methods into planning methods in a static environment and in a dynamic one (it should be noted, however, that a static environment is rare. Methods can also be divided according to the completeness of information about the environment, namely methods with complete information (in this case the issue is a global path planning and methods with incomplete information (usually, this refers to the situational awareness in the immediate vicinity of the robot, in this case it is a local path planning. Note that incomplete information about the environment can be a consequence of the changing environment, i.e. in a dynamic environment, there is, usually, a local path planning.Literature offers a great deal of methods for path planning where various heuristic techniques are used, which, as a rule, result from the denotative meaning of the problem being solved. This review discusses the main approaches to the problem solution. Here we can distinguish five classes of basic methods: graph-based methods, methods based on cell decomposition, use of potential fields, optimization methods, фтв methods based on intelligent technologies.Many methods of path planning, as a result, give a chain of reference points (waypoints connecting the beginning and end of the path. This should be seen as an intermediate result. The problem
Static and Dynamic Path Planning Using Incremental Heuristic Search
Khattab, Asem
2018-01-01
Path planning is an important component in any highly automated vehicle system. In this report, the general problem of path planning is considered first in partially known static environments where only static obstacles are present but the layout of the environment is changing as the agent acquires new information. Attention is then given to the problem of path planning in dynamic environments where there are moving obstacles in addition to the static ones. Specifically, a 2D car-like agent t...
Real time MHD mode control using ECCD in KSTAR: Plan and requirements
Energy Technology Data Exchange (ETDEWEB)
Joung, M.; Woo, M. H.; Jeong, J. H.; Hahn, S. H.; Yun, S. W.; Lee, W. R.; Bae, Y. S.; Oh, Y. K.; Kwak, J. G.; Yang, H. L. [National Fusion Research Institute, 52 Eoeun-dong, Yuseong-gu, Daejeon (Korea, Republic of); Namkung, W.; Park, H.; Cho, M. H. [Department of Physics, POSTECH, Hyoja-dong, Nam-gu, Pohang, Gyeongangbuk-do (Korea, Republic of); Kim, M. H.; Kim, K. J.; Na, Y. S. [Department of Nuclear Engineering, Seoul National University, Daehak-dong, Gwanak-gu, Seoul (Korea, Republic of); Hosea, J.; Ellis, R. [Princeton Plasma Physics Laboratory, Princeton (United States)
2014-02-12
For a high-performance, advanced tokamak mode in KSTAR, we have been developing a real-time control system of MHD modes such as sawtooth and Neo-classical Tearing Mode (NTM) by ECH/ECCD. The active feedback control loop will be also added to the mirror position and the real-time detection of the mode position. In this year, for the stabilization of NTM that is crucial to plasma performance we have implemented open-loop ECH antenna control system in KSTAR Plasma Control System (PCS) for ECH mirror movement during a single plasma discharge. KSTAR 170 GHz ECH launcher which was designed and fabricated by collaboration with PPPL and POSTECH has a final mirror of a poloidally and toroidally steerable mirror. The poloidal steering motion is only controlled in the real-time NTM control system and its maximum steering speed is 10 degree/sec by DC motor. However, the latency of the mirror control system and the return period of ECH antenna mirror angle are not fast because the existing launcher mirror control system is based on PLC which is connected to the KSTAR machine network through serial to LAN converter. In this paper, we present the design of real time NTM control system, ECH requirements, and the upgrade plan.
Path Planning Method for UUV Homing and Docking in Movement Disorders Environment
Directory of Open Access Journals (Sweden)
Zheping Yan
2014-01-01
Full Text Available Path planning method for unmanned underwater vehicles (UUV homing and docking in movement disorders environment is proposed in this paper. Firstly, cost function is proposed for path planning. Then, a novel particle swarm optimization (NPSO is proposed and applied to find the waypoint with minimum value of cost function. Then, a strategy for UUV enters into the mother vessel with a fixed angle being proposed. Finally, the test function is introduced to analyze the performance of NPSO and compare with basic particle swarm optimization (BPSO, inertia weight particle swarm optimization (LWPSO, EPSO, and time-varying acceleration coefficient (TVAC. It has turned out that, for unimodal functions, NPSO performed better searching accuracy and stability than other algorithms, and, for multimodal functions, the performance of NPSO is similar to TVAC. Then, the simulation of UUV path planning is presented, and it showed that, with the strategy proposed in this paper, UUV can dodge obstacles and threats, and search for the efficiency path.
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...
International Nuclear Information System (INIS)
Ipsen, S.; Blanck, O.; Rades, D.; Oborn, B.; Bode, F.; Liney, G.; Hunold, P.; Schweikard, A.; Keall, P. J.
2014-01-01
Purpose: Atrial fibrillation (AFib) is the most common cardiac arrhythmia that affects millions of patients world-wide. AFib is usually treated with minimally invasive, time consuming catheter ablation techniques. While recently noninvasive radiosurgery to the pulmonary vein antrum (PVA) in the left atrium has been proposed for AFib treatment, precise target location during treatment is challenging due to complex respiratory and cardiac motion. A MRI linear accelerator (MRI-Linac) could solve the problems of motion tracking and compensation using real-time image guidance. In this study, the authors quantified target motion ranges on cardiac magnetic resonance imaging (MRI) and analyzed the dosimetric benefits of margin reduction assuming real-time motion compensation was applied. Methods: For the imaging study, six human subjects underwent real-time cardiac MRI under free breathing. The target motion was analyzed retrospectively using a template matching algorithm. The planning study was conducted on a CT of an AFib patient with a centrally located esophagus undergoing catheter ablation, representing an ideal case for cardiac radiosurgery. The target definition was similar to the ablation lesions at the PVA created during catheter treatment. Safety margins of 0 mm (perfect tracking) to 8 mm (untracked respiratory motion) were added to the target, defining the planning target volume (PTV). For each margin, a 30 Gy single fraction IMRT plan was generated. Additionally, the influence of 1 and 3 T magnetic fields on the treatment beam delivery was simulated using Monte Carlo calculations to determine the dosimetric impact of MRI guidance for two different Linac positions. Results: Real-time cardiac MRI showed mean respiratory target motion of 10.2 mm (superior–inferior), 2.4 mm (anterior–posterior), and 2 mm (left–right). The planning study showed that increasing safety margins to encompass untracked respiratory motion leads to overlapping structures even in the
Energy Technology Data Exchange (ETDEWEB)
Ipsen, S. [Radiation Physics Laboratory, Sydney Medical School, The University of Sydney, Sydney, New South Wales 2006, Australia and Institute for Robotics and Cognitive Systems, University of Luebeck, Luebeck 23562 (Germany); Blanck, O.; Rades, D. [Department of Radiation Oncology, University of Luebeck and University Medical Center Schleswig-Holstein, Campus Luebeck, Luebeck 23562 (Germany); Oborn, B. [Illawarra Cancer Care Centre (ICCC), Wollongong, New South Wales 2500, Australia and Centre for Medical Radiation Physics (CMRP), University of Wollongong, Wollongong, New South Wales 2500 (Australia); Bode, F. [Medical Department II, University of Luebeck and University Medical Center Schleswig-Holstein, Campus Luebeck, Luebeck 23562 (Germany); Liney, G. [Ingham Institute for Applied Medical Research, Liverpool Hospital, Liverpool, New South Wales 2170 (Australia); Hunold, P. [Department of Radiology and Nuclear Medicine, University of Luebeck and University Medical Center Schleswig-Holstein, Campus Luebeck, Luebeck 23562 (Germany); Schweikard, A. [Institute for Robotics and Cognitive Systems, University of Luebeck, Luebeck 23562 (Germany); Keall, P. J., E-mail: paul.keall@sydney.edu.au [Radiation Physics Laboratory, Sydney Medical School, The University of Sydney, Sydney, New South Wales 2006 (Australia)
2014-12-15
Purpose: Atrial fibrillation (AFib) is the most common cardiac arrhythmia that affects millions of patients world-wide. AFib is usually treated with minimally invasive, time consuming catheter ablation techniques. While recently noninvasive radiosurgery to the pulmonary vein antrum (PVA) in the left atrium has been proposed for AFib treatment, precise target location during treatment is challenging due to complex respiratory and cardiac motion. A MRI linear accelerator (MRI-Linac) could solve the problems of motion tracking and compensation using real-time image guidance. In this study, the authors quantified target motion ranges on cardiac magnetic resonance imaging (MRI) and analyzed the dosimetric benefits of margin reduction assuming real-time motion compensation was applied. Methods: For the imaging study, six human subjects underwent real-time cardiac MRI under free breathing. The target motion was analyzed retrospectively using a template matching algorithm. The planning study was conducted on a CT of an AFib patient with a centrally located esophagus undergoing catheter ablation, representing an ideal case for cardiac radiosurgery. The target definition was similar to the ablation lesions at the PVA created during catheter treatment. Safety margins of 0 mm (perfect tracking) to 8 mm (untracked respiratory motion) were added to the target, defining the planning target volume (PTV). For each margin, a 30 Gy single fraction IMRT plan was generated. Additionally, the influence of 1 and 3 T magnetic fields on the treatment beam delivery was simulated using Monte Carlo calculations to determine the dosimetric impact of MRI guidance for two different Linac positions. Results: Real-time cardiac MRI showed mean respiratory target motion of 10.2 mm (superior–inferior), 2.4 mm (anterior–posterior), and 2 mm (left–right). The planning study showed that increasing safety margins to encompass untracked respiratory motion leads to overlapping structures even in the
Ipsen, S; Blanck, O; Oborn, B; Bode, F; Liney, G; Hunold, P; Rades, D; Schweikard, A; Keall, P J
2014-12-01
Atrial fibrillation (AFib) is the most common cardiac arrhythmia that affects millions of patients world-wide. AFib is usually treated with minimally invasive, time consuming catheter ablation techniques. While recently noninvasive radiosurgery to the pulmonary vein antrum (PVA) in the left atrium has been proposed for AFib treatment, precise target location during treatment is challenging due to complex respiratory and cardiac motion. A MRI linear accelerator (MRI-Linac) could solve the problems of motion tracking and compensation using real-time image guidance. In this study, the authors quantified target motion ranges on cardiac magnetic resonance imaging (MRI) and analyzed the dosimetric benefits of margin reduction assuming real-time motion compensation was applied. For the imaging study, six human subjects underwent real-time cardiac MRI under free breathing. The target motion was analyzed retrospectively using a template matching algorithm. The planning study was conducted on a CT of an AFib patient with a centrally located esophagus undergoing catheter ablation, representing an ideal case for cardiac radiosurgery. The target definition was similar to the ablation lesions at the PVA created during catheter treatment. Safety margins of 0 mm (perfect tracking) to 8 mm (untracked respiratory motion) were added to the target, defining the planning target volume (PTV). For each margin, a 30 Gy single fraction IMRT plan was generated. Additionally, the influence of 1 and 3 T magnetic fields on the treatment beam delivery was simulated using Monte Carlo calculations to determine the dosimetric impact of MRI guidance for two different Linac positions. Real-time cardiac MRI showed mean respiratory target motion of 10.2 mm (superior-inferior), 2.4 mm (anterior-posterior), and 2 mm (left-right). The planning study showed that increasing safety margins to encompass untracked respiratory motion leads to overlapping structures even in the ideal scenario, compromising
A Dynamic Hidden Forwarding Path Planning Method Based on Improved Q-Learning in SDN Environments
Directory of Open Access Journals (Sweden)
Yun Chen
2018-01-01
Full Text Available Currently, many methods are available to improve the target network’s security. The vast majority of them cannot obtain an optimal attack path and interdict it dynamically and conveniently. Almost all defense strategies aim to repair known vulnerabilities or limit services in target network to improve security of network. These methods cannot response to the attacks in real-time because sometimes they need to wait for manufacturers releasing corresponding countermeasures to repair vulnerabilities. In this paper, we propose an improved Q-learning algorithm to plan an optimal attack path directly and automatically. Based on this path, we use software-defined network (SDN to adjust routing paths and create hidden forwarding paths dynamically to filter vicious attack requests. Compared to other machine learning algorithms, Q-learning only needs to input the target state to its agents, which can avoid early complex training process. We improve Q-learning algorithm in two aspects. First, a reward function based on the weights of hosts and attack success rates of vulnerabilities is proposed, which can adapt to different network topologies precisely. Second, we remove the actions and merge them into every state that reduces complexity from O(N3 to O(N2. In experiments, after deploying hidden forwarding paths, the security of target network is boosted significantly without having to repair network vulnerabilities immediately.
Image-based path planning for automated virtual colonoscopy navigation
Hong, Wei
2008-03-01
Virtual colonoscopy (VC) is a noninvasive method for colonic polyp screening, by reconstructing three-dimensional models of the colon using computerized tomography (CT). In virtual colonoscopy fly-through navigation, it is crucial to generate an optimal camera path for efficient clinical examination. In conventional methods, the centerline of the colon lumen is usually used as the camera path. In order to extract colon centerline, some time consuming pre-processing algorithms must be performed before the fly-through navigation, such as colon segmentation, distance transformation, or topological thinning. In this paper, we present an efficient image-based path planning algorithm for automated virtual colonoscopy fly-through navigation without the requirement of any pre-processing. Our algorithm only needs the physician to provide a seed point as the starting camera position using 2D axial CT images. A wide angle fisheye camera model is used to generate a depth image from the current camera position. Two types of navigational landmarks, safe regions and target regions are extracted from the depth images. Camera position and its corresponding view direction are then determined using these landmarks. The experimental results show that the generated paths are accurate and increase the user comfort during the fly-through navigation. Moreover, because of the efficiency of our path planning algorithm and rendering algorithm, our VC fly-through navigation system can still guarantee 30 FPS.
Reactive Path Planning Approach for Docking Robots in Unknown Environment
Directory of Open Access Journals (Sweden)
Peng Cui
2017-01-01
Full Text Available Autonomous robots need to be recharged and exchange information with the host through docking in the long-distance tasks. Therefore, feasible path is required in the docking process to guide the robot and adjust its pose. However, when there are unknown obstacles in the work area, it becomes difficult to determine the feasible path for docking. This paper presents a reactive path planning approach named Dubins-APF (DAPF to solve the path planning problem for docking in unknown environment with obstacles. In this proposed approach the Dubins curves are combined with the designed obstacle avoidance potential field to plan the feasible path. Firstly, an initial path is planned and followed according to the configurations of the robot and the docking station. Then when the followed path is evaluated to be infeasible, the intermediate configuration is calculated as well as the replanned path based on the obstacle avoidance potential field. The robot will be navigated to the docking station with proper pose eventually via the DAPF approach. The proposed DAPF approach is efficient and does not require the prior knowledge about the environment. Simulation results are given to validate the effectiveness and feasibility of the proposed approach.
DEFF Research Database (Denmark)
Falk, Marianne; Larsson, Tobias; Keall, P.
2012-01-01
Purpose: Real-time dynamic multileaf collimator (MLC) tracking for management of intrafraction tumor motion can be challenging for highly modulated beams, as the leaves need to travel far to adjust for target motion perpendicular to the leaf travel direction. The plan modulation can be reduced......-to-peak displacement of 2 cm and a cycle time of 6 s. The delivery was adjusted to the target motion using MLC tracking, guided in real-time by an infrared optical system. The dosimetric results were evaluated using gamma index evaluation with static target measurements as reference. Results: The plan quality...
Evolving from Planning and Scheduling to Real-Time Operations Support: Design Challenges
Marquez, Jessica J.; Ludowise, Melissa; McCurdy, Michael; Li, Jack
2010-01-01
Versions of Scheduling and Planning Interface for Exploration (SPIFe) have supported a variety of mission operations across NASA. This software tool has evolved and matured over several years, assisting planners who develop intricate schedules. While initially conceived for surface Mars missions, SPIFe has been deployed in other domains, where people rather than robotic explorers, execute plans. As a result, a diverse set of end-users has compelled growth in a new direction: supporting real-time operations. This paper describes the new needs and challenges that accompany this development. Among the key features that have been built for SPIFe are current time indicators integrated into the interface and timeline, as well as other plan attributes that enable execution of scheduled activities. Field tests include mission support for the Lunar CRater Observation and Sensing Satellite (LCROSS), NASA Extreme Environment Mission Operations (NEEMO) and Desert Research and Technology Studies (DRATS) campaigns.
International Nuclear Information System (INIS)
Shirato, Hiroki; Shimizu, Shinichi; Kitamura, Kei; Nishioka, Takeshi; Kagei, Kenji; Hashimoto, Seiko; Aoyama, Hidefumi; Kunieda, Tatsuya; Shinohara, Nobuo; Dosaka-Akita, Hirotoshi; Miyasaka, Kazuo
2000-01-01
Purpose: To achieve precise three-dimensional (3D) conformal radiotherapy for mobile tumors, a new radiotherapy system and its treatment planning system were developed and used for clinical practice. Methods and Materials: We developed a linear accelerator synchronized with a fluoroscopic real-time tumor tracking system by which 3D coordinates of a 2.0-mm gold marker in the tumor can be determined every 0.03 second. The 3D relationships between the marker and the tumor at different respiratory phases are evaluated using CT image at each respiratory phase, whereby the optimum phase can be selected to synchronize with irradiation (4D treatment planning). The linac is triggered to irradiate the tumor only when the marker is located within the region of the planned coordinates relative to the isocenter. Results: The coordinates of the marker were detected with an accuracy of ± 1 mm during radiotherapy in the phantom experiment. The time delay between recognition of the marker position and the start or stop of megavoltage X-ray irradiation was 0.03 second. Fourteen patients with various tumors were treated by conformal radiotherapy with a 'tight' planning target volume (PTV) margin. They were surviving without relapse or complications with a median follow-up of 6 months. Conclusion: Fluoroscopic real-time tumor tracking radiotherapy following 4D treatment planning was developed and shown to be feasible to improve the accuracy of the radiotherapy for mobile tumors
Directory of Open Access Journals (Sweden)
Adithya Guru Vaishnav.S
2015-08-01
Full Text Available This paper aims at providing a theoretical framework to find an optimized route from any source to destination considering the real-time traffic congestion issues. The distance of various possible routes from the source and destination are calculated and a PathRank is allocated in the descending order of distance to each possible path. Each intermediate locations are considered as nodes of a graph and the edges are represented by real-time traffic flow monitored using GoogleMaps GPS crowdsourcing data. The Page Rank is calculated for each intermediate node. From the values of PageRank and PathRank the minimum sum term is used to find an optimized route with minimal trade-off between shortest path and real-time traffic.
Visibility-based optimal path and motion planning
Wang, Paul Keng-Chieh
2015-01-01
This monograph deals with various visibility-based path and motion planning problems motivated by real-world applications such as exploration and mapping planetary surfaces, environmental surveillance using stationary or mobile robots, and imaging of global air/pollutant circulation. The formulation and solution of these problems call for concepts and methods from many areas of applied mathematics including computational geometry, set-covering, non-smooth optimization, combinatorial optimization and optimal control. Emphasis is placed on the formulation of new problems and methods of approach to these problems. Since geometry and visualization play important roles in the understanding of these problems, intuitive interpretations of the basic concepts are presented before detailed mathematical development. The development of a particular topic begins with simple cases illustrated by specific examples, and then progresses forward to more complex cases. The intended readers of this monograph are primarily studen...
A bat algorithm with mutation for UCAV path planning.
Wang, Gaige; Guo, Lihong; Duan, Hong; Liu, Luo; Wang, Heqi
2012-01-01
Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original bat algorithm (BA) is used to solve the UCAV path planning problem. Furthermore, a new bat algorithm with mutation (BAM) is proposed to solve the UCAV path planning problem, and a modification is applied to mutate between bats during the process of the new solutions updating. Then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic BA. The realization procedure for original BA and this improved metaheuristic approach BAM is also presented. To prove the performance of this proposed metaheuristic method, BAM is compared with BA and other population-based optimization methods, such as ACO, BBO, DE, ES, GA, PBIL, PSO, and SGA. The experiment shows that the proposed approach is more effective and feasible in UCAV path planning than the other models.
Path planning in uncertain flow fields using ensemble method
Wang, Tong
2016-08-20
An ensemble-based approach is developed to conduct 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 an ensemble of deterministic predictions is used to model and quantify uncertainty. In an operational setting, much about dynamics, topography, and forcing of the ocean environment is uncertain. To address this uncertainty, the 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 of the resulting realizations of the uncertain current field, we predict the path that minimizes the travel time 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 the sampling strategy and to develop insight into extensions dealing with general circulation ocean 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.
Directory of Open Access Journals (Sweden)
Kaijun Zhou
2017-09-01
Full Text Available The Jump Point Search (JPS algorithm is adopted for local path planning of the driverless car under urban environment, and it is a fast search method applied in path planning. Firstly, a vector Geographic Information System (GIS map, including Global Positioning System (GPS position, direction, and lane information, is built for global path planning. Secondly, the GIS map database is utilized in global path planning for the driverless car. Then, the JPS algorithm is adopted to avoid the front obstacle, and to find an optimal local path for the driverless car in the urban environment. Finally, 125 different simulation experiments in the urban environment demonstrate that JPS can search out the optimal and safety path successfully, and meanwhile, it has a lower time complexity compared with the Vector Field Histogram (VFH, the Rapidly Exploring Random Tree (RRT, A*, and the Probabilistic Roadmaps (PRM algorithms. Furthermore, JPS is validated usefully in the structured urban environment.
Path Planning Algorithms for Autonomous Border Patrol Vehicles
Lau, George Tin Lam
This thesis presents an online path planning algorithm developed for unmanned vehicles in charge of autonomous border patrol. In this Pursuit-Evasion game, the unmanned vehicle is required to capture multiple trespassers on its own before any of them reach a target safe house where they are safe from capture. The problem formulation is based on Isaacs' Target Guarding problem, but extended to the case of multiple evaders. The proposed path planning method is based on Rapidly-exploring random trees (RRT) and is capable of producing trajectories within several seconds to capture 2 or 3 evaders. Simulations are carried out to demonstrate that the resulting trajectories approach the optimal solution produced by a nonlinear programming-based numerical optimal control solver. Experiments are also conducted on unmanned ground vehicles to show the feasibility of implementing the proposed online path planning algorithm on physical applications.
Planning paths through a spatial hierarchy - Eliminating stair-stepping effects
Slack, Marc G.
1989-01-01
Stair-stepping effects are a result of the loss of spatial continuity resulting from the decomposition of space into a grid. This paper presents a path planning algorithm which eliminates stair-stepping effects induced by the grid-based spatial representation. The algorithm exploits a hierarchical spatial model to efficiently plan paths for a mobile robot operating in dynamic domains. The spatial model and path planning algorithm map to a parallel machine, allowing the system to operate incrementally, thereby accounting for unexpected events in the operating space.
Multi-AGV path planning with double-path constraints by using an improved genetic algorithm.
Directory of Open Access Journals (Sweden)
Zengliang Han
Full Text Available This paper investigates an improved genetic algorithm on multiple automated guided vehicle (multi-AGV path planning. The innovations embody in two aspects. First, three-exchange crossover heuristic operators are used to produce more optimal offsprings for getting more information than with the traditional two-exchange crossover heuristic operators in the improved genetic algorithm. Second, double-path constraints of both minimizing the total path distance of all AGVs and minimizing single path distances of each AGV are exerted, gaining the optimal shortest total path distance. The simulation results show that the total path distance of all AGVs and the longest single AGV path distance are shortened by using the improved genetic algorithm.
Disordered and Multiple Destinations Path Planning Methods for Mobile Robot in Dynamic Environment
Directory of Open Access Journals (Sweden)
Yong-feng Dong
2016-01-01
Full Text Available In the smart home environment, aiming at the disordered and multiple destinations path planning, the sequencing rule is proposed to determine the order of destinations. Within each branching process, the initial feasible path set is generated according to the law of attractive destination. A sinusoidal adaptive genetic algorithm is adopted. It can calculate the crossover probability and mutation probability adaptively changing with environment at any time. According to the cultural-genetic algorithm, it introduces the concept of reducing turns by parallelogram and reducing length by triangle in the belief space, which can improve the quality of population. And the fallback strategy can help to jump out of the “U” trap effectively. The algorithm analyses the virtual collision in dynamic environment with obstacles. According to the different collision types, different strategies are executed to avoid obstacles. The experimental results show that cultural-genetic algorithm can overcome the problems of premature and convergence of original algorithm effectively. It can avoid getting into the local optimum. And it is more effective for mobile robot path planning. Even in complex environment with static and dynamic obstacles, it can avoid collision safely and plan an optimal path rapidly at the same time.
Definition of mean free path for real gases
Bird, G. A.
1983-11-01
Attention is drawn to the inconsistency in the conventional procedure for the definition of a mean free path in a real gas through the classical hard sphere result. It is shown that the variable cross-section hard sphere, or VHS, model can be used to define a mean free path that properly accounts for the temperature exponent of the coefficient of viscosity of the gas. In addition, the VHS model is shown to have advantages over the classical inverse power law models for numerical and analytical studies.
Active Path Planning for Drones in Object Search
Wang, Zeyangyi
2017-01-01
Object searching is one of the most popular applications of unmanned aerial vehicles. Low cost small drones are particularly suited for surveying tasks in difficult conditions. With their limited on-board processing power and battery life, there is a need for more efficient search algorithm. The proposed path planning algorithm utilizes AZ-net, a deep learning network to process images captured on drones for adaptive flight path planning. Search simulation based on videos and actual experimen...
DEFF Research Database (Denmark)
Hameed, Ibahim
2014-01-01
Field operations should be done in a manner that minimizes time and travels over the field surface. Automated and intelligent path planning can help to find the best coverage path so that costs of various field operations can be minimized. The algorithms for generating an optimized field coverage...
Evaluation of a New Backtrack Free Path Planning Algorithm for Manipulators
Islam, Md. Nazrul; Tamura, Shinsuke; Murata, Tomonari; Yanase, Tatsuro
This paper evaluates a newly proposed backtrack free path planning algorithm (BFA) for manipulators. BFA is an exact algorithm, i.e. it is resolution complete. Different from existing resolution complete algorithms, its computation time and memory space are proportional to the number of arms. Therefore paths can be calculated within practical and predetermined time even for manipulators with many arms, and it becomes possible to plan complicated motions of multi-arm manipulators in fully automated environments. The performance of BFA is evaluated for 2-dimensional environments while changing the number of arms and obstacle placements. Its performance under locus and attitude constraints is also evaluated. Evaluation results show that the computation volume of the algorithm is almost the same as the theoretical one, i.e. it increases linearly with the number of arms even in complicated environments. Moreover BFA achieves the constant performance independent of environments.
Path Planning of Free-Floating Robot in Cartesian Space Using Direct Kinematics
Directory of Open Access Journals (Sweden)
Wenfu Xu
2007-03-01
Full Text Available Dynamic singularities make it difficult to plan the Cartesian path of free-floating robot. In order to avoid its effect, the direct kinematic equations are used for path planning in the paper. Here, the joint position, rate and acceleration are bounded. Firstly, the joint trajectories are parameterized by polynomial or sinusoidal functions. And the two parametric functions are compared in details. It is the first contribution of the paper that polynomial functions can be used when the joint angles are limited(In the similar work of other researchers, only sinusoidla functions could be used. Secondly, the joint functions are normalized and the system of equations about the parameters is established by integrating the differential kinematics equations. Normalization is another contribution of the paper. After normalization, the boundary of the parameters is determined beforehand, and the general criterion to assign the initial guess of the unknown parameters is supplied. The criterion is independent on the planning conditions such as the total time tf. Finally, the parametes are solved by the iterative Newtonian method. Modification of tf may not result in the recalculation of the parameters. Simulation results verify the path planning method.
Path Planning of Free-Floating Robot in Cartesian Space Using Direct Kinematics
Directory of Open Access Journals (Sweden)
Wenfu Xu
2008-11-01
Full Text Available Dynamic singularities make it difficult to plan the Cartesian path of freefloating robot. In order to avoid its effect, the direct kinematic equations are used for path planning in the paper. Here, the joint position, rate and acceleration are bounded. Firstly, the joint trajectories are parameterized by polynomial or sinusoidal functions. And the two parametric functions are compared in details. It is the first contribution of the paper that polynomial functions can be used when the joint angles are limited(In the similar work of other researchers, only sinusoidla functions could be used. Secondly, the joint functions are normalized and the system of equations about the parameters is established by integrating the differential kinematics equations. Normalization is another contribution of the paper. After normalization, the boundary of the parameters is determined beforehand, and the general criterion to assign the initial guess of the unknown parameters is supplied. The criterion is independent on the planning conditions such as the total time tf. Finally, the parametes are solved by the iterative Newtonian method. Modification of tf may not result in the recalculation of the parameters. Simulation results verify the path planning method.
International Nuclear Information System (INIS)
Guthier, C; Aschenbrenner, K P; Buergy, D; Ehmann, M; Wenz, F; Hesser, J W
2015-01-01
This work discusses a novel strategy for inverse planning in low dose rate brachytherapy. It applies the idea of compressed sensing to the problem of inverse treatment planning and a new solver for this formulation is developed. An inverse planning algorithm was developed incorporating brachytherapy dose calculation methods as recommended by AAPM TG-43. For optimization of the functional a new variant of a matching pursuit type solver is presented. The results are compared with current state-of-the-art inverse treatment planning algorithms by means of real prostate cancer patient data. The novel strategy outperforms the best state-of-the-art methods in speed, while achieving comparable quality. It is able to find solutions with comparable values for the objective function and it achieves these results within a few microseconds, being up to 542 times faster than competing state-of-the-art strategies, allowing real-time treatment planning. The sparse solution of inverse brachytherapy planning achieved with methods from compressed sensing is a new paradigm for optimization in medical physics. Through the sparsity of required needles and seeds identified by this method, the cost of intervention may be reduced. (paper)
Guthier, C.; Aschenbrenner, K. P.; Buergy, D.; Ehmann, M.; Wenz, F.; Hesser, J. W.
2015-03-01
This work discusses a novel strategy for inverse planning in low dose rate brachytherapy. It applies the idea of compressed sensing to the problem of inverse treatment planning and a new solver for this formulation is developed. An inverse planning algorithm was developed incorporating brachytherapy dose calculation methods as recommended by AAPM TG-43. For optimization of the functional a new variant of a matching pursuit type solver is presented. The results are compared with current state-of-the-art inverse treatment planning algorithms by means of real prostate cancer patient data. The novel strategy outperforms the best state-of-the-art methods in speed, while achieving comparable quality. It is able to find solutions with comparable values for the objective function and it achieves these results within a few microseconds, being up to 542 times faster than competing state-of-the-art strategies, allowing real-time treatment planning. The sparse solution of inverse brachytherapy planning achieved with methods from compressed sensing is a new paradigm for optimization in medical physics. Through the sparsity of required needles and seeds identified by this method, the cost of intervention may be reduced.
Path planning of decentralized multi-quadrotor based on fuzzy-cell decomposition algorithm
Iswanto, Wahyunggoro, Oyas; Cahyadi, Adha Imam
2017-04-01
The paper aims to present a design algorithm for multi quadrotor lanes in order to move towards the goal quickly and avoid obstacles in an area with obstacles. There are several problems in path planning including how to get to the goal position quickly and avoid static and dynamic obstacles. To overcome the problem, therefore, the paper presents fuzzy logic algorithm and fuzzy cell decomposition algorithm. Fuzzy logic algorithm is one of the artificial intelligence algorithms which can be applied to robot path planning that is able to detect static and dynamic obstacles. Cell decomposition algorithm is an algorithm of graph theory used to make a robot path map. By using the two algorithms the robot is able to get to the goal position and avoid obstacles but it takes a considerable time because they are able to find the shortest path. Therefore, this paper describes a modification of the algorithms by adding a potential field algorithm used to provide weight values on the map applied for each quadrotor by using decentralized controlled, so that the quadrotor is able to move to the goal position quickly by finding the shortest path. The simulations conducted have shown that multi-quadrotor can avoid various obstacles and find the shortest path by using the proposed algorithms.
Nguyen, Thi Kim Duyen
2015-01-01
The primary objective of this research is to understand profoundly the new concept of content marketing – real-time content marketing on the aspect of the digital marketing experts. Particularly, the research will focus on the real-time content marketing theories and how to build real-time content marketing strategy based on content, search and social media. It also finds out how marketers measure and keep track of conversion rates of their real-time content marketing plan. Practically, th...
Cooperative Path-Planning for Multi-Vehicle Systems
Directory of Open Access Journals (Sweden)
Qichen Wang
2014-11-01
Full Text Available In this paper, we propose a collision avoidance algorithm for multi-vehicle systems, which is a common problem in many areas, including navigation and robotics. In dynamic environments, vehicles may become involved in potential collisions with each other, particularly when the vehicle density is high and the direction of travel is unrestricted. Cooperatively planning vehicle movement can effectively reduce and fairly distribute the detour inconvenience before subsequently returning vehicles to their intended paths. We present a novel method of cooperative path planning for multi-vehicle systems based on reinforcement learning to address this problem as a decision process. A dynamic system is described as a multi-dimensional space formed by vectors as states to represent all participating vehicles’ position and orientation, whilst considering the kinematic constraints of the vehicles. Actions are defined for the system to transit from one state to another. In order to select appropriate actions whilst satisfying the constraints of path smoothness, constant speed and complying with a minimum distance between vehicles, an approximate value function is iteratively developed to indicate the desirability of every state-action pair from the continuous state space and action space. The proposed scheme comprises two phases. The convergence of the value function takes place in the former learning phase, and it is then used as a path planning guideline in the subsequent action phase. This paper summarizes the concept and methodologies used to implement this online cooperative collision avoidance algorithm and presents results and analysis regarding how this cooperative scheme improves upon two baseline schemes where vehicles make movement decisions independently.
Cooperative Path Planning and Constraints Analysis for Master-Slave Industrial Robots
Directory of Open Access Journals (Sweden)
Yahui Gan
2012-09-01
Full Text Available A strategy of cooperative path planning for a master-slave multiple robot system is presented in this paper. The path planning method is based on motion constraints between the end-effectors of cooperative robots. Cooperation motions have been classified into three types by relative motions between end-effectors of master and slave robots, which is concurrent cooperation, coupled synchronous cooperation and combined synchronous cooperation. Based on this classification, position /orientation constraints and joint velocity constraints are explored in-depth here. In order to validate the path planning method and the theoretical developments in motion constraints analysis, representative experiments based on two industrial robots, Motoman VA1400 and HP20, are provided at the end of the paper. The experimental results have proved both the effectiveness of the path planning method and the correctness of the constraints analysis.
Real-time motional Stark effect in jet
International Nuclear Information System (INIS)
Alves, D.; Stephen, A.; Hawkes, N.; Dalley, S.; Goodyear, A.; Felton, R.; Joffrin, E.; Fernandes, H.
2004-01-01
The increasing importance of real-time measurements and control systems in JET experiments, regarding e.g. Internal Transport Barrier (ITB) and q-profile control, has motivated the development of a real-time motional Stark effect (MSE) system. The MSE diagnostic allows the measurement of local magnetic fields in different locations along the neutral beam path providing, therefore, local measurement of the current and q-profiles. Recently in JET, an upgrade of the MSE diagnostic has been implemented, incorporating a totally new system which allows the use of this diagnostic as a real-time control tool as well as an extended data source for off-line analysis. This paper will briefly describe the technical features of the real-time diagnostic with main focus on the system architecture, which consists of a VME crate hosting three PowerPC processor boards and a fast ADC, all connected via Front Panel Data Port (FPDP). The DSP algorithm implements a lockin-amplifier required to demodulate the JET MSE signals. Some applications for the system will be covered such as: feeding the real-time equilibrium reconstruction code (EQUINOX) and allowing the full coverage analysis of the Neutral Beam time window. A brief comparison between the real-time MSE analysis and the off-line analysis will also be presented
Integrated payload and mission planning, phase 3. Volume 3: Ground real-time mission operations
White, W. J.
1977-01-01
The payloads tentatively planned to fly on the first two Spacelab missions were analyzed to examine the cost relationships of providing mission operations support from onboard vs the ground-based Payload Operations Control Center (POCC). The quantitative results indicate that use of a POCC, with data processing capability, to support real-time mission operations is the most cost effective case.
International Nuclear Information System (INIS)
Dunlap, Neal; McIntosh, Alyson; Sheng Ke; Yang Wensha; Turner, Benton; Shoushtari, Asal; Sheehan, Jason; Jones, David R.; Lu Weigo; Ruchala, Keneth; Olivera, Gustavo; Parnell, Donald; Larner, James L.; Benedict, Stanley H.; Read, Paul W.
2010-01-01
Stereotactic body radiation therapy (SBRT) treatments have high-dose gradients and even slight patient misalignment from the simulation to treatment could lead to target underdosing or organ at risk (OAR) overdosing. Daily real-time SBRT treatment planning could minimize the risk of geographic miss. As an initial step toward determining the clinical feasibility of developing real-time SBRT treatment planning, we determined the calculation time of helical TomoTherapy-based STAT radiation therapy (RT) treatment plans for simple liver, lung, and spine SBRT treatments to assess whether the planning process was fast enough for practical clinical implementation. Representative SBRT planning target volumes for hypothetical liver, peripheral lung, and thoracic spine lesions and adjacent OARs were contoured onto a planning computed tomography scan (CT) of an anthropomorphic phantom. Treatment plans were generated using both STAT RT 'full scatter' and conventional helical TomoTherapy 'beamlet' algorithms. Optimized plans were compared with respect to conformality index (CI), heterogeneity index (HI), and maximum dose to regional OARs to determine clinical equivalence and the number of required STAT RT optimization iterations and calculation times were determined. The liver and lung dosimetry for the STAT RT and standard planning algorithms were clinically and statistically equivalent. For the liver lesions, 'full scatter' and 'beamlet' algorithms showed a CI of 1.04 and 1.04 and HI of 1.03 and 1.03, respectively. For the lung lesions, 'full scatter' and 'beamlet' algorithms showed a CI of 1.05 and 1.03 and HI of 1.05and 1.05, respectively. For spine lesions, 'full scatter' and 'beamlet' algorithms showed a CI of 1.15 and 1.14 and HI of 1.22 and 1.14, respectively. There was no difference between treatment algorithms with respect to maximum doses to the OARs. The STAT RT iteration time with current treatment planning systems is 45 sec, and the treatment planning required 3
The HAL 9000 Space Operating System Real-Time Planning Engine Design and Operations Requirements
Stetson, Howard; Watson, Michael D.; Shaughnessy, Ray
2012-01-01
In support of future deep space manned missions, an autonomous/automated vehicle, providing crew autonomy and an autonomous response planning system, will be required due to the light time delays in communication. Vehicle capabilities as a whole must provide for tactical response to vehicle system failures and space environmental effects induced failures, for risk mitigation of permanent loss of communication with Earth, and for assured crew return capabilities. The complexity of human rated space systems and the limited crew sizes and crew skills mix drive the need for a robust autonomous capability on-board the vehicle. The HAL 9000 Space Operating System[2] designed for such missions and space craft includes the first distributed real-time planning / re-planning system. This paper will detail the software architecture of the multiple planning engine system, and the interface design for plan changes, approval and implementation that is performed autonomously. Operations scenarios will be defined for analysis of the planning engines operations and its requirements for nominal / off nominal activities. An assessment of the distributed realtime re-planning system, in the defined operations environment, will be provided as well as findings as it pertains to the vehicle, crew, and mission control requirements needed for implementation.
Faster-than-real-time robot simulation for plan development and robot safety
International Nuclear Information System (INIS)
Crane, C.D. III; Dalton, R.; Ogles, J.; Tulenko, J.S.; Zhou, X.
1990-01-01
The University of Florida, in cooperation with the Universities of Texas, Tennessee, and Michigan and Oak Ridge National Laboratory (ORNL), is developing an advanced robotic system for the US Department of Energy under the University Program for Robotics for Advanced Reactors. As part of this program, the University of Florida has been pursuing the development of a faster-than-real-time robotic simulation program for planning and control of mobile robotic operations to ensure the efficient and safe operation of mobile robots in nuclear power plants and other hazardous environments
Robust Path Planning and Feedback Design Under Stochastic Uncertainty
Blackmore, Lars
2008-01-01
Autonomous vehicles require optimal path planning algorithms to achieve mission goals while avoiding obstacles and being robust to uncertainties. The uncertainties arise from exogenous disturbances, modeling errors, and sensor noise, which can be characterized via stochastic models. Previous work defined a notion of robustness in a stochastic setting by using the concept of chance constraints. This requires that mission constraint violation can occur with a probability less than a prescribed value.In this paper we describe a novel method for optimal chance constrained path planning with feedback design. The approach optimizes both the reference trajectory to be followed and the feedback controller used to reject uncertainty. Our method extends recent results in constrained control synthesis based on convex optimization to solve control problems with nonconvex constraints. This extension is essential for path planning problems, which inherently have nonconvex obstacle avoidance constraints. Unlike previous approaches to chance constrained path planning, the new approach optimizes the feedback gain as wellas the reference trajectory.The key idea is to couple a fast, nonconvex solver that does not take into account uncertainty, with existing robust approaches that apply only to convex feasible regions. By alternating between robust and nonrobust solutions, the new algorithm guarantees convergence to a global optimum. We apply the new method to an unmanned aircraft and show simulation results that demonstrate the efficacy of the approach.
International Nuclear Information System (INIS)
Ma, Yong; Wang, Hongwei; Zamirian, M.
2012-01-01
We present a new approach containing two steps to determine conflict-free paths for mobile objects in two and three dimensions with moving obstacles. Firstly, the shortest path of each object is set as goal function which is subject to collision-avoidance criterion, path smoothness, and velocity and acceleration constraints. This problem is formulated as calculus of variation problem (CVP). Using parametrization method, CVP is converted to time-varying nonlinear programming problems (TNLPP) and then resolved. Secondly, move sequence of object is assigned by priority scheme; conflicts are resolved by multilevel conflict resolution strategy. Approach efficiency is confirmed by numerical examples. -- Highlights: ► Approach with parametrization method and conflict resolution strategy is proposed. ► Approach fits for multi-object paths planning in two and three dimensions. ► Single object path planning and multi-object conflict resolution are orderly used. ► Path of each object obtained with parameterization method in the first phase. ► Conflict-free paths gained by multi-object conflict resolution in the second phase.
Path Planning Method in Multi-obstacle Marine Environment
Zhang, Jinpeng; Sun, Hanxv
2017-12-01
In this paper, an improved algorithm for particle swarm optimization is proposed for the application of underwater robot in the complex marine environment. Not only did consider to avoid obstacles when path planning, but also considered the current direction and the size effect on the performance of the robot dynamics. The algorithm uses the trunk binary tree structure to construct the path search space and A * heuristic search method is used in the search space to find a evaluation standard path. Then the particle swarm algorithm to optimize the path by adjusting evaluation function, which makes the underwater robot in the current navigation easier to control, and consume less energy.
Prototype real-time baseband signal combiner. [deep space network
Howard, L. D.
1980-01-01
The design and performance of a prototype real-time baseband signal combiner, used to enhance the received Voyager 2 spacecraft signals during the Jupiter flyby, is described. Hardware delay paths, operating programs, and firmware are discussed.
Lee, S. Daniel
1990-01-01
We propose a distributed agent architecture (DAA) that can support a variety of paradigms based on both traditional real-time computing and artificial intelligence. DAA consists of distributed agents that are classified into two categories: reactive and cognitive. Reactive agents can be implemented directly in Ada to meet hard real-time requirements and be deployed on on-board embedded processors. A traditional real-time computing methodology under consideration is the rate monotonic theory that can guarantee schedulability based on analytical methods. AI techniques under consideration for reactive agents are approximate or anytime reasoning that can be implemented using Bayesian belief networks as in Guardian. Cognitive agents are traditional expert systems that can be implemented in ART-Ada to meet soft real-time requirements. During the initial design of cognitive agents, it is critical to consider the migration path that would allow initial deployment on ground-based workstations with eventual deployment on on-board processors. ART-Ada technology enables this migration while Lisp-based technologies make it difficult if not impossible. In addition to reactive and cognitive agents, a meta-level agent would be needed to coordinate multiple agents and to provide meta-level control.
Ntasis, Efthymios; Maniatis, Theofanis A; Nikita, Konstantina S
2003-01-01
A secure framework is described for real-time tele-collaboration on Virtual Simulation procedure of Radiation Treatment Planning. An integrated approach is followed clustering the security issues faced by the system into organizational issues, security issues over the LAN and security issues over the LAN-to-LAN connection. The design and the implementation of the security services are performed according to the identified security requirements, along with the need for real time communication between the collaborating health care professionals. A detailed description of the implementation is given, presenting a solution, which can directly be tailored to other tele-collaboration services in the field of health care. The pilot study of the proposed security components proves the feasibility of the secure environment, and the consistency with the high performance demands of the application.
Integrated assignment and path planning
Murphey, Robert A.
2005-11-01
A surge of interest in unmanned systems has exposed many new and challenging research problems across many fields of engineering and mathematics. These systems have the potential of transforming our society by replacing dangerous and dirty jobs with networks of moving machines. This vision is fundamentally separate from the modern view of robotics in that sophisticated behavior is realizable not by increasing individual vehicle complexity, but instead through collaborative teaming that relies on collective perception, abstraction, decision making, and manipulation. Obvious examples where collective robotics will make an impact include planetary exploration, space structure assembly, remote and undersea mining, hazardous material handling and clean-up, and search and rescue. Nonetheless, the phenomenon driving this technology trend is the increasing reliance of the US military on unmanned vehicles, specifically, aircraft. Only a few years ago, following years of resistance to the use of unmanned systems, the military and civilian leadership in the United States reversed itself and have recently demonstrated surprisingly broad acceptance of increasingly pervasive use of unmanned platforms in defense surveillance, and even attack. However, as rapidly as unmanned systems have gained acceptance, the defense research community has discovered the technical pitfalls that lie ahead, especially for operating collective groups of unmanned platforms. A great deal of talent and energy has been devoted to solving these technical problems, which tend to fall into two categories: resource allocation of vehicles to objectives, and path planning of vehicle trajectories. An extensive amount of research has been conducted in each direction, yet, surprisingly, very little work has considered the integrated problem of assignment and path planning. This dissertation presents a framework for studying integrated assignment and path planning and then moves on to suggest an exact
Energy-Aware Path Planning for UAS Persistent Sampling and Surveillance
Shaw-Cortez, Wenceslao
The focus of this work is to develop an energy-aware path planning algorithm that maximizes UAS endurance, while performing sampling and surveillance missions in a known, stationary wind environment. The energy-aware aspect is specifically tailored to extract energy from the wind to reduce thrust use, thereby increasing aircraft endurance. Wind energy extraction is performed by static soaring and dynamic soaring. Static soaring involves using upward wind currents to increase altitude and potential energy. Dynamic soaring involves taking advantage of wind gradients to exchange potential and kinetic energy. The path planning algorithm developed in this work uses optimization to combine these soaring trajectories with the overarching sampling and surveillance mission. The path planning algorithm uses a simplified aircraft model to tractably optimize soaring trajectories. This aircraft model is presented and along with the derivation of the equations of motion. A nonlinear program is used to create the soaring trajectories based on a given optimization problem. This optimization problem is defined using a heuristic decision tree, which defines appropriate problems given a sampling and surveillance mission and a wind model. Simulations are performed to assess the path planning algorithm. The results are used to identify properties of soaring trajectories as well as to determine what wind conditions support minimal thrust soaring. Additional results show how the path planning algorithm can be tuned between maximizing aircraft endurance and performing the sampling and surveillance mission. A means of trajectory stitching is demonstrated to show how the periodic soaring segments can be combined together to provide a full solution to an infinite/long horizon problem.
Efficient evaluation of shortest travel-time path queries through spatial mashups
Zhang, Detian
2017-01-07
In the real world, the route/path with the shortest travel time in a road network is more meaningful than that with the shortest network distance for location-based services (LBS). However, not every LBS provider has adequate resources to compute/estimate travel time for routes by themselves. A cost-effective way for LBS providers to estimate travel time for routes is to issue external route requests to Web mapping services (e.g., Google Maps, Bing Maps, and MapQuest Maps). Due to the high cost of processing such external route requests and the usage limits of Web mapping services, we take the advantage of direction sharing, parallel requesting and waypoints supported by Web mapping services to reduce the number of external route requests and the query response time for shortest travel-time route queries in this paper. We first give the definition of sharing ability to reflect the possibility of sharing the direction information of a route with others, and find out the queries that their query routes are independent with each other for parallel processing. Then, we model the problem of selecting the optimal waypoints for an external route request as finding the longest simple path in a weighted complete digraph. As it is a MAX SNP-hard problem, we propose a greedy algorithm with performance guarantee to find the best set of waypoints in an external route request. We evaluate the performance of our approach using a real Web mapping service, a real road network, real and synthetic data sets. Experimental results show the efficiency, scalability, and applicability of our approach.
Efficient evaluation of shortest travel-time path queries through spatial mashups
Zhang, Detian; Chow, Chi-Yin; Liu, An; Zhang, Xiangliang; Ding, Qingzhu; Li, Qing
2017-01-01
In the real world, the route/path with the shortest travel time in a road network is more meaningful than that with the shortest network distance for location-based services (LBS). However, not every LBS provider has adequate resources to compute/estimate travel time for routes by themselves. A cost-effective way for LBS providers to estimate travel time for routes is to issue external route requests to Web mapping services (e.g., Google Maps, Bing Maps, and MapQuest Maps). Due to the high cost of processing such external route requests and the usage limits of Web mapping services, we take the advantage of direction sharing, parallel requesting and waypoints supported by Web mapping services to reduce the number of external route requests and the query response time for shortest travel-time route queries in this paper. We first give the definition of sharing ability to reflect the possibility of sharing the direction information of a route with others, and find out the queries that their query routes are independent with each other for parallel processing. Then, we model the problem of selecting the optimal waypoints for an external route request as finding the longest simple path in a weighted complete digraph. As it is a MAX SNP-hard problem, we propose a greedy algorithm with performance guarantee to find the best set of waypoints in an external route request. We evaluate the performance of our approach using a real Web mapping service, a real road network, real and synthetic data sets. Experimental results show the efficiency, scalability, and applicability of our approach.
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.
Optimal multi-agent path planning for fast inverse modeling in UAV-based flood sensing applications
Abdelkader, Mohamed
2014-05-01
Floods are the most common natural disasters, causing thousands of casualties every year in the world. In particular, flash flood events are particularly deadly because of the short timescales on which they occur. Unmanned air vehicles equipped with mobile microsensors could be capable of sensing flash floods in real time, saving lives and greatly improving the efficiency of the emergency response. However, of the main issues arising with sensing floods is the difficulty of planning the path of the sensing agents in advance so as to obtain meaningful data as fast as possible. In this particle, we present a fast numerical scheme to quickly compute the trajectories of a set of UAVs in order to maximize the accuracy of model parameter estimation over a time horizon. Simulation results are presented, a preliminary testbed is briefly described, and future research directions and problems are discussed. © 2014 IEEE.
The Study of Intelligent Vehicle Navigation Path Based on Behavior Coordination of Particle Swarm.
Han, Gaining; Fu, Weiping; Wang, Wen
2016-01-01
In the behavior dynamics model, behavior competition leads to the shock problem of the intelligent vehicle navigation path, because of the simultaneous occurrence of the time-variant target behavior and obstacle avoidance behavior. Considering the safety and real-time of intelligent vehicle, the particle swarm optimization (PSO) algorithm is proposed to solve these problems for the optimization of weight coefficients of the heading angle and the path velocity. Firstly, according to the behavior dynamics model, the fitness function is defined concerning the intelligent vehicle driving characteristics, the distance between intelligent vehicle and obstacle, and distance of intelligent vehicle and target. Secondly, behavior coordination parameters that minimize the fitness function are obtained by particle swarm optimization algorithms. Finally, the simulation results show that the optimization method and its fitness function can improve the perturbations of the vehicle planning path and real-time and reliability.
Knowledge-inducing Global Path Planning for Robots in Environment with Hybrid Terrain
Directory of Open Access Journals (Sweden)
Yi-nan Guo
2010-09-01
Full Text Available In complex environment with hybrid terrain, different regions may have different terrain. Path planning for robots in such environment is an open NP-complete problem, which lacks effective methods. The paper develops a novel global path planning method based on common sense and evolution knowledge by adopting dual evolution structure in culture algorithms. Common sense describes terrain information and feasibility of environment, which is used to evaluate and select the paths. Evolution knowledge describes the angle relationship between the path and the obstacles, or the common segments of paths, which is used to judge and repair infeasible individuals. Taken two types of environments with different obstacles and terrain as examples, simulation results indicate that the algorithm can effectively solve path planning problem in complex environment and decrease the computation complexity for judgment and repair of infeasible individuals. It also can improve the convergence speed and have better computation stability.
Real time Faraday spectrometer
Smith, Jr., Tommy E.; Struve, Kenneth W.; Colella, Nicholas J.
1991-01-01
This invention uses a dipole magnet to bend the path of a charged particle beam. As the deflected particles exit the magnet, they are spatially dispersed in the bend-plane of the magnet according to their respective momenta and pass to a plurality of chambers having Faraday probes positioned therein. Both the current and energy distribution of the particles is then determined by the non-intersecting Faraday probes located along the chambers. The Faraday probes are magnetically isolated from each other by thin metal walls of the chambers, effectively providing real time current-versus-energy particle measurements.
Real time Faraday spectrometer
International Nuclear Information System (INIS)
Smith, T.E.; Struve, K.W.; Colella, N.J.
1991-01-01
This patent describes an invention which uses a dipole magnet to bend the path of a charged particle beam. As the deflected particles exit the magnet, they are spatially dispersed in the bend-plane of the magnet according to their respective momenta and pass to a plurality of chambers having Faraday probes positioned therein. Both the current and energy distribution of the particles is then determined by the non-intersecting Faraday probes located along the chambers. The Faraday probes are magnetically isolated from each other by thin metal walls of the chambers, effectively providing real time current-versus-energy particle measurements
Interactive dose shaping - efficient strategies for CPU-based real-time treatment planning
International Nuclear Information System (INIS)
Ziegenhein, P; Kamerling, C P; Oelfke, U
2014-01-01
Conventional intensity modulated radiation therapy (IMRT) treatment planning is based on the traditional concept of iterative optimization using an objective function specified by dose volume histogram constraints for pre-segmented VOIs. This indirect approach suffers from unavoidable shortcomings: i) The control of local dose features is limited to segmented VOIs. ii) Any objective function is a mathematical measure of the plan quality, i.e., is not able to define the clinically optimal treatment plan. iii) Adapting an existing plan to changed patient anatomy as detected by IGRT procedures is difficult. To overcome these shortcomings, we introduce the method of Interactive Dose Shaping (IDS) as a new paradigm for IMRT treatment planning. IDS allows for a direct and interactive manipulation of local dose features in real-time. The key element driving the IDS process is a two-step Dose Modification and Recovery (DMR) strategy: A local dose modification is initiated by the user which translates into modified fluence patterns. This also affects existing desired dose features elsewhere which is compensated by a heuristic recovery process. The IDS paradigm was implemented together with a CPU-based ultra-fast dose calculation and a 3D GUI for dose manipulation and visualization. A local dose feature can be implemented via the DMR strategy within 1-2 seconds. By imposing a series of local dose features, equal plan qualities could be achieved compared to conventional planning for prostate and head and neck cases within 1-2 minutes. The idea of Interactive Dose Shaping for treatment planning has been introduced and first applications of this concept have been realized.
Directory of Open Access Journals (Sweden)
Imen Chaari
2017-03-01
Full Text Available This article presents the results of the 2-year iroboapp research project that aims at devising path planning algorithms for large grid maps with much faster execution times while tolerating very small slacks with respect to the optimal path. We investigated both exact and heuristic methods. We contributed with the design, analysis, evaluation, implementation and experimentation of several algorithms for grid map path planning for both exact and heuristic methods. We also designed an innovative algorithm called relaxed A-star that has linear complexity with relaxed constraints, which provides near-optimal solutions with an extremely reduced execution time as compared to A-star. We evaluated the performance of the different algorithms and concluded that relaxed A-star is the best path planner as it provides a good trade-off among all the metrics, but we noticed that heuristic methods have good features that can be exploited to improve the solution of the relaxed exact method. This led us to design new hybrid algorithms that combine our relaxed A-star with heuristic methods which improve the solution quality of relaxed A-star at the cost of slightly higher execution time, while remaining much faster than A* for large-scale problems. Finally, we demonstrate how to integrate the relaxed A-star algorithm in the robot operating system as a global path planner and show that it outperforms its default path planner with an execution time 38% faster on average.
ERP application of real-time vdc-enabled last planner system for planning reliability improvement
DEFF Research Database (Denmark)
Cho, S.; Sørensen, Kristian Birch; Fischer, M.
2009-01-01
The Last Planner System (LPS) has since its introduction in 1994 become a widely used method of AEC practitioners for improvement of planning reliability and tracking and monitoring of project progress. However, the observations presented in this paper indicate that the last planners...... and coordinators are in need of a new system that integrates the existing LPS with Virtual Design and Construction (VDC), Enterprise Resource Planning (ERP) systems, and automatic object identification by means of Radio Frequency Identification (RFID) technology. This is because current practice of the LPS...... implementations is guesswork-driven, textual report-generated, hand-updated, and even interpersonal trust-oriented, resulting in less accurate and reliable plans. This research introduces a prototype development of the VREL (VDC + RFID + ERP + LPS) integration to generate a real-time updated cost + physical...
Lee, Jiyeon; Yoshida, Masaya; Thompson, Cynthia K.
2015-01-01
Purpose: Grammatical encoding (GE) is impaired in agrammatic aphasia; however, the nature of such deficits remains unclear. We examined grammatical planning units during real-time sentence production in speakers with agrammatic aphasia and control speakers, testing two competing models of GE. We queried whether speakers with agrammatic aphasia…
International Nuclear Information System (INIS)
Gelis, F.
1996-01-01
The effect of the contribution of the vertical part of the real time path is studied completely in the case of two points functions and vacuum diagrams. Indeed, this vertical part generally contributes in the calculation of a given graph. Moreover, this contribution is essential in order to have a consistent equilibrium theory: thanks to this contribution, the Green functions are effectively invariant by time translation, as they should be. As a by product, it is shown that the perturbative calculations give a result which does not depend on the initial time t I and final time t F of the path. The property of independence with respect to t I is closely related to the KMS conditions, i.e. to the fact the system is in thermal equilibrium. In the case of two point functions and vacuum diagrams, the contribution of the vertical part can be taken into account by the n(vertical stroke k 0 vertical stroke) prescription in the usual RTF Feynman rules. The extra Feynman rule needed for vacuum diagrams is shown not to be related directly to the contribution of the vertical part of the path. (orig.). With 4 figs
Rowe, Neil C.; Lewis, David H.
1989-01-01
Path planning is an important issue for space robotics. Finding safe and energy-efficient paths in the presence of obstacles and other constraints can be complex although important. High-level (large-scale) path planning for robotic vehicles was investigated in three-dimensional space with obstacles, accounting for: (1) energy costs proportional to path length; (2) turn costs where paths change trajectory abruptly; and (3) safety costs for the danger associated with traversing a particular path due to visibility or invisibility from a fixed set of observers. Paths optimal with respect to these cost factors are found. Autonomous or semi-autonomous vehicles were considered operating either in a space environment around satellites and space platforms, or aircraft, spacecraft, or smart missiles operating just above lunar and planetary surfaces. One class of applications concerns minimizing detection, as for example determining the best way to make complex modifications to a satellite without being observed by hostile sensors; another example is verifying there are no paths (holes) through a space defense system. Another class of applications concerns maximizing detection, as finding a good trajectory between mountain ranges of a planet while staying reasonably close to the surface, or finding paths for a flight between two locations that maximize the average number of triangulation points available at any time along the path.
Shore-based Path Planning for Marine Vehicles Using a Model of Ocean Currents
National Aeronautics and Space Administration — Develop path planning methods that incorporate an approximate model of ocean currents in path planning for a range of autonomous marine vehicles such as surface...
Parallel Motion Simulation of Large-Scale Real-Time Crowd in a Hierarchical Environmental Model
Directory of Open Access Journals (Sweden)
Xin Wang
2012-01-01
Full Text Available This paper presents a parallel real-time crowd simulation method based on a hierarchical environmental model. A dynamical model of the complex environment should be constructed to simulate the state transition and propagation of individual motions. By modeling of a virtual environment where virtual crowds reside, we employ different parallel methods on a topological layer, a path layer and a perceptual layer. We propose a parallel motion path matching method based on the path layer and a parallel crowd simulation method based on the perceptual layer. The large-scale real-time crowd simulation becomes possible with these methods. Numerical experiments are carried out to demonstrate the methods and results.
A Hybrid 3D Path Planning Method for UAVs
DEFF Research Database (Denmark)
Ortiz-Arroyo, Daniel
2015-01-01
This paper presents a hybrid method for path planning in 3D spaces. We propose an improvement to a near-optimal 2D off-line algorithm and a flexible normalized on-line fuzzy controller to find shortest paths. Our method, targeted to low altitude domains, is simple and efficient. Our preliminary resu...
Real Time Radiation Monitoring Using Nanotechnology
Li, Jing (Inventor); Hanratty, James J. (Inventor); Wilkins, Richard T. (Inventor); Lu, Yijiang (Inventor)
2016-01-01
System and method for monitoring receipt and estimating flux value, in real time, of incident radiation, using two or more nanostructures (NSs) and associated terminals to provide closed electrical paths and to measure one or more electrical property change values .DELTA.EPV, associated with irradiated NSs, during a sequence of irradiation time intervals. Effects of irradiation, without healing and with healing, of the NSs, are separately modeled for first order and second order healing. Change values.DELTA.EPV are related to flux, to cumulative dose received by NSs, and to radiation and healing effectivity parameters and/or.mu., associated with the NS material and to the flux. Flux and/or dose are estimated in real time, based on EPV change values, using measured .DELTA.EPV values. Threshold dose for specified changes of biological origin (usually undesired) can be estimated. Effects of time-dependent radiation flux are analyzed in pre-healing and healing regimes.
Real-time Stitched Video for Contextual Path Planning
National Aeronautics and Space Administration — The crew and flight controllers who control the Space Station Remote Manipulator System (SSRMS) currently rely on multiple camera views to confirm or infer clearance...
A real-time intercepting beam-profile monitor for a medical cyclotron
Energy Technology Data Exchange (ETDEWEB)
Hendriks, C.; Uittenbosch, T.; Cameron, D.; Kellogg, S.; Gray, D.; Buckley, K.; Schaffer, P.; Verzilov, V.; Hoehr, C. [TRIUMF, 4004 Wesbrook Mall, Vancouver, British Columbia V6T 2A3 (Canada)
2013-11-15
There is a lack of real-time continuous beam-diagnostic tools for medical cyclotrons due to high power deposition during proton irradiation. To overcome this limitation, we have developed a profile monitor that is capable of providing continuous feedback about beam shape and current in real time while it is inserted in the beam path. This enables users to optimize the beam profile and observe fluctuations in the beam over time with periodic insertion of the monitor.
Static Profiling of the Worst-Case in Real-Time Programs
DEFF Research Database (Denmark)
Brandner, Florian; Hepp, Stefan; Jordan, Alexander
2012-01-01
With the increasing performance demand in real-time systems it becomes more and more relevant to provide feedback to engineers and programmers, but also software development tools, on the performance-relevant code parts of a real-time program. So far, the information provided to programmers through...... other code parts. To give an accurate view covering the entire code base, tools in the spirit of standard program profiling tools are required. This work proposes an efficient approach to compute worst-case timing information for all code parts of a program using a complementary metric, called...... criticality. Every statement of a real-time program is assigned a criticality value, expressing how critical the respective code is with respect to the global WCET. This gives an accurate view to programmers how close the worst execution path passing through a specific part of a real-time program...
A hybrid metaheuristic DE/CS algorithm for UCAV three-dimension path planning.
Wang, Gaige; Guo, Lihong; Duan, Hong; Wang, Heqi; Liu, Luo; Shao, Mingzhen
2012-01-01
Three-dimension path planning for uninhabited combat air vehicle (UCAV) is a complicated high-dimension optimization problem, which primarily centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. A new hybrid metaheuristic differential evolution (DE) and cuckoo search (CS) algorithm is proposed to solve the UCAV three-dimension path planning problem. DE is applied to optimize the process of selecting cuckoos of the improved CS model during the process of cuckoo updating in nest. The cuckoos can act as an agent in searching the optimal UCAV path. And then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic CS. The realization procedure for this hybrid metaheuristic approach DE/CS is also presented. In order to make the optimized UCAV path more feasible, the B-Spline curve is adopted for smoothing the path. To prove the performance of this proposed hybrid metaheuristic method, it is compared with basic CS algorithm. The experiment shows that the proposed approach is more effective and feasible in UCAV three-dimension path planning than the basic CS model.
76 FR 42536 - Real-Time System Management Information Program
2011-07-19
...-Time System Management Information Program AGENCY: Federal Highway Administration (FHWA), DOT. ACTION... Real-Time System Management Information Program and general information about current and planned... establishing requirements for the Real-Time System Management Information Program on November 8, 2010, at 75 FR...
International Nuclear Information System (INIS)
Calzetta, E.; Hu, B.L.
1987-01-01
We discuss the generalization to curved spacetime of a path-integral formalism of quantum field theory based on the sum over paths first going forward in time in the presence of one external source from an in vacuum to a state defined on a hypersurface of constant time in the future, and then backwards in time in the presence of a different source to the same in vacuum. This closed-time-path formalism which generalizes the conventional method based on in-out vacuum persistence amplitudes yields real and causal effective actions, field equations, and expectation values. We apply this method to two problems in semiclassical cosmology. First we study the back reaction of particle production in a radiation-filled Bianchi type-I universe with a conformal scalar field. Unlike the in-out formalism which yields complex geometries the real and causal effective action here yields equations for real effective geometries, with more readily interpretable results. It also provides a clear identification of particle production as a dissipative process in semiclassical theories. In the second problem we calculate the vacuum expectation value of the stress-energy tensor for a nonconformal massive λphi 4 theory in a Robertson-Walker universe. This study serves to illustrate the use of Feynman diagrams and higher-loop calculations in this formalism. It also demonstrates the economy of this method in the calculation of expectation values over the mode-sum Bogolubov transformation methods ordinarily applied to matrix elements calculated in the conventional in-out approach
Probabilistic Path Planning of Montgolfier Balloons in Strong, Uncertain Wind Fields
Wolf, Michael; Blackmore, James C.; Kuwata, Yoshiaki
2011-01-01
Lighter-than-air vehicles such as hot-air balloons have been proposed for exploring Saturn s moon Titan, as well as other bodies with significant atmospheres. For these vehicles to navigate effectively, it is critical to incorporate the effects of surrounding wind fields, especially as these winds will likely be strong relative to the control authority of the vehicle. Predictive models of these wind fields are available, and previous research has considered problems of planning paths subject to these predicted forces. However, such previous work has considered the wind fields as known a priori, whereas in practical applications, the actual wind vector field is not known exactly and may deviate significantly from the wind velocities estimated by the model. A probabilistic 3D path-planning algorithm was developed for balloons to use uncertain wind models to generate time-efficient paths. The nominal goal of the algorithm is to determine what altitude and what horizontal actuation, if any is available on the vehicle, to use to reach a particular goal location in the least expected time, utilizing advantageous winds. The solution also enables one to quickly evaluate the expected time-to-goal from any other location and to avoid regions of large uncertainty. This method is designed for balloons in wind fields but may be generalized for any buoyant vehicle operating in a vector field. To prepare the planning problem, the uncertainty in the wind field is modeled. Then, the problem of reaching a particular goal location is formulated as a Markov decision process (MDP) using a discretized space approach. Solving the MDP provides a policy of what actuation option (how much buoyancy change and, if applicable, horizontal actuation) should be selected at any given location to minimize the expected time-to-goal. The results provide expected time-to-goal values from any given location on the globe in addition to the action policy. This stochastic approach can also provide
Research on Navigation Path Planning for An Underground Load Haul Dump
Directory of Open Access Journals (Sweden)
Qi Yulong
2015-11-01
Full Text Available The improved A * algorithm is a method of navigation path planning for articulated underground scrapers. Firstly, an environment model based on a mining Geographic Information System (GIS map is established, and then combined with improved A * algorithm, the underground global path planning problem of the intelligent Load Haul Dump (LHD is solved. In this paper, for the articulated structure, the method of expanding nodes by articulation angle is adopted to make expanded nodes meet the trajectory characteristics. In addition, collision threat cost is introduced in the evaluation function to avoid collisions between the LHD and the tunnel walls. As peran analysis of the simulation test to verify the effectiveness of the improved A * algorithm and a comparison with the traditional A * algorithm, the improved A * algorithm can enhance search efficiency. Acontrast of multiple sets of test parameters suggests that when the price weighted coefficient of collision is 0.2, the shortest path can be derived to avoid impact. Finally, tracking results indicate that the proposed algorithm for navigation path planning can maintain the tracking error to within 0.2 m in line with the structural characteristics of the scraper in the laboratory environment to realize the path planning of unmanned scrapers and trajectory tracking. Moreover, the algorithm can enhance the safety of scrapers and prevent roadway collisions. The feasibility and practicality of the proposed method is verified in this work.
Energy Technology Data Exchange (ETDEWEB)
Tsauo, Jiaywei, E-mail: 80732059@qq.com; Luo, Xuefeng, E-mail: luobo-913@126.com [West China Hospital of Sichuan University, Institute of Interventional Radiology (China); Ye, Linchao, E-mail: linchao.ye@siemens.com [Siemens Ltd, Healthcare Sector (China); Li, Xiao, E-mail: simonlixiao@gmail.com [West China Hospital of Sichuan University, Institute of Interventional Radiology (China)
2015-06-15
PurposeThis study was designed to report our results with a modified technique of three-dimensional (3D) path planning software assisted transjugular intrahepatic portosystemic shunt (TIPS).Methods3D path planning software was recently developed to facilitate TIPS creation by using two carbon dioxide portograms acquired at least 20° apart to generate a 3D path for overlay needle guidance. However, one shortcoming is that puncturing along the overlay would be technically impossible if the angle of the liver access set and the angle of the 3D path are not the same. To solve this problem, a prototype 3D path planning software was fitted with a utility to calculate the angle of the 3D path. Using this, we modified the angle of the liver access set accordingly during the procedure in ten patients.ResultsFailure for technical reasons occurred in three patients (unsuccessful wedged hepatic venography in two cases, software technical failure in one case). The procedure was successful in the remaining seven patients, and only one needle pass was required to obtain portal vein access in each case. The course of puncture was comparable to the 3D path in all patients. No procedure-related complication occurred following the procedures.ConclusionsAdjusting the angle of the liver access set to match the angle of the 3D path determined by the software appears to be a favorable modification to the technique of 3D path planning software assisted TIPS.
Evolutionistic or revolutionary paths? A PACS maturity model for strategic situational planning.
van de Wetering, Rogier; Batenburg, Ronald; Lederman, Reeva
2010-07-01
While many hospitals are re-evaluating their current Picture Archiving and Communication System (PACS), few have a mature strategy for PACS deployment. Furthermore, strategies for implementation, strategic and situational planning methods for the evolution of PACS maturity are scarce in the scientific literature. Consequently, in this paper we propose a strategic planning method for PACS deployment. This method builds upon a PACS maturity model (PMM), based on the elaboration of the strategic alignment concept and the maturity growth path concept previously developed in the PACS domain. First, we review the literature on strategic planning for information systems and information technology and PACS maturity. Secondly, the PMM is extended by applying four different strategic perspectives of the Strategic Alignment Framework whereupon two types of growth paths (evolutionistic and revolutionary) are applied that focus on a roadmap for PMM. This roadmap builds a path to get from one level of maturity and evolve to the next. An extended method for PACS strategic planning is developed. This method defines eight distinctive strategies for PACS strategic situational planning that allow decision-makers in hospitals to decide which approach best suits their hospitals' current situation and future ambition and what in principle is needed to evolve through the different maturity levels. The proposed method allows hospitals to strategically plan for PACS maturation. It is situational in that the required investments and activities depend on the alignment between the hospital strategy and the selected growth path. The inclusion of both strategic alignment and maturity growth path concepts make the planning method rigorous, and provide a framework for further empirical research and clinical practice.
Methodology for using root locus technique for mobile robots path planning
Directory of Open Access Journals (Sweden)
Mario Ricardo Arbulú Saavedra
2015-11-01
Full Text Available This paper shows the analysis and the implementation methodology of the technique of dynamic systems roots location used in free-obstacle path planning for mobile robots. First of all, the analysis and morphologic behavior identification of the paths depending on roots location in complex plane are performed, where paths type and their attraction and repulsion features in the presence of other roots similarly to the obtained with artificial potential fields are identified. An implementation methodology for this technique of mobile robots path planning is proposed, starting from three different methods of roots location for obstacles in the scene. Those techniques change depending on the obstacle key points selected for roots, such as borders, crossing points with original path, center and vertices. Finally, a behavior analysis of general technique and the effectiveness of each tried method is performed, doing 20 tests for each one, obtaining a value of 65% for the selected method. Modifications and possible improvements to this methodology are also proposed.
Path planning of master-slave manipulator using graphic simulator
International Nuclear Information System (INIS)
Lee, J. Y.; Kim, S. H.; Song, T. K.; Park, B. S.; Yoon, J. S.
2002-01-01
To handle the high level radioactive materials such as spent fuels remotely, the master-slave manipulator is generally used as a remote handling equipment in the hot cell. To analyze the motion and to implement the training system by virtual reality technology, the simulator for M-S manipulator using the computer graphics is developed. The parts are modelled in 3-D graphics, assembled, and kinematics are assigned. The inverse kinematics of the manipulator is defined, and the slave of manipulator is coupled with master by the manipulator's specification. Also, the virtual work cell is implemented in the graphical environment which is the same as the real environment and the path planning method using the function of the collision detection for a manipulator are proposed. This graphic simulator of manipulator can be effectively used in designing of the maintenance processes for the hot cell equipment and enhance the reliability of the spent fuel management
Quo vadis? : persuasive computing using real time queue information
Meys, Wouter; Groen, Maarten
2014-01-01
By presenting tourists with real-time information an increase in efficiency and satisfaction of their day planning can be achieved. At the same time, real-time information services can offer the municipality the opportunity to spread the tourists throughout the city centre. An important factor for
Global optimal path planning of an autonomous vehicle for overtaking a moving obstacle
Directory of Open Access Journals (Sweden)
B. Mashadi
Full Text Available In this paper, the global optimal path planning of an autonomous vehicle for overtaking a moving obstacle is proposed. In this study, the autonomous vehicle overtakes a moving vehicle by performing a double lane-change maneuver after detecting it in a proper distance ahead. The optimal path of vehicle for performing the lane-change maneuver is generated by a path planning program in which the sum of lateral deviation of the vehicle from a reference path and the rate of steering angle become minimum while the lateral acceleration of vehicle does not exceed a safe limit value. A nonlinear optimal control theory with the lateral vehicle dynamics equations and inequality constraint of lateral acceleration are used to generate the path. The indirect approach for solving the optimal control problem is used by applying the calculus of variation and the Pontryagin's Minimum Principle to obtain first-order necessary conditions for optimality. The optimal path is generated as a global optimal solution and can be used as the benchmark of the path generated by the local motion planning of autonomous vehicles. A full nonlinear vehicle model in CarSim software is used for path following simulation by importing path data from the MATLAB code. The simulation results show that the generated path for the autonomous vehicle satisfies all vehicle dynamics constraints and hence is a suitable overtaking path for the following vehicle.
Decentralized flight trajectory planning of multiple aircraft
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...
International Nuclear Information System (INIS)
Falk, Marianne; Larsson, Tobias; Keall, Paul; Chul Cho, Byung; Aznar, Marianne; Korreman, Stine; Poulsen, Per; Munck af Rosenschoeld, Per
2012-01-01
Purpose: Real-time dynamic multileaf collimator (MLC) tracking for management of intrafraction tumor motion can be challenging for highly modulated beams, as the leaves need to travel far to adjust for target motion perpendicular to the leaf travel direction. The plan modulation can be reduced by using a leaf position constraint (LPC) that reduces the difference in the position of adjacent MLC leaves in the plan. The purpose of this study was to investigate the impact of the LPC on the quality of inversely optimized arc radiotherapy plans and the effect of the MLC motion pattern on the dosimetric accuracy of MLC tracking delivery. Specifically, the possibility of predicting the accuracy of MLC tracking delivery based on the plan modulation was investigated. Methods: Inversely optimized arc radiotherapy plans were created on CT-data of three lung cancer patients. For each case, five plans with a single 358 deg. arc were generated with LPC priorities of 0 (no LPC), 0.25, 0.5, 0.75, and 1 (highest possible LPC), respectively. All the plans had a prescribed dose of 2 Gy x 30, used 6 MV, a maximum dose rate of 600 MU/min and a collimator angle of 45 deg. or 315 deg. To quantify the plan modulation, an average adjacent leaf distance (ALD) was calculated by averaging the mean adjacent leaf distance for each control point. The linear relationship between the plan quality [i.e., the calculated dose distributions and the number of monitor units (MU)] and the LPC was investigated, and the linear regression coefficient as well as a two tailed confidence level of 95% was used in the evaluation. The effect of the plan modulation on the performance of MLC tracking was tested by delivering the plans to a cylindrical diode array phantom moving with sinusoidal motion in the superior-inferior direction with a peak-to-peak displacement of 2 cm and a cycle time of 6 s. The delivery was adjusted to the target motion using MLC tracking, guided in real-time by an infrared optical system
Indoor Localization of a Quadrotor Based on WSN: A Real-Time Application
Directory of Open Access Journals (Sweden)
Jose L. Rullan-Lara
2013-01-01
Full Text Available A real-time localization algorithm is presented in this paper. The algorithm presented here uses an extended Kalman filter and is based on Time Difference Of Arrivals (TDOA measurements of radio signal. The position and velocity of an Unmanned Aerial Vehicle (UAV are successfully estimated in closed-loop in real-time, both in hover and path following flights. Relatively small position errors obtained from the experiments prove the good performance of the proposed algorithm.
Real-time video quality monitoring
Liu, Tao; Narvekar, Niranjan; Wang, Beibei; Ding, Ran; Zou, Dekun; Cash, Glenn; Bhagavathy, Sitaram; Bloom, Jeffrey
2011-12-01
The ITU-T Recommendation G.1070 is a standardized opinion model for video telephony applications that uses video bitrate, frame rate, and packet-loss rate to measure the video quality. However, this model was original designed as an offline quality planning tool. It cannot be directly used for quality monitoring since the above three input parameters are not readily available within a network or at the decoder. And there is a great room for the performance improvement of this quality metric. In this article, we present a real-time video quality monitoring solution based on this Recommendation. We first propose a scheme to efficiently estimate the three parameters from video bitstreams, so that it can be used as a real-time video quality monitoring tool. Furthermore, an enhanced algorithm based on the G.1070 model that provides more accurate quality prediction is proposed. Finally, to use this metric in real-world applications, we present an example emerging application of real-time quality measurement to the management of transmitted videos, especially those delivered to mobile devices.
Energy Technology Data Exchange (ETDEWEB)
Ipsen, S [University of Luebeck, Luebeck, SH (Germany); University of Sydney, Camperdown (Australia); Blanck, O [CyberKnife Zentrum Norddeutschland, Guestrow, MV (Germany); Oborn, B [Illawarra Cancer Care Centre, Wollongong, NSW (Australia); Bode, F [Medical Clinic II, Section for Electrophysiology, UKSH, Luebeck, SH (Germany); Liney, G [Ingham Institute for Applied Medical Research, Liverpool, NSW (United Kingdom); Keall, P [University of Sydney, Camperdown (Australia)
2014-06-15
Purpose: Atrial fibrillation (AF) is the most common cardiac arrhythmia, affecting >2.5M Americans and >4.5M Europeans. AF is usually treated with minimally-invasive, time consuming catheter ablation techniques. Radiosurgery of the pulmonary veins (PV) has been proposed for AF treatment, however is challenging due to the complex respiratory and cardiac motion patterns. We hypothesize that an MRI-linac could solve the difficult real-time targeting and adaptation problem. In this study we quantified target motion ranges on cardiac MRI and analyzed the dosimetric benefits of margin reduction assuming real-time MRI tracking was applied. Methods: For the motion study, four human subjects underwent real-time cardiac MRI under free breathing. The target motion on coronal and axial cine planes was analyzed using a template matching algorithm. For the planning study, an ablation line at each PV antrum was defined as target on an AF patient scheduled for catheter ablation. Various safety margins ranging from 0mm (perfect tracking) to 8mm (untracked motion) were added to the target defining the PTV. 30Gy single fraction IMRT plans were then generated. Finally, the influence of a 1T magnetic field on treatment beam delivery was calculated using the Geant4 Monte Carlo algorithm to simulate the dosimetric impact of MRI guidance. Results: The motion study showed the mean respiratory motion of the target area on MRI was 8.4mm (SI), 1.7mm (AP) and 0.3mm (LR). Cardiac motion was small (<2mm). The planning study showed that with increasing safety margins to encompass untracked motion, dose tolerances for OARs such as the esophagus and airways were exceeded by >100%. The magnetic field had little impact on the dose distribution. Conclusion: Our results indicate that real-time MRI tracking of the PVs seems feasible. Accurate image guidance for high-dose AF radiosurgery is essential since safety margins covering untracked target motion will result in unacceptable treatment plans.
Path Tracking Control of Automatic Parking Cloud Model considering the Influence of Time Delay
Directory of Open Access Journals (Sweden)
Yiding Hua
2017-01-01
Full Text Available This paper establishes the kinematic model of the automatic parking system and analyzes the kinematic constraints of the vehicle. Furthermore, it solves the problem where the traditional automatic parking system model fails to take into account the time delay. Firstly, based on simulating calculation, the influence of time delay on the dynamic trajectory of a vehicle in the automatic parking system is analyzed under the transverse distance Dlateral between different target spaces. Secondly, on the basis of cloud model, this paper utilizes the tracking control of an intelligent path closer to human intelligent behavior to further study the Cloud Generator-based parking path tracking control method and construct a vehicle path tracking control model. Moreover, tracking and steering control effects of the model are verified through simulation analysis. Finally, the effectiveness and timeliness of automatic parking controller in the aspect of path tracking are tested through a real vehicle experiment.
Optimal Paths in Gliding Flight
Wolek, Artur
Underwater gliders are robust and long endurance ocean sampling platforms that are increasingly being deployed in coastal regions. This new environment is characterized by shallow waters and significant currents that can challenge the mobility of these efficient (but traditionally slow moving) vehicles. This dissertation aims to improve the performance of shallow water underwater gliders through path planning. The path planning problem is formulated for a dynamic particle (or "kinematic car") model. The objective is to identify the path which satisfies specified boundary conditions and minimizes a particular cost. Several cost functions are considered. The problem is addressed using optimal control theory. The length scales of interest for path planning are within a few turn radii. First, an approach is developed for planning minimum-time paths, for a fixed speed glider, that are sub-optimal but are guaranteed to be feasible in the presence of unknown time-varying currents. Next the minimum-time problem for a glider with speed controls, that may vary between the stall speed and the maximum speed, is solved. Last, optimal paths that minimize change in depth (equivalently, maximize range) are investigated. Recognizing that path planning alone cannot overcome all of the challenges associated with significant currents and shallow waters, the design of a novel underwater glider with improved capabilities is explored. A glider with a pneumatic buoyancy engine (allowing large, rapid buoyancy changes) and a cylindrical moving mass mechanism (generating large pitch and roll moments) is designed, manufactured, and tested to demonstrate potential improvements in speed and maneuverability.
International Nuclear Information System (INIS)
Kalolo, L.T.
2013-06-01
This research was carried out to investigate and compare the real-time and pre-plan implant at the Radiotherapy Department of the Korle Bu Teaching Hospital, Ghana. Prowess Panther 4.5 treatment planning system and variseed 7.2 software were used for pre-plan and real-time implant respectively. The study was conducted for eighty three (83) patients treated for prostate cancer through real-time implant brachytherapy between september, 2008 to April, 2013. Thirty one patients (31) patients whose ultrasound images were available were selected for the pre-plan study. The slices of ultrasound images were re-drawn on transparent A-4 sheets and later on scanned, contoured and registered in the treatment planning system (prowess 4.5). After planning, the volume to be implanted, total number of needles, seeds and the total activity of the source were displayed. Comparison was done withe the pre-plan and real-time implant. In both cases the variation was below 5% as recommended in dosimetry. About 30% - 40% of the imported seeds were left un-used due to over-estimation of seeds ordered from the manufacturer (BARD Company-USA). Hence this work (pre-plan) aims to solve this problem. The comparison for dosimetric parameters was assessed for prostate, urethra and rectum as (V 95%, V 100%, V 150%, D90Gy, D90%), (D90Gy, D90%, D30Gy, D30% ) and (V 100%, D30Gy and D30%) respectively and the variation were within the limit of ± 5%. Comparison of dosimetric values for this work were done with other institutions, like Karolinska university hospital, Sweden, The institute of Curie/ hospital Cochin Group Paris-France and European recommendations. The values reported at Korle - Bu teaching hospital (this work) were in good agreement with the international guidelines. (au)
Explaining How to Play Real-Time Strategy Games
Metoyer, Ronald; Stumpf, Simone; Neumann, Christoph; Dodge, Jonathan; Cao, Jill; Schnabel, Aaron
Real-time strategy games share many aspects with real situations in domains such as battle planning, air traffic control, and emergency response team management which makes them appealing test-beds for Artificial Intelligence (AI) and machine learning. End user annotations could help to provide supplemental information for learning algorithms, especially when training data is sparse. This paper presents a formative study to uncover how experienced users explain game play in real-time strategy games. We report the results of our analysis of explanations and discuss their characteristics that could support the design of systems for use by experienced real-time strategy game users in specifying or annotating strategy-oriented behavior.
Research and application of genetic algorithm in path planning of logistics distribution vehicle
Wang, Yong; Zhou, Heng; Wang, Ying
2017-08-01
The core of the logistics distribution system is the vehicle routing planning, research path planning problem, provide a better solution has become an important issue. In order to provide the decision support for logistics and distribution operations, this paper studies the problem of vehicle routing with capacity constraints (CVRP). By establishing a mathematical model, the genetic algorithm is used to plan the path of the logistics vehicle to meet the minimum logistics and transportation costs.
Badr, Salah M.; Bruztman, Donald P.; Nelson, Michael L.; Byrnes, Ronald Benton
1992-01-01
This paper presents an introduction to the basic issues involved in real-time systems. Both real-time operating sys and real-time programming languages are explored. Concurrent programming and process synchronization and communication are also discussed. The real-time requirements of the Naval Postgraduate School Autonomous Under Vehicle (AUV) are then examined. Autonomous underwater vehicle (AUV), hard real-time system, real-time operating system, real-time programming language, real-time sy...
Real-time PCR gene expression profiling
Czech Academy of Sciences Publication Activity Database
Kubista, Mikael; Sjögreen, B.; Forootan, A.; Šindelka, Radek; Jonák, Jiří; Andrade, J.M.
2007-01-01
Roč. 1, - (2007), s. 56-60 ISSN 1360-8606 R&D Projects: GA AV ČR KJB500520601 Institutional research plan: CEZ:AV0Z50520514 Keywords : real - time PCR, * expression profiling * statistical analysis Subject RIV: EB - Genetics ; Molecular Biology
Rapidly Exploring Random Trees Used for Mobile Robots Path Planning
Czech Academy of Sciences Publication Activity Database
Krejsa, Jiří; Věchet, S.
2005-01-01
Roč. 12, č. 4 (2005), s. 231-238 ISSN 1802-1484. [Mechatronics, Robotics and Biomechanics 2005. Třešť, 26.09.2005-29.09.2005] Institutional research plan: CEZ:AV0Z20760514 Keywords : path planning * mobile robot Subject RIV: JD - Computer Applications, Robotics
Using real-time stereopsis for mobile robot control
Bonasso, R. P.; Nishihara, H. K.
1991-02-01
This paper describes on-going work in using range and motion data generated at video-frame rates as the basis for long-range perception in a mobile robot. A current approach in the artificial intelligence community to achieve timecritical perception for situated reasoning is to use low-level perception for motor reflex-like activity and higher-level but more computationally intense perception for path planning reconnaissance and retrieval activities. Typically inclinometers and a compass or an infra-red beacon system provide stability and orientation maintenance and ultrasonic or infra-red sensors serve as proximity detectors for obstacle avoidance. For distant ranging and area occupancy determination active imaging systems such as laser scanners can be prohibitivtly expensive and heretofore passive systems typically performed more slowly than the cycle time of the control system causing the robot to halt periodically along its way. However a recent stereo system developed by Nishihara known as PRISM (Practical Real-time Imaging Stereo Matcher) matches stereo pairs using a sign-correlation technique that gives range and motion at video frame rates. We are integrating this technique with constant-time control software for distant ranging and object detection at a speed that is comparable with the cycle-times of the low-level sensors. Possibilities for a variety of uses in a leader-follower mobile robot situation are discussed.
Global and Local Path Planning Study in a ROS-Based Research Platform for Autonomous Vehicles
Directory of Open Access Journals (Sweden)
Pablo Marin-Plaza
2018-01-01
Full Text Available The aim of this work is to integrate and analyze the performance of a path planning method based on Time Elastic Bands (TEB in real research platform based on Ackermann model. Moreover, it will be proved that all modules related to the navigation can coexist and work together to achieve the goal point without any collision. The study is done by analyzing the trajectory generated from global and local planners. The software prototyping tool is Robot Operating System (ROS from Open Source Robotics Foundation and the research platform is the iCab (Intelligent Campus Automobile from University Carlos III. This work has been validated from a test inside the campus where the iCab has performed the navigation between the starting point and the goal point without any collision. During the experiment, we proved the low sensitivity of the TEB method to variations of the vehicle model configuration and constraints.
Safe Maritime Autonomous Path Planning in a High Sea State
Ono, Masahiro; Quadrelli, Marco; Huntsberger, Terrance L.
2014-01-01
This paper presents a path planning method for sea surface vehicles that prevents capsizing and bow-diving in a high sea-state. A key idea is to use response amplitude operators (RAOs) or, in control terminology, the transfer functions from a sea state to a vessel's motion, in order to find a set of speeds and headings that results in excessive pitch and roll oscillations. This information is translated to arithmetic constraints on the ship's velocity, which are passed to a model predictive control (MPC)-based path planner to find a safe and optimal path that achieves specified goals. An obstacle avoidance capability is also added to the path planner. The proposed method is demonstrated by simulations.
Making planned paths look more human-like in humanoid robot manipulation planning
DEFF Research Database (Denmark)
Zacharias, F.; Schlette, C.; Schmidt, F.
2011-01-01
It contradicts the human's expectations when humanoid robots move awkwardly during manipulation tasks. The unnatural motion may be caused by awkward start or goal configurations or by probabilistic path planning processes that are often used. This paper shows that the choice of an arm's target...... for the robot arm....
Path probabilities of continuous time random walks
International Nuclear Information System (INIS)
Eule, Stephan; Friedrich, Rudolf
2014-01-01
Employing the path integral formulation of a broad class of anomalous diffusion processes, we derive the exact relations for the path probability densities of these processes. In particular, we obtain a closed analytical solution for the path probability distribution of a Continuous Time Random Walk (CTRW) process. This solution is given in terms of its waiting time distribution and short time propagator of the corresponding random walk as a solution of a Dyson equation. Applying our analytical solution we derive generalized Feynman–Kac formulae. (paper)
Real-time flight test data distribution and display
Nesel, Michael C.; Hammons, Kevin R.
1988-01-01
Enhancements to the real-time processing and display systems of the NASA Western Aeronautical Test Range are described. Display processing has been moved out of the telemetry and radar acquisition processing systems super-minicomputers into user/client interactive graphic workstations. Real-time data is provided to the workstations by way of Ethernet. Future enhancement plans include use of fiber optic cable to replace the Ethernet.
Real-time operating system timing jitter and its impact on motor control
Proctor, Frederick M.; Shackleford, William P.
2001-12-01
General-purpose microprocessors are increasingly being used for control applications due to their widespread availability and software support for non-control functions like networking and operator interfaces. Two classes of real-time operating systems (RTOS) exist for these systems. The traditional RTOS serves as the sole operating system, and provides all OS services. Examples include ETS, LynxOS, QNX, Windows CE and VxWorks. RTOS extensions add real-time scheduling capabilities to non-real-time OSes, and provide minimal services needed for the time-critical portions of an application. Examples include RTAI and RTL for Linux, and HyperKernel, OnTime and RTX for Windows NT. Timing jitter is an issue in these systems, due to hardware effects such as bus locking, caches and pipelines, and software effects from mutual exclusion resource locks, non-preemtible critical sections, disabled interrupts, and multiple code paths in the scheduler. Jitter is typically on the order of a microsecond to a few tens of microseconds for hard real-time operating systems, and ranges from milliseconds to seconds in the worst case for soft real-time operating systems. The question of its significance on the performance of a controller arises. Naturally, the smaller the scheduling period required for a control task, the more significant is the impact of timing jitter. Aside from this intuitive relationship is the greater significance of timing on open-loop control, such as for stepper motors, than for closed-loop control, such as for servo motors. Techniques for measuring timing jitter are discussed, and comparisons between various platforms are presented. Techniques to reduce jitter or mitigate its effects are presented. The impact of jitter on stepper motor control is analyzed.
Robotic Online Path Planning on Point Cloud.
Liu, Ming
2016-05-01
This paper deals with the path-planning problem for mobile wheeled- or tracked-robot which drive in 2.5-D environments, where the traversable surface is usually considered as a 2-D-manifold embedded in a 3-D ambient space. Specially, we aim at solving the 2.5-D navigation problem using raw point cloud as input. The proposed method is independent of traditional surface parametrization or reconstruction methods, such as a meshing process, which generally has high-computational complexity. Instead, we utilize the output of 3-D tensor voting framework on the raw point clouds. The computation of tensor voting is accelerated by optimized implementation on graphics computation unit. Based on the tensor voting results, a novel local Riemannian metric is defined using the saliency components, which helps the modeling of the latent traversable surface. Using the proposed metric, we prove that the geodesic in the 3-D tensor space leads to rational path-planning results by experiments. Compared to traditional methods, the results reveal the advantages of the proposed method in terms of smoothing the robot maneuver while considering the minimum travel distance.
Real-time motion-adaptive-optimization (MAO) in TomoTherapy
Energy Technology Data Exchange (ETDEWEB)
Lu Weiguo; Chen Mingli; Ruchala, Kenneth J; Chen Quan; Olivera, Gustavo H [TomoTherapy Inc., 1240 Deming Way, Madison, WI (United States); Langen, Katja M; Kupelian, Patrick A [MD Anderson Cancer Center-Orlando, Orlando, FL (United States)], E-mail: wlu@tomotherapy.com
2009-07-21
IMRT delivery follows a planned leaf sequence, which is optimized before treatment delivery. However, it is hard to model real-time variations, such as respiration, in the planning procedure. In this paper, we propose a negative feedback system of IMRT delivery that incorporates real-time optimization to account for intra-fraction motion. Specifically, we developed a feasible workflow of real-time motion-adaptive-optimization (MAO) for TomoTherapy delivery. TomoTherapy delivery is characterized by thousands of projections with a fast projection rate and ultra-fast binary leaf motion. The technique of MAO-guided delivery calculates (i) the motion-encoded dose that has been delivered up to any given projection during the delivery and (ii) the future dose that will be delivered based on the estimated motion probability and future fluence map. These two pieces of information are then used to optimize the leaf open time of the upcoming projection right before its delivery. It consists of several real-time procedures, including 'motion detection and prediction', 'delivered dose accumulation', 'future dose estimation' and 'projection optimization'. Real-time MAO requires that all procedures are executed in time less than the duration of a projection. We implemented and tested this technique using a TomoTherapy (registered) research system. The MAO calculation took about 100 ms per projection. We calculated and compared MAO-guided delivery with two other types of delivery, motion-without-compensation delivery (MD) and static delivery (SD), using simulated 1D cases, real TomoTherapy plans and the motion traces from clinical lung and prostate patients. The results showed that the proposed technique effectively compensated for motion errors of all test cases. Dose distributions and DVHs of MAO-guided delivery approached those of SD, for regular and irregular respiration with a peak-to-peak amplitude of 3 cm, and for medium and large
Real-time motion-adaptive-optimization (MAO) in TomoTherapy
International Nuclear Information System (INIS)
Lu Weiguo; Chen Mingli; Ruchala, Kenneth J; Chen Quan; Olivera, Gustavo H; Langen, Katja M; Kupelian, Patrick A
2009-01-01
IMRT delivery follows a planned leaf sequence, which is optimized before treatment delivery. However, it is hard to model real-time variations, such as respiration, in the planning procedure. In this paper, we propose a negative feedback system of IMRT delivery that incorporates real-time optimization to account for intra-fraction motion. Specifically, we developed a feasible workflow of real-time motion-adaptive-optimization (MAO) for TomoTherapy delivery. TomoTherapy delivery is characterized by thousands of projections with a fast projection rate and ultra-fast binary leaf motion. The technique of MAO-guided delivery calculates (i) the motion-encoded dose that has been delivered up to any given projection during the delivery and (ii) the future dose that will be delivered based on the estimated motion probability and future fluence map. These two pieces of information are then used to optimize the leaf open time of the upcoming projection right before its delivery. It consists of several real-time procedures, including 'motion detection and prediction', 'delivered dose accumulation', 'future dose estimation' and 'projection optimization'. Real-time MAO requires that all procedures are executed in time less than the duration of a projection. We implemented and tested this technique using a TomoTherapy (registered) research system. The MAO calculation took about 100 ms per projection. We calculated and compared MAO-guided delivery with two other types of delivery, motion-without-compensation delivery (MD) and static delivery (SD), using simulated 1D cases, real TomoTherapy plans and the motion traces from clinical lung and prostate patients. The results showed that the proposed technique effectively compensated for motion errors of all test cases. Dose distributions and DVHs of MAO-guided delivery approached those of SD, for regular and irregular respiration with a peak-to-peak amplitude of 3 cm, and for medium and large prostate motions. The results conceptually
Real-time electricity pricing mechanism in China based on system dynamics
International Nuclear Information System (INIS)
He, Yongxiu; Zhang, Jixiang
2015-01-01
Highlights: • The system dynamics is used to research the real-time electricity pricing mechanism. • Four kinds of the real-time electricity pricing models are carried out and simulated. • It analysed the electricity price, the user satisfaction and the social benefits under the different models. • Market pricing is the trend of the real-time electricity pricing mechanism. • Initial development path of the real-time price mechanism for China is designed between 2015 and 2030. - Abstract: As an important means of demand-side response, the reasonable formulation of the electricity price mechanism will have an important impact on the balance between the supply and demand of electric power. With the introduction of Chinese intelligence apparatus and the rapid development of smart grids, real-time electricity pricing, as the frontier electricity pricing mechanism in the smart grid, will have great significance on the promotion of energy conservation and the improvement of the total social surplus. From the perspective of system dynamics, this paper studies different real-time electricity pricing mechanisms based on load structure, cost structure and bidding and analyses the situation of user satisfaction and the total social surplus under different pricing mechanisms. Finally, through the comparative analysis of examples under different real-time pricing scenarios, this paper aims to explore and design the future dynamic real-time electricity pricing mechanism in China, predicts the dynamic real-time pricing level and provides a reference for real-time electricity price promotion in the future
Subsurface Scattering-Based Object Rendering Techniques for Real-Time Smartphone Games
Directory of Open Access Journals (Sweden)
Won-Sun Lee
2014-01-01
Full Text Available Subsurface scattering that simulates the path of a light through the material in a scene is one of the advanced rendering techniques in the field of computer graphics society. Since it takes a number of long operations, it cannot be easily implemented in real-time smartphone games. In this paper, we propose a subsurface scattering-based object rendering technique that is optimized for smartphone games. We employ our subsurface scattering method that is utilized for a real-time smartphone game. And an example game is designed to validate how the proposed method can be operated seamlessly in real time. Finally, we show the comparison results between bidirectional reflectance distribution function, bidirectional scattering distribution function, and our proposed subsurface scattering method on a smartphone game.
The force control and path planning of electromagnetic induction-based massage robot.
Wang, Wendong; Zhang, Lei; Li, Jinzhe; Yuan, Xiaoqing; Shi, Yikai; Jiang, Qinqin; He, Lijing
2017-07-20
Massage robot is considered as an effective physiological treatment to relieve fatigue, improve blood circulation, relax muscle tone, etc. The simple massage equipment quickly spread into market due to low cost, but they are not widely accepted due to restricted massage function. Complicated structure and high cost caused difficulties for developing multi-function massage equipment. This paper presents a novel massage robot which can achieve tapping, rolling, kneading and other massage operations, and proposes an improved reciprocating path planning algorithm to improve massage effect. The number of coil turns, the coil current and the distance between massage head and yoke were chosen to investigate the influence on massage force by finite element method. The control system model of the wheeled massage robot was established, including control subsystem of the motor, path algorithm control subsystem, parameter module of the massage robot and virtual reality interface module. The improved reciprocating path planning algorithm was proposed to improve regional coverage rate and massage effect. The influence caused by coil current, the number of coil turns and the distance between massage head and yoke were simulated in Maxwell. It indicated that coil current has more important influence compared to the other two factors. The path planning simulation of the massage robot was completed in Matlab, and the results show that the improved reciprocating path planning algorithm achieved higher coverage rate than the traditional algorithm. With the analysis of simulation results, it can be concluded that the number of coil turns and the distance between the moving iron core and the yoke could be determined prior to coil current, and the force can be controllable by optimizing structure parameters of massage head and adjusting coil current. Meanwhile, it demonstrates that the proposed algorithm could effectively improve path coverage rate during massage operations, therefore
Towards Real-Time Distributed Planning in Multi-Robot Systems
Abdelkader, Mohamed
2018-01-01
of extensive information exchange (communication). The extensive communication between robots can result in decision delays because of which distributed architecture is often impractical for systems with strict real-time constraints, e.g. when decisions have
Real-time Energy Resource Scheduling considering a Real Portuguese Scenario
DEFF Research Database (Denmark)
Silva, Marco; Sousa, Tiago; Morais, Hugo
2014-01-01
The development in power systems and the introduction of decentralized gen eration and Electric Vehicles (EVs), both connected to distribution networks, represents a major challenge in the planning and operation issues. This new paradigm requires a new energy resources management approach which...... scheduling in smart grids, considering day - ahead, hour - ahead and real - time scheduling. The case study considers a 33 - bus distribution network with high penetration of distributed energy resources . The wind generation profile is base d o n a rea l Portuguese wind farm . Four scenarios are presented...... taking into account 0, 1, 2 and 5 periods (hours or minutes) ahead of the scheduling period in the hour - ahead and real - time scheduling...
Aircraft Fault Detection Using Real-Time Frequency Response Estimation
Grauer, Jared A.
2016-01-01
A real-time method for estimating time-varying aircraft frequency responses from input and output measurements was demonstrated. The Bat-4 subscale airplane was used with NASA Langley Research Center's AirSTAR unmanned aerial flight test facility to conduct flight tests and collect data for dynamic modeling. Orthogonal phase-optimized multisine inputs, summed with pilot stick and pedal inputs, were used to excite the responses. The aircraft was tested in its normal configuration and with emulated failures, which included a stuck left ruddervator and an increased command path latency. No prior knowledge of a dynamic model was used or available for the estimation. The longitudinal short period dynamics were investigated in this work. Time-varying frequency responses and stability margins were tracked well using a 20 second sliding window of data, as compared to a post-flight analysis using output error parameter estimation and a low-order equivalent system model. This method could be used in a real-time fault detection system, or for other applications of dynamic modeling such as real-time verification of stability margins during envelope expansion tests.
Programming real-time executives in higher order language
Foudriat, E. C.
1982-01-01
Methods by which real-time executive programs can be implemented in a higher order language are discussed, using HAL/S and Path Pascal languages as program examples. Techniques are presented by which noncyclic tasks can readily be incorporated into the executive system. Situations are shown where the executive system can fail to meet its task scheduling and yet be able to recover either by rephasing the clock or stacking the information for later processing. The concept of deadline processing is shown to enable more effective mixing of time and information synchronized systems.
Real-Time Motion Management of Prostate Cancer Radiotherapy
DEFF Research Database (Denmark)
Pommer, Tobias
of this thesis is to manage prostate motion in real-time by aligning the radiation beam to the prostate using the novel dynamic multileaf collimator (DMLC) tracking method. Specifically, the delivered dose with tracking was compared to the planned dose, and the impact of treatment plan complexity and limitations...
Path Planning & Measurement Registration for Robotic Structural Asset Monitoring
Pierce , Stephen Gareth; Macleod , Charles Norman; Dobie , Gordon; Summan , Rahul
2014-01-01
International audience; The move to increased levels of autonomy for robotic delivery of inspection for asset monitoring, demands a structured approach to path planning and measurement data presentation that greatly surpasses the more ad‐,hoc approach typically employed by remotely controlled, but manually driven robotic inspection vehicles. The authors describe a traditional CAD/CAM approach to motion planning (as used in machine tool operation) which has numerous benefits including the...
A Lean Approach for Real-Time Planning and Monitoring in Engineer-to-Order Construction Projects
Directory of Open Access Journals (Sweden)
Patrick Dallasega
2018-03-01
Full Text Available Engineer-to-order (ETO construction companies are characterized by an off-site and on-site production. Often, budget deviations for installation works on-site are identified in a late stage when improvement actions cannot be applied anymore. Consequently, installation tasks are often affected by significant delays and/or reworks. This work proposes a “real-time” capable approach for planning and monitoring in construction and a corresponding information technology (IT framework. The core is represented by the so-called “pitching” concept known from lean management, which breaks down large job orders into smaller controllable parts. It can be considered as the main enabler for gathering management information in real-time and to identify problems and their causes on time. The most noticeable consequence lies in smaller jobs and a software-aided punctual control that allows a better rescheduling capability and, thus reduced, delays. A case study is provided, showing how the model was applied and validated in an ETO façade supplier company.
Energy Technology Data Exchange (ETDEWEB)
FINGER,JOHN T.; MANSURE,ARTHUR J.; PRAIRIE,MICHAEL R.; GLOWKA,D.A.
2000-02-01
This proposal provides the rationale for an advanced system called Diagnostics-while-drilling (DWD) and describes its benefits, preliminary configuration, and essential characteristics. The central concept is a closed data circuit in which downhole sensors collect information and send it to the surface via a high-speed data link, where it is combined with surface measurements and processed through drilling advisory software. The driller then uses this information to adjust the drilling process, sending control signals back downhole with real-time knowledge of their effects on performance. The report presents background of related previous work, and defines a Program Plan for US Department of Energy (DOE), university, and industry cooperation.
Research and Implementation of Robot Path Planning Based onVSLAM
Directory of Open Access Journals (Sweden)
Wang Zi-Qiang
2018-01-01
Full Text Available In order to solve the problem of warehouse logistics robots planpath in different scenes, this paper proposes a method based on visual simultaneous localization and mapping (VSLAM to build grid map of different scenes and use A* algorithm to plan path on the grid map. Firstly, we use VSLAMto reconstruct the environment in three-dimensionally. Secondly, based on the three-dimensional environment data, we calculate the accessibility of each grid to prepare occupied grid map (OGM for terrain description. Rely on the terrain information, we use the A* algorithm to solve path planning problem. We also optimize the A* algorithm and improve algorithm efficiency. Lastly, we verify the effectiveness and reliability of the proposed method by simulation and experimental results.
Using Sun’s Java Real-Time System to Manage Behavior-Based Mobile Robot Controllers
Directory of Open Access Journals (Sweden)
Andrew McKenzie
2011-01-01
Full Text Available Implementing a robot controller that can effectively manage limited resources in a deterministic, real-time manner is challenging. Behavior-based architectures that decompose autonomy into levels of intelligence are popular due to their robustness but do not provide real-time features that enforce timing constraints or support determinism. We propose an architecture and approach for using the real-time features of the Real-Time Specification for Java (RTSJ in a behavior-based mobile robot controller to show that timing constraints affect performance. This is accomplished by extending a real-time aware architecture that explicitly enumerates timing requirements for each behavior. It is not enough to reduce latency. The usefulness of this approach is demonstrated via an implementation on Solaris 10 and the Sun Java Real-Time System (Java RTS. Experimental results are obtained using a K-team Koala robot performing path following with four composite behaviors. Experiments were conducted using several task period sets in three cases: real-time threads with the real-time garbage collector, real-time threads with the non- real-time garbage collector, and non-real-time threads with the non-real-time garbage collector. Results show that even if latency and determinism are improved, the timing of each individual behavior significantly affects task performance.
Current-Sensitive Path Planning for an Underactuated Free-Floating Ocean Sensorweb
Dahl, Kristen P.; Thompson, David R.; McLaren, David; Chao, Yi; Chien, Steve
2011-01-01
This work investigates multi-agent path planning in strong, dynamic currents using thousands of highly under-actuated vehicles. We address the specific task of path planning for a global network of ocean-observing floats. These submersibles are typified by the Argo global network consisting of over 3000 sensor platforms. They can control their buoyancy to float at depth for data collection or rise to the surface for satellite communications. Currently, floats drift at a constant depth regardless of the local currents. However, accurate current forecasts have become available which present the possibility of intentionally controlling floats' motion by dynamically commanding them to linger at different depths. This project explores the use of these current predictions to direct float networks to some desired final formation or position. It presents multiple algorithms for such path optimization and demonstrates their advantage over the standard approach of constant-depth drifting.
Real-time support for precision excavation of radionuclide-contaminated soils
International Nuclear Information System (INIS)
Durham, L. A.; Johnson, R. L.
2003-01-01
Traditional approaches to excavation design for sites with radionuclide-contaminated soils generally involve work plans with fixed excavation footprints and post-excavation verification sampling. Recent advancements in real-time data collection systems, combined with data loggers, location control systems, and secure project-support Web sites, allow for an alternative, more precise approach to excavation design and implementation. In this mode, traditional work plans are replaced with dynamic work plans. Excavation efforts are organized by lift, with real-time dig face screening performed and the data for each lift analyzed, before excavation continues. Rather than specifying excavation footprints, dynamic work plans identify the decision logic that will be used to determine footprints based on real-time data collection. The level of investment in excavation support data collection can be balanced against potential cost savings realized through waste stream minimization. Secure project support Web sites ensure that data sets generated during the remediation process are readily accessible to all who need to see them, whether they are on site or not. These include regulators, program managers, and technical support staff. This type of Web site allows for quick problem resolution, increased transparency in field decision making, and more efficient allocation of expensive technical staff time
Real-time multiple image manipulations
International Nuclear Information System (INIS)
Arenson, J.S.; Shalev, S.; Legris, J.; Goertzen, Y.
1984-01-01
There are many situations in which it is desired to manipulate two or more images under real-time operator control. The authors have investigated a number of such cases in order to determine their value and applicability in clinical medicine and laboratory research. Several examples are presented in detail. The DICOM-8 video image computer system was used due to its capability of storing two 512 x 512 x 8 bit images and operating on them, and/or an incoming video frame, with any of a number of real time operations including addition, subtraction, inversion, averaging, logical AND, NAND, OR, NOR, NOT, XOR and XNOR, as well as combinations of these. Some applications involve manipulations of or among the stored images. In others, a stored image is used as a mask or template for positioning or adjusting a second image to be grabbed via a video camera. The accuracy of radiotherapy treatment is verified by comparing port films with the original radiographic planning film, which is previously digitized and stored. Moving the port film on the light box while viewing the real-time subtraction image allows for adjustments of zoom, translation and rotation, together with contrast and edge enhancement
Improvement of sampling plans for Salmonella detection in pooled table eggs by use of real-time PCR
DEFF Research Database (Denmark)
Pasquali, Frédérique; De Cesare, Alessandra; Valero, Antonio
2014-01-01
Eggs and egg products have been described as the most critical food vehicles of salmonellosis. The prevalence and level of contamination of Salmonella on table eggs are low, which severely affects the sensitivity of sampling plans applied voluntarily in some European countries, where one to five...... pools of 10 eggs are tested by the culture based reference method ISO 6579:2004. In the current study we have compared the testing-sensitivity of the reference culture method ISO 6579:2004 and an alternative real-time PCR method on Salmonella contaminated egg-pool of different sizes (4-9 uninfected eggs...... mixed with one contaminated egg) and contamination levels (10°-10(1), 10(1)-10(2), 10(2)-10(3)CFU/eggshell). Two hundred and seventy samples corresponding to 15 replicates per pool size and inoculum level were tested. At the lowest contamination level real-time PCR detected Salmonella in 40...
Axial Tomography from Digitized Real Time Radiography
Zolnay, A. S.; McDonald, W. M.; Doupont, P. A.; McKinney, R. L.; Lee, M. M.
1985-01-18
Axial tomography from digitized real time radiographs provides a useful tool for industrial radiography and tomography. The components of this system are: x-ray source, image intensifier, video camera, video line extractor and digitizer, data storage and reconstruction computers. With this system it is possible to view a two dimensional x-ray image in real time at each angle of rotation and select the tomography plane of interest by choosing which video line to digitize. The digitization of a video line requires less than a second making data acquisition relatively short. Further improvements on this system are planned and initial results are reported.
Real-time pedestrian detection with the videos of car camera
Directory of Open Access Journals (Sweden)
Yunling Zhang
2015-12-01
Full Text Available Pedestrians in the vehicle path are in danger of being hit, thus causing severe injury to pedestrians and vehicle occupants. Therefore, real-time pedestrian detection with the video of vehicle-mounted camera is of great significance to vehicle–pedestrian collision warning and traffic safety of self-driving car. In this article, a real-time scheme was proposed based on integral channel features and graphics processing unit. The proposed method does not need to resize the input image. Moreover, the computationally expensive convolution of the detectors and the input image was converted into the dot product of two larger matrixes, which can be computed effectively using a graphics processing unit. The experiments showed that the proposed method could be employed to detect pedestrians in the video of car camera at 20+ frames per second with acceptable error rates. Thus, it can be applied in real-time detection tasks with the videos of car camera.
Index summation in real time statistical field theory
International Nuclear Information System (INIS)
Carrington, M.E.; Fugleberg, T.; Irvine, D.S.; Pickering, D.
2007-01-01
We have written a Mathematica program that calculates the integrand corresponding to any amplitude in the closed-time-path formulation of real time statistical field theory. The program is designed so that it can be used by someone with no previous experience with Mathematica. It performs the contractions over the tensor indices that appear in real time statistical field theory and gives the result in the 1-2, Keldysh or RA basis. The program treats all fields as scalars, but the result can be applied to theories with dirac and lorentz structure by making simple adjustments. As an example, we have used the program to calculate the ward identity for the QED 3-point function, the QED 4-point function for two photons and two fermions, and the QED 5-point function for three photons and two fermions. In real time statistical field theory, there are seven 3-point functions, 15 4-point functions and 31 5-point functions. We produce a table that gives the results for all of these functions. In addition, we give a simple general expression for the KMS conditions between n-point green functions and vertex functions, in both the Keldysh and RA bases. (orig.)
TP-Space RRT – Kinematic Path Planning of Non-Holonomic Any-Shape Vehicles
Directory of Open Access Journals (Sweden)
Jose Luis Blanco
2015-05-01
Full Text Available The autonomous navigation of vehicles typically combines two kinds of methods: a path is first planned, and then the robot is driven by a local obstacle-avoidance controller. The present work, which focuses on path planning, proposes an extension to the well-known rapidly-exploring random tree (RRT algorithm to allow its integration with a trajectory parameter-space (TP-space as an efficient method to detect collision-free, kinematically-feasible paths for arbitrarily-shaped vehicles. In contrast to original RRT, this proposal generates navigation trees, with poses as nodes, whose edges are all kinematically-feasible paths, suitable to being accurately followed by vehicles driven by pure reactive algorithms. Initial experiments demonstrate the suitability of the method with an Ackermann-steering vehicle model whose severe kinematic constraints cannot be obviated. An important result that sets this work apart from previous research is the finding that employing several families of potential trajectories to expand the tree, which can be done efficiently under the TP-space formalism, improves the optimality of the planned trajectories. A reference C++ implementation has been released as open-source.
Age differences in virtual environment and real world path integration
Directory of Open Access Journals (Sweden)
Diane E Adamo
2012-09-01
Full Text Available Accurate path integration requires the integration of visual, proprioceptive, and vestibular self-motion cues and age effects associated with alterations in processing information from these systems may contribute to declines in path integration abilities. The present study investigated age-related differences in path integration in conditions that varied as a function of available sources of sensory information. Twenty-two healthy, young (23.8 ± 3.0 yrs. and 16 older (70.1 ± 6.4 yrs. adults participated in distance reproduction and triangle completion tasks performed in a virtual environment and two real world conditions: guided walking and wheelchair propulsion. For walking and wheelchair propulsion conditions, participants wore a blindfold and wore noise-blocking headphones and were guided through the workspace by the experimenter. For the virtual environment (VE condition, participants viewed self-motion information on a computer monitor and used a joystick to navigate through the environment. For triangle completion tasks, older compared to younger individuals showed greater errors in rotation estimations performed in the wheelchair condition; and for rotation and distance estimations in the VE condition. Distance reproduction tasks, in contrast, did not show any age effects. These findings demonstrate that age differences in path integration vary as a function of the available sources of information and by the complexity of outbound pathway.
Directory of Open Access Journals (Sweden)
Yueyue Deng
2013-01-01
Full Text Available Dynamic and unstructured multiple cooperative autonomous underwater vehicle (AUV missions are highly complex operations, and task allocation and path planning are made significantly more challenging under realistic underwater acoustic communication constraints. This paper presents a solution for the task allocation and path planning for multiple AUVs under marginal acoustic communication conditions: a location-aided task allocation framework (LAAF algorithm for multitarget task assignment and the grid-based multiobjective optimal programming (GMOOP mathematical model for finding an optimal vehicle command decision given a set of objectives and constraints. Both the LAAF and GMOOP algorithms are well suited in poor acoustic network condition and dynamic environment. Our research is based on an existing mobile ad hoc network underwater acoustic simulator and blind flooding routing protocol. Simulation results demonstrate that the location-aided auction strategy performs significantly better than the well-accepted auction algorithm developed by Bertsekas in terms of task-allocation time and network bandwidth consumption. We also demonstrate that the GMOOP path-planning technique provides an efficient method for executing multiobjective tasks by cooperative agents with limited communication capabilities. This is in contrast to existing multiobjective action selection methods that are limited to networks where constant, reliable communication is assumed to be available.
Allen, Phillip G.
1985-12-01
The call for abolishing photo reconnaissance in favor of real time is once more being heard. Ten years ago the same cries were being heard with the introduction of the Charge Coupled Device (CCD). The real time system problems that existed then and stopped real time proliferation have not been solved. The lack of an organized program by either DoD or industry has hampered any efforts to solve the problems, and as such, very little has happened in real time in the last ten years. Real time is not a replacement for photo, just as photo is not a replacement for infra-red or radar. Operational real time sensors can be designed only after their role has been defined and improvements made to the weak links in the system. Plodding ahead on a real time reconnaissance suite without benefit of evaluation of utility will allow this same paper to be used ten years from now.
Globally Optimal Path Planning with Anisotropic Running Costs
2013-03-01
Eikonal equation and has numerous applications, for exam- ple, in path planning, computational geometry, computer vision, and image enhancement...Sethian 1999b]. Numerical methods for solving the Eikonal equation include Tsitsiklis’ control-theoretic algorithm [Tsitsiklis 1995], Fast Marching Methods...methods for Eikonal equations on triangular meshes, SIAM J. Numer. Anal. 45(1), 83—107. Rowe, M. P., Sidhu, H. S. & Mercer, G. N. (2009) Military
International Nuclear Information System (INIS)
Zhang Peng; Hugo, Geoffrey D.; Yan Di
2008-01-01
Purpose: Real-time target tracking (RT-TT) and four-dimensional inverse planning (4D-IP) are two potential methods to manage respiratory target motion. In this study, we evaluated each method using the cumulative dose-volume criteria in lung cancer radiotherapy. Methods and Materials: Respiration-correlated computed tomography scans were acquired for 4 patients. Deformable image registration was applied to generate a displacement mapping for each phase image of the respiration-correlated computed tomography images. First, the dose distribution for the organs of interest obtained from an idealized RT-TT technique was evaluated, assuming perfect knowledge of organ motion and beam tracking. Inverse planning was performed on each phase image separately. The treatment dose to the organs of interest was then accumulated from the optimized plans. Second, 4D-IP was performed using the probability density function of respiratory motion. The beam arrangement, prescription dose, and objectives were consistent in both planning methods. The dose-volume and equivalent uniform dose in the target volume, lung, heart, and spinal cord were used for the evaluation. Results: The cumulative dose in the target was similar for both techniques. The equivalent uniform dose of the lung, heart, and spinal cord was 4.6 ± 2.2, 11 ± 4.4, and 11 ± 6.6 Gy for RT-TT with a 0-mm target margin, 5.2 ± 3.1, 12 ± 5.9, and 12 ± 7.8 Gy for RT-TT with a 2-mm target margin, and 5.3 ± 2.3, 11.9 ± 5.0, and 12 ± 5.6 Gy for 4D-IP, respectively. Conclusion: The results of our study have shown that 4D-IP can achieve plans similar to those achieved by RT-TT. Considering clinical implementation, 4D-IP could be a more reliable and practical method to manage patient respiration-induced motion
A Dynamic Optimization Method of Indoor Fire Evacuation Route Based on Real-time Situation Awareness
Directory of Open Access Journals (Sweden)
DING Yulin
2016-12-01
Full Text Available How to provide safe and effective evacuation routes is an important safeguard to correctly guide evacuation and reduce the casualties during the fire situation rapidly evolving in complex indoor environment. The traditional static path finding method is difficult to adjust the path adaptively according to the changing fire situation, which lead to the evacuation decision-making blindness and hysteresis. This paper proposes a dynamic method which can dynamically optimize the indoor evacuation routes based on the real-time situation awareness. According to the real-time perception of fire situation parameters and the changing indoor environment information, the evacuation route is optimized dynamically. The integrated representation of multisource indoor fire monitoring sensor observations oriented fire emergency evacuation is presented at first, real-time fire threat situation information inside building is then extracted from the observation data of multi-source sensors, which is used to constrain the dynamical optimization of the topology of the evacuation route. Finally, the simulation experiments prove that this method can improve the accuracy and efficiency of indoor evacuation routing.
Path Planning for Non-Circular, Non-Holonomic Robots in Highly Cluttered Environments.
Samaniego, Ricardo; Lopez, Joaquin; Vazquez, Fernando
2017-08-15
This paper presents an algorithm for finding a solution to the problem of planning a feasible path for a slender autonomous mobile robot in a large and cluttered environment. The presented approach is based on performing a graph search on a kinodynamic-feasible lattice state space of high resolution; however, the technique is applicable to many search algorithms. With the purpose of allowing the algorithm to consider paths that take the robot through narrow passes and close to obstacles, high resolutions are used for the lattice space and the control set. This introduces new challenges because one of the most computationally expensive parts of path search based planning algorithms is calculating the cost of each one of the actions or steps that could potentially be part of the trajectory. The reason for this is that the evaluation of each one of these actions involves convolving the robot's footprint with a portion of a local map to evaluate the possibility of a collision, an operation that grows exponentially as the resolution is increased. The novel approach presented here reduces the need for these convolutions by using a set of offline precomputed maps that are updated, by means of a partial convolution, as new information arrives from sensors or other sources. Not only does this improve run-time performance, but it also provides support for dynamic search in changing environments. A set of alternative fast convolution methods are also proposed, depending on whether the environment is cluttered with obstacles or not. Finally, we provide both theoretical and experimental results from different experiments and applications.
Aircraft path planning with the use of smooth trajectories
Belokon', S. A.; Zolotukhin, Yu. N.; Nesterov, A. A.
2017-01-01
A simplified method of plane trajectory calculation is proposed for solving the problem of planning a path defined by a sequence of waypoints. The trajectory consists of oriented segments of straight lines joined by clothoids (Cornu spirals). The efficiency of the method is validated by means of numerical simulations in the MATLAB/Simulink environment.
Test plan for glove box testing with the real-time transuranic dust monitor
International Nuclear Information System (INIS)
Partin, J.K.; Fincke, J.R.
1994-10-01
This test plan describes the objectives, instrumentation, and testing procedures used to prove the feasibility of a real-time transuranic dust monitor (RTDM). The RTDM is under development at the Idaho National Engineering Laboratory (INEL) as a Waste Characterization Technology funded by the Buried Waste Integrated Demonstration Project. The instrument is an in situ monitor that uses optical techniques to establish particle size, particle number density, and mass and species of heavy metal contamination. US Department of Energy orders mandate the assessment of radiological exposure and contamination spread during the remediation of radioactive waste. Of particular concern is heavy metal contamination of dust, both radioactive and nonradioactive. Small particles of metal, particularly the radioactive species, tend to become electrically charged and consequently attach themselves to dust particles. This airborne activated dust is a primary means of contamination transport during remediation activities, and therefore, must be continuously monitored to protect personnel involved in the operations and to control the spread of contamination. If real-time monitoring is not available there is increased likelihood of generating unacceptably high levels of contamination and being forced to shut down costly retrieval operations to decontaminate. A series of experiments are described to determine the optimal experimental design, operational parameters, and levels of detection for the RTDM. Initial screening will be performed using monodisperse particle standards to set parameters and calibrate the instrument. Additional testing will be performed using INEL soil samples spiked with a surrogate, cerium oxide, to prove the design before transporting the apparatus to the Test Reactor Area for testing with plutonium-contaminated dusts
A real-time audit of radiation therapy in a regional cancer center
International Nuclear Information System (INIS)
Brundage, Michael D.; Dixon, Peter F.; Mackillop, William J.; Shelley, Wendy E.; Hayter, Charles; Paszat, Lawrence F.; Youssef, Youssef M.; Robins, Jean M.; McNamee, Anne; Cornell, Annette
1999-01-01
Purpose: To report the development, structure, and implementation of a real-time clinical radiotherapy audit of the practice of radiation oncology in a regional cancer center. Methods and Materials: Radiotherapy treatment plans were audited by a real-time peer-review process over an 8-year period (1989-1996). The overall goal of the audit was to establish a process for quality assurance (QA) of radiotherapy planning and prescription for individual patients. A parallel process was developed to audit the implementation of intervention-specific radiotherapy treatment policies. Results: A total of 3052 treatment plans were audited. Of these, 124 (4.1%) were not approved by the audit due to apparent errors in radiation planning. The majority of the nonapproved plans (79%) were modified prior to initiating treatment; the audit provided important clinical feedback about individual patient care in these instances. Most of the remaining nonapproved plans were deviations from normal practice due to patient-specific considerations. A further 110 (3.6% of all audited plans) were not approved by the audit due to deviations from radiotherapy treatment policy. A minority of these plans (22%) were modified prior to initiating treatment and the remainder provided important feedback for continuous quality improvement of treatment policies. Conclusion: A real-time audit of radiotherapy practice in a regional cancer center setting proved feasible and provided important direct and indirect patient benefits
An Adaptive Multi-Objective Particle Swarm Optimization Algorithm for Multi-Robot Path Planning
Directory of Open Access Journals (Sweden)
Nizar Hadi Abbas
2016-07-01
Full Text Available This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In order to evaluate the proposed algorithm in term of finding the best solution, six benchmark test functions are used to make a comparison between AMOPSO and the standard MOPSO. The results show that the AMOPSO has a better ability to get away from local optimums with a quickest convergence than the MOPSO. The simulation results using Matlab 2014a, indicate that this methodology is extremely valuable for every robot in multi-robot framework to discover its own particular proper path from the start to the destination position with minimum distance and time.
Overview of real-time kernels at the Superconducting Super Collider Laboratory
International Nuclear Information System (INIS)
Low, K.; Acharya, S.; Allen, M.; Faught, E.; Haenni, D.; Kalbfleisch, C.
1991-01-01
The Superconducting Super Collider Laboratory (SSCL) will have many subsystems that will require real-time microprocessor control. Examples of such Sub-systems requiring real-time controls are power supply ramp generators and quench protection monitors for the superconducting magnets. The authors plan on using a commercial multitasking real-time kernel in these systems. These kernels must perform in a consistent, reliable and efficient manner. Actual performance measurements have been conducted on four different kernels, all running on the same hardware platform. The measurements fall into two categories. Throughput measurements covering the 'non-real-time' aspects of the kernel include process creation/termination times, interprocess communication facilities involving messages, semaphores and shared memory and memory allocation/deallocation. Measurements concentrating on real-time response are context switch times, interrupt latencies and interrupt task response
Overview of real-time kernels at the Superconducting Super Collider Laboratory
International Nuclear Information System (INIS)
Low, K.; Acharya, S.; Allen, M.; Faught, E.; Haenni, D.; Kalbfleisch, C.
1991-05-01
The Superconducting Super Collider Laboratory (SSCL) will have many subsystems that will require real-time microprocessor control. Examples of such sub-systems requiring real-time controls are power supply ramp generators and quench protection monitors for the superconducting magnets. We plan on using a commercial multitasking real-time kernel in these systems. These kernels must perform in a consistent, reliable and efficient manner. Actual performance measurements have been conducted on four different kernels, all running on the same hardware platform. The measurements fall into two categories. Throughput measurements covering the ''non-real-time'' aspects of the kernel include process creation/termination times, interprocess communication facilities involving messages, semaphores and shared memory and memory allocation/deallocation. Measurements concentrating on real-time response are context switch times, interrupt latencies and interrupt task response. 6 refs., 2 tabs
Robot path planning using expert systems and machine vision
Malone, Denis E.; Friedrich, Werner E.
1992-02-01
This paper describes a system developed for the robotic processing of naturally variable products. In order to plan the robot motion path it was necessary to use a sensor system, in this case a machine vision system, to observe the variations occurring in workpieces and interpret this with a knowledge based expert system. The knowledge base was acquired by carrying out an in-depth study of the product using examination procedures not available in the robotic workplace and relates the nature of the required path to the information obtainable from the machine vision system. The practical application of this system to the processing of fish fillets is described and used to illustrate the techniques.
Robust path planning for flexible needle insertion using Markov decision processes.
Tan, Xiaoyu; Yu, Pengqian; Lim, Kah-Bin; Chui, Chee-Kong
2018-05-11
Flexible needle has the potential to accurately navigate to a treatment region in the least invasive manner. We propose a new planning method using Markov decision processes (MDPs) for flexible needle navigation that can perform robust path planning and steering under the circumstance of complex tissue-needle interactions. This method enhances the robustness of flexible needle steering from three different perspectives. First, the method considers the problem caused by soft tissue deformation. The method then resolves the common needle penetration failure caused by patterns of targets, while the last solution addresses the uncertainty issues in flexible needle motion due to complex and unpredictable tissue-needle interaction. Computer simulation and phantom experimental results show that the proposed method can perform robust planning and generate a secure control policy for flexible needle steering. Compared with a traditional method using MDPs, the proposed method achieves higher accuracy and probability of success in avoiding obstacles under complicated and uncertain tissue-needle interactions. Future work will involve experiment with biological tissue in vivo. The proposed robust path planning method can securely steer flexible needle within soft phantom tissues and achieve high adaptability in computer simulation.
Generate stepper motor linear speed profile in real time
Stoychitch, M. Y.
2018-01-01
In this paper we consider the problem of realization of linear speed profile of stepper motors in real time. We considered the general case when changes of speed in the phases of acceleration and deceleration are different. The new and practical algorithm of the trajectory planning is given. The algorithms of the real time speed control which are suitable for realization to the microcontroller and FPGA circuits are proposed. The practical realization one of these algorithms, using Arduino platform, is given also.
Ocean Wireless Networking and Real Time Data Management
Berger, J.; Orcutt, J. A.; Vernon, F. L.; Braun, H. W.; Rajasekar, A.
2001-12-01
Recent advances in technology have enabled the exploitation of satellite communications for high-speed (> 64 kbps) duplex communications with oceanographic ships at sea. Furthermore, decreasing costs for high-speed communications have made possible continuous connectivity to the global Internet for delivery of data ashore and communications with scientists and engineers on the ship. Through support from the Office of Naval Research, we have planned a series of tests using the R/V Revelle for real time data delivery of large quantities of underway data (e.g. continuous multibeam profiling) to shore for quality control, archiving, and real-time data availability. The Cecil H. and Ida M. Green Institute of Geophysics and Planetary Physics (IGPP) and the San Diego Supercomputer Center (SDSC) were funded by the NSF Information Technology Research (ITR) Program, the California Institute for Telecommunications and Information Technology [Cal-(IT)2] and the Scripps Institution of Oceanography for research entitled: "Exploring the Environment in Time: Wireless Networks & Real-Time Management." We will describe the technology to be used for the real-time seagoing experiment and the planned expansion of the project through support from the ITR grant. The short-term goal is to exercise the communications system aboard ship in various weather conditions and sea states while testing and developing the real-time data quality control and archiving methodology. The long-term goal is to enable continuous observations in the ocean, specifically supporting the goals of the DEOS (Dynamics of Earth and Ocean Systems) observatory program supported through a NSF Major Research Equipment (MRE) program - a permanent presence in the oceans. The impact on scientific work aboard ships, however, is likely to be fundamental. It will be possible to go to sea in the future with limited engineering capability for scientific operations by allowing shore-based quality control of data collected and
Reasoning about real-time systems with temporal interval logic constraints on multi-state automata
Gabrielian, Armen
1991-01-01
Models of real-time systems using a single paradigm often turn out to be inadequate, whether the paradigm is based on states, rules, event sequences, or logic. A model-based approach to reasoning about real-time systems is presented in which a temporal interval logic called TIL is employed to define constraints on a new type of high level automata. The combination, called hierarchical multi-state (HMS) machines, can be used to model formally a real-time system, a dynamic set of requirements, the environment, heuristic knowledge about planning-related problem solving, and the computational states of the reasoning mechanism. In this framework, mathematical techniques were developed for: (1) proving the correctness of a representation; (2) planning of concurrent tasks to achieve goals; and (3) scheduling of plans to satisfy complex temporal constraints. HMS machines allow reasoning about a real-time system from a model of how truth arises instead of merely depending of what is true in a system.
Enhancements and Evolution of the Real Time Mission Monitor
Goodman, M.; Blakeslee, R.; Hardin, D.; Hall, J.; He, Y.; Regner, K.
2008-12-01
The Real Time Mission Monitor (RTMM) is a visualization and information system that fuses multiple Earth science data sources, to enable real time decision-making for airborne and ground validation experiments. Developed at the National Aeronautics and Space Administration (NASA) Marshall Space Flight Center, RTMM is a situational awareness, decision-support system that integrates satellite imagery, radar, surface and airborne instrument data sets, model output parameters, lightning location observations, aircraft navigation data, soundings, and other applicable Earth science data sets. The integration and delivery of this information is made possible using data acquisition systems, network communication links, network server resources, and visualizations through the Google Earth virtual earth application. RTMM has proven extremely valuable for optimizing individual Earth science airborne field experiments. Flight planners, mission scientists, instrument scientists and program managers alike appreciate the contributions that RTMM makes to their flight projects. RTMM has received numerous plaudits from a wide variety of scientists who used RTMM during recent field campaigns including the 2006 NASA African Monsoon Multidisciplinary Analyses (NAMMA), 2007 Tropical Composition, Cloud, and Climate Coupling (TC4), 2008 Arctic Research of the Composition of the Troposphere from Aircraft and Satellites (ARCTAS) missions, the 2007-2008 NOAA-NASA Aerosonde Hurricane flights and the 2008 Soil Moisture Active-Passive Validation Experiment (SMAP-VEX). Improving and evolving RTMM is a continuous process. RTMM recently integrated the Waypoint Planning Tool, a Java-based application that enables aircraft mission scientists to easily develop a pre-mission flight plan through an interactive point-and-click interface. Individual flight legs are automatically calculated for altitude, latitude, longitude, flight leg distance, cumulative distance, flight leg time, cumulative time, and
Directory of Open Access Journals (Sweden)
Lavrenov Roman
2017-01-01
Full Text Available Our research focuses on operation of a heterogeneous robotic group that carries out point-to point navigation in GPS-denied dynamic environment, applying a combined local and global planning approach. In this paper, we introduce a homotopy-based high-level planner, which uses a modified splinebased path-planning algorithm. The algorithm utilizes Voronoi graph for global planning and a set of optimization criteria for local improvements of selected paths. The simulation was implemented in Matlab environment.
Walters, D M; Stringer, S M
2010-07-01
A key question in understanding the neural basis of path integration is how individual, spatially responsive, neurons may self-organize into networks that can, through learning, integrate velocity signals to update a continuous representation of location within an environment. It is of vital importance that this internal representation of position is updated at the correct speed, and in real time, to accurately reflect the motion of the animal. In this article, we present a biologically plausible model of velocity path integration of head direction that can solve this problem using neuronal time constants to effect natural time delays, over which associations can be learned through associative Hebbian learning rules. The model comprises a linked continuous attractor network and competitive network. In simulation, we show that the same model is able to learn two different speeds of rotation when implemented with two different values for the time constant, and without the need to alter any other model parameters. The proposed model could be extended to path integration of place in the environment, and path integration of spatial view.
Multi-scale path planning for reduced environmental impact of aviation
Campbell, Scot Edward
A future air traffic management system capable of rerouting aircraft trajectories in real-time in response to transient and evolving events would result in increased aircraft efficiency, better utilization of the airspace, and decreased environmental impact. Mixed-integer linear programming (MILP) is used within a receding horizon framework to form aircraft trajectories which mitigate persistent contrail formation, avoid areas of convective weather, and seek a minimum fuel solution. Areas conducive to persistent contrail formation and areas of convective weather occur at disparate temporal and spatial scales, and thereby require the receding horizon controller to be adaptable to multi-scale events. In response, a novel adaptable receding horizon controller was developed to account for multi-scale disturbances, as well as generate trajectories using both a penalty function approach for obstacle penetration and hard obstacle avoidance constraints. A realistic aircraft fuel burn model based on aircraft data and engine performance simulations is used to form the cost function in the MILP optimization. The performance of the receding horizon algorithm is tested through simulation. A scalability analysis of the algorithm is conducted to ensure the tractability of the path planner. The adaptable receding horizon algorithm is shown to successfully negotiate multi-scale environments with performance exceeding static receding horizon solutions. The path planner is applied to realistic scenarios involving real atmospheric data. A single flight example for persistent contrail mitigation shows that fuel burn increases 1.48% when approximately 50% of persistent contrails are avoided, but 6.19% when 100% of persistent contrails are avoided. Persistent contrail mitigating trajectories are generated for multiple days of data, and the research shows that 58% of persistent contrails are avoided with a 0.48% increase in fuel consumption when averaged over a year.
Real Time Adaptive Stream-oriented Geo-data Filtering
Directory of Open Access Journals (Sweden)
A. A. Golovkov
2016-01-01
Full Text Available The cutting-edge engineering maintenance software systems of various objects are aimed at processing of geo-location data coming from the employees’ mobile devices in real time. To reduce the amount of transmitted data such systems, usually, use various filtration methods of geo-coordinates recorded directly on mobile devices.The paper identifies the reasons for errors of geo-data coming from different sources, and proposes an adaptive dynamic method to filter geo-location data. Compared with the static method previously described in the literature [1] the approach offers to align adaptively the filtering threshold with changing characteristics of coordinates from many sources of geo-location data.To evaluate the efficiency of the developed filter method have been involved about 400 thousand points, representing motion paths of different type (on foot, by car and high-speed train and parking (indoors, outdoors, near high-rise buildings to take data from different mobile devices. Analysis of results has shown that the benefits of the proposed method are the more precise location of long parking (up to 6 hours and coordinates when user is in motion, the capability to provide steam-oriented filtering of data from different sources that allows to use the approach in geo-information systems, providing continuous monitoring of the location in streamoriented data processing in real time. The disadvantage is a little bit more computational complexity and increasing amount of points of the final track as compared to other filtration techniques.In general, the developed approach enables a significant quality improvement of displayed paths of moving mobile objects.
Space-time transformations in radial path integrals
International Nuclear Information System (INIS)
Steiner, F.
1984-09-01
Nonlinear space-time transformations in the radial path integral are discussed. A transformation formula is derived, which relates the original path integral to the Green's function of a new quantum system with an effective potential containing an observable quantum correction proportional(h/2π) 2 . As an example the formula is applied to spherical Brownian motion. (orig.)
Directory of Open Access Journals (Sweden)
Zhou Feng
2013-09-01
Full Text Available A based on Rapidly-exploring Random Tree(RRT and Particle Swarm Optimizer (PSO for path planning of the robot is proposed.First the grid method is built to describe the working space of the mobile robot,then the Rapidly-exploring Random Tree algorithm is used to obtain the global navigation path,and the Particle Swarm Optimizer algorithm is adopted to get the better path.Computer experiment results demonstrate that this novel algorithm can plan an optimal path rapidly in a cluttered environment.The successful obstacle avoidance is achieved,and the model is robust and performs reliably.
ISS Operations Cost Reductions Through Automation of Real-Time Planning Tasks
Hall, Timothy A.
2011-01-01
In 2008 the Johnson Space Center s Mission Operations Directorate (MOD) management team challenged their organization to find ways to reduce the costs of International Space station (ISS) console operations in the Mission Control Center (MCC). Each MOD organization was asked to identify projects that would help them attain a goal of a 30% reduction in operating costs by 2012. The MOD Operations and Planning organization responded to this challenge by launching several software automation projects that would allow them to greatly improve ISS console operations and reduce staffing and operating costs. These projects to date have allowed the MOD Operations organization to remove one full time (7 x 24 x 365) ISS console position in 2010; with the plan of eliminating two full time ISS console support positions by 2012. This will account for an overall 10 EP reduction in staffing for the Operations and Planning organization. These automation projects focused on utilizing software to automate many administrative and often repetitive tasks involved with processing ISS planning and daily operations information. This information was exchanged between the ground flight control teams in Houston and around the globe, as well as with the ISS astronaut crew. These tasks ranged from managing mission plan changes from around the globe, to uploading and downloading information to and from the ISS crew, to even more complex tasks that required multiple decision points to process the data, track approvals and deliver it to the correct recipient across network and security boundaries. The software solutions leveraged several different technologies including customized web applications and implementation of industry standard web services architecture between several planning tools; as well as a engaging a previously research level technology (TRL 2-3) developed by Ames Research Center (ARC) that utilized an intelligent agent based system to manage and automate file traffic flow
Energy Optimal Path Planning: Integrating Coastal Ocean Modelling with Optimal Control
Subramani, D. N.; Haley, P. J., Jr.; Lermusiaux, P. F. J.
2016-02-01
A stochastic optimization methodology is formulated for computing energy-optimal paths from among time-optimal paths of autonomous vehicles navigating in a dynamic flow field. To set up the energy optimization, the relative vehicle speed and headings are considered to be stochastic, and new stochastic Dynamically Orthogonal (DO) level-set equations that govern their stochastic time-optimal reachability fronts are derived. Their solution provides the distribution of time-optimal reachability fronts and corresponding distribution of time-optimal paths. An optimization is then performed on the vehicle's energy-time joint distribution to select the energy-optimal paths for each arrival time, among all stochastic time-optimal paths for that arrival time. The accuracy and efficiency of the DO level-set equations for solving the governing stochastic level-set reachability fronts are quantitatively assessed, including comparisons with independent semi-analytical solutions. Energy-optimal missions are studied in wind-driven barotropic quasi-geostrophic double-gyre circulations, and in realistic data-assimilative re-analyses of multiscale coastal ocean flows. The latter re-analyses are obtained from multi-resolution 2-way nested primitive-equation simulations of tidal-to-mesoscale dynamics in the Middle Atlantic Bight and Shelbreak Front region. The effects of tidal currents, strong wind events, coastal jets, and shelfbreak fronts on the energy-optimal paths are illustrated and quantified. Results showcase the opportunities for longer-duration missions that intelligently utilize the ocean environment to save energy, rigorously integrating ocean forecasting with optimal control of autonomous vehicles.
Planning and Management of Real-Time Geospatialuas Missions Within a Virtual Globe Environment
Nebiker, S.; Eugster, H.; Flückiger, K.; Christen, M.
2011-09-01
This paper presents the design and development of a hardware and software framework supporting all phases of typical monitoring and mapping missions with mini and micro UAVs (unmanned aerial vehicles). The developed solution combines state-of-the art collaborative virtual globe technologies with advanced geospatial imaging techniques and wireless data link technologies supporting the combined and highly reliable transmission of digital video, high-resolution still imagery and mission control data over extended operational ranges. The framework enables the planning, simulation, control and real-time monitoring of UAS missions in application areas such as monitoring of forest fires, agronomical research, border patrol or pipeline inspection. The geospatial components of the project are based on the Virtual Globe Technology i3D OpenWebGlobe of the Institute of Geomatics Engineering at the University of Applied Sciences Northwestern Switzerland (FHNW). i3D OpenWebGlobe is a high-performance 3D geovisualisation engine supporting the web-based streaming of very large amounts of terrain and POI data.
Path-finding in real and simulated rats
DEFF Research Database (Denmark)
Tamosiunaite, Minija; Ainge, James; Kulvicius, Tomas
2008-01-01
without affecting the path characteristic two additional mechanisms are implemented: a gradual drop of the learned weights (weight decay) and path length limitation, which prevents learning if the reward is not found after some expected time. Both mechanisms limit the memory of the system and thereby......A large body of experimental evidence suggests that the hippocampal place field system is involved in reward based navigation learning in rodents. Reinforcement learning (RL) mechanisms have been used to model this, associating the state space in an RL-algorithm to the place-field map in a rat...... convergence of RL-algorithms is also influenced by the state space characteristics, different PF-sizes and densities, leading to a different degree of overlap, were also investigated. The model rat learns finding a reward opposite to its starting point. We observed that the combination of biased straight...
Toward a web-based real-time radiation treatment planning system in a cloud computing environment.
Na, Yong Hum; Suh, Tae-Suk; Kapp, Daniel S; Xing, Lei
2013-09-21
To exploit the potential dosimetric advantages of intensity modulated radiation therapy (IMRT) and volumetric modulated arc therapy (VMAT), an in-depth approach is required to provide efficient computing methods. This needs to incorporate clinically related organ specific constraints, Monte Carlo (MC) dose calculations, and large-scale plan optimization. This paper describes our first steps toward a web-based real-time radiation treatment planning system in a cloud computing environment (CCE). The Amazon Elastic Compute Cloud (EC2) with a master node (named m2.xlarge containing 17.1 GB of memory, two virtual cores with 3.25 EC2 Compute Units each, 420 GB of instance storage, 64-bit platform) is used as the backbone of cloud computing for dose calculation and plan optimization. The master node is able to scale the workers on an 'on-demand' basis. MC dose calculation is employed to generate accurate beamlet dose kernels by parallel tasks. The intensity modulation optimization uses total-variation regularization (TVR) and generates piecewise constant fluence maps for each initial beam direction in a distributed manner over the CCE. The optimized fluence maps are segmented into deliverable apertures. The shape of each aperture is iteratively rectified to be a sequence of arcs using the manufacture's constraints. The output plan file from the EC2 is sent to the simple storage service. Three de-identified clinical cancer treatment plans have been studied for evaluating the performance of the new planning platform with 6 MV flattening filter free beams (40 × 40 cm(2)) from the Varian TrueBeam(TM) STx linear accelerator. A CCE leads to speed-ups of up to 14-fold for both dose kernel calculations and plan optimizations in the head and neck, lung, and prostate cancer cases considered in this study. The proposed system relies on a CCE that is able to provide an infrastructure for parallel and distributed computing. The resultant plans from the cloud computing are
Toward a web-based real-time radiation treatment planning system in a cloud computing environment
International Nuclear Information System (INIS)
Na, Yong Hum; Kapp, Daniel S; Xing, Lei; Suh, Tae-Suk
2013-01-01
To exploit the potential dosimetric advantages of intensity modulated radiation therapy (IMRT) and volumetric modulated arc therapy (VMAT), an in-depth approach is required to provide efficient computing methods. This needs to incorporate clinically related organ specific constraints, Monte Carlo (MC) dose calculations, and large-scale plan optimization. This paper describes our first steps toward a web-based real-time radiation treatment planning system in a cloud computing environment (CCE). The Amazon Elastic Compute Cloud (EC2) with a master node (named m2.xlarge containing 17.1 GB of memory, two virtual cores with 3.25 EC2 Compute Units each, 420 GB of instance storage, 64-bit platform) is used as the backbone of cloud computing for dose calculation and plan optimization. The master node is able to scale the workers on an ‘on-demand’ basis. MC dose calculation is employed to generate accurate beamlet dose kernels by parallel tasks. The intensity modulation optimization uses total-variation regularization (TVR) and generates piecewise constant fluence maps for each initial beam direction in a distributed manner over the CCE. The optimized fluence maps are segmented into deliverable apertures. The shape of each aperture is iteratively rectified to be a sequence of arcs using the manufacture’s constraints. The output plan file from the EC2 is sent to the simple storage service. Three de-identified clinical cancer treatment plans have been studied for evaluating the performance of the new planning platform with 6 MV flattening filter free beams (40 × 40 cm 2 ) from the Varian TrueBeam TM STx linear accelerator. A CCE leads to speed-ups of up to 14-fold for both dose kernel calculations and plan optimizations in the head and neck, lung, and prostate cancer cases considered in this study. The proposed system relies on a CCE that is able to provide an infrastructure for parallel and distributed computing. The resultant plans from the cloud computing are
Task path planning, scheduling and learning for free-ranging robot systems
Wakefield, G. Steve
1987-01-01
The development of robotics applications for space operations is often restricted by the limited movement available to guided robots. Free ranging robots can offer greater flexibility than physically guided robots in these applications. Presented here is an object oriented approach to path planning and task scheduling for free-ranging robots that allows the dynamic determination of paths based on the current environment. The system also provides task learning for repetitive jobs. This approach provides a basis for the design of free-ranging robot systems which are adaptable to various environments and tasks.
Near real-time digital holographic microscope based on GPU parallel computing
Zhu, Gang; Zhao, Zhixiong; Wang, Huarui; Yang, Yan
2018-01-01
A transmission near real-time digital holographic microscope with in-line and off-axis light path is presented, in which the parallel computing technology based on compute unified device architecture (CUDA) and digital holographic microscopy are combined. Compared to other holographic microscopes, which have to implement reconstruction in multiple focal planes and are time-consuming the reconstruction speed of the near real-time digital holographic microscope can be greatly improved with the parallel computing technology based on CUDA, so it is especially suitable for measurements of particle field in micrometer and nanometer scale. Simulations and experiments show that the proposed transmission digital holographic microscope can accurately measure and display the velocity of particle field in micrometer scale, and the average velocity error is lower than 10%.With the graphic processing units(GPU), the computing time of the 100 reconstruction planes(512×512 grids) is lower than 120ms, while it is 4.9s using traditional reconstruction method by CPU. The reconstruction speed has been raised by 40 times. In other words, it can handle holograms at 8.3 frames per second and the near real-time measurement and display of particle velocity field are realized. The real-time three-dimensional reconstruction of particle velocity field is expected to achieve by further optimization of software and hardware. Keywords: digital holographic microscope,
Real-time meteorological data flow in support of TVA's radiological emergency plan
International Nuclear Information System (INIS)
Hunter, C.H.; Pittman, D.E.; Malo, J.E.
1985-01-01
The Tennessee Valley Authority (TVA) presently operates two nuclear power plants - Browns Ferry (3 units) and Sequoyah (2 units). Two additional plants are under construction. These are Watts Bar scheduled for commercial operation later this year, and Bellefonte (2 units), scheduled for operation near the end of the decade. Under regulations promulgated under 10 CFR Part 50, TVA has developed a Radiological Emergency Plan (REP) to facilitate assessment of the effects of a radiological accident at any of the operational plants. As part of the REP, TVA has developed a system for collecting, displaying, and reviewing, and disseminating real-time meteorological information collected at the nuclear plant sites. The flow of this information must be reliable and continuous so that prompt, informed decisions are possible. This system has been designed using guidance provided in applicable Nuclear Regulatory Commission (NRC) documents, most notably Supplement 1 to NUREG-0737 and Regularoty Guide (R.G.) 1.23. This paper presents a brief description of the REP meteorological support. Meteorological support for nuclear plant emergency preparedness at TVA nuclear plants has been provided for several years. The system has undergone numerous changes during this time, reflecting changes in regulatory guidance and experience gained in implementing the system through numerous drills and exercises. A brief discussion of some of this experience is also presented
Path integral solution for some time-dependent potential
International Nuclear Information System (INIS)
Storchak, S.N.
1989-12-01
The quantum-mechanical problem with a time-dependent potential is solved by the path integral method. The solution is obtained by the application of the previously derived general formula for rheonomic homogeneous point transformation and reparametrization in the path integral. (author). 4 refs
Optimal path planning for single and multiple aircraft using a reduced order formulation
Twigg, Shannon S.
High-flying unmanned reconnaissance and surveillance systems are now being used extensively in the United States military. Current development programs are producing demonstrations of next-generation unmanned flight systems that are designed to perform combat missions. Their use in first-strike combat operations will dictate operations in densely cluttered environments that include unknown obstacles and threats, and will require the use of terrain for masking. The demand for autonomy of operations in such environments dictates the need for advanced trajectory optimization capabilities. In addition, the ability to coordinate the movements of more than one aircraft in the same area is an emerging challenge. This thesis examines using an analytical reduced order formulation for trajectory generation for minimum time and terrain masking cases. First, pseudo-3D constant velocity equations of motion are used for path planning for a single vehicle. In addition, the inclusion of winds, moving targets and moving threats is considered. Then, this formulation is increased to using 3D equations of motion, both with a constant velocity and with a simplified varying velocity model. Next, the constant velocity equations of motion are expanded to include the simultaneous path planning of an unspecified number of vehicles, for both aircraft avoidance situations and formation flight cases.
Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?
Penney, Mark D.; Enshan Koh, Dax; Spekkens, Robert W.
2017-07-01
It is straightforward to compute the transition amplitudes of a quantum circuit using the sum-over-paths methodology when the gates in the circuit are balanced, where a balanced gate is one for which all non-zero transition amplitudes are of equal magnitude. Here we consider the question of whether, for such circuits, the relative phases of different discrete-time paths through the configuration space can be defined in terms of a classical action, as they are for continuous-time paths. We show how to do so for certain kinds of quantum circuits, namely, Clifford circuits where the elementary systems are continuous-variable systems or discrete systems of odd-prime dimension. These types of circuit are distinguished by having phase-space representations that serve to define their classical counterparts. For discrete systems, the phase-space coordinates are also discrete variables. We show that for each gate in the generating set, one can associate a symplectomorphism on the phase-space and to each of these one can associate a generating function, defined on two copies of the configuration space. For discrete systems, the latter association is achieved using tools from algebraic geometry. Finally, we show that if the action functional for a discrete-time path through a sequence of gates is defined using the sum of the corresponding generating functions, then it yields the correct relative phases for the path-sum expression. These results are likely to be relevant for quantizing physical theories where time is fundamentally discrete, characterizing the classical limit of discrete-time quantum dynamics, and proving complexity results for quantum circuits.
A Comprehensive Real-Time Traffic Map for Geographic Routing in VANETs
Directory of Open Access Journals (Sweden)
Chi-Fu Huang
2017-01-01
Full Text Available Vehicular Ad Hoc Networks (VANETs have attracted a lot of attention during the last decade. VANETs can not only improve driving safety, but also convenience, and support most future Intelligent Transportation System (ITS. Due to the highly dynamic network topology of VANETs, many geographic routing protocols have been proposed and use real-time traffic information as an important metric to select a reliable forwarding path. However, most of the existing works do not describe how to gather real-time traffic. They either assume this information is already available, or can query an existing traffic center. Few studies have noticed this issue but the proposed solutions only consider a small region. In this paper, we propose a Comprehensive Real-Time Traffic Map (CRT Map to collect wide-ranging real-time traffic information with low overhead. In the design of a CRT Map, the concept of Crowdsensing is adopted. Vehicles cooperatively gather traffic information and share it with each other to construct an overview of the whole road network traffic. In addition, we design a CRT Map Based Routing (CBR, which takes into account the connectivity of consecutive roads in routing decisions. Simulation results show that the CBR can achieve a lower end-to-end delay and a higher packet delivery ratio.
Design for real-time data acquisition based on streaming technology
International Nuclear Information System (INIS)
Nakanishi, Hideya; Kojima, Mamoru
2001-04-01
For the LHD project a long-pulse plasma experiment of one-hour duration is planned. In this quasi steady-state operation, the data acquisition system will be required to continuously transfer the diagnostic data from the digitizer front-end and display them in real-time. The Compact PCI standard is used to replace the conventional CAMAC digitizers in LHD, because it provides good functionality for real-time data streaming and also a connectivity with modern PC technology. The digitizer scheme, interface to the host computer, adoption of data compression, and downstream applications are discussed in detail to design and implement this new real-time data streaming system for LHD plasma diagnostics. (author)
Planning of optimal work path for minimizing exposure dose during radiation work in radwaste storage
International Nuclear Information System (INIS)
Kim, Yoon Hyuk; Park, Won Man; Kim, Kyung Soo; Whang, Joo Ho
2005-01-01
Since the safety of nuclear power plant has been becoming a big social issue, the exposure dose of radiation for workers has been one of the important factors concerning the safety problem. The existing calculation methods of radiation dose used in the planning of radiation work assume that dose rate dose not depend on the location within a work space, thus the variation of exposure dose by different work path is not considered. In this study, a modified numerical method was presented to estimate the exposure dose during radiation work in radwaste storage considering the effects of the distance between a worker and sources. And a new numerical algorithm was suggested to search the optimal work path minimizing the exposure dose in pre-defined work space with given radiation sources. Finally, a virtual work simulation program was developed to visualize the exposure dose of radiation during radiation works in radwaste storage and provide the capability of simulation for work planning. As a numerical example, a test radiation work was simulated under given space and two radiation sources, and the suggested optimal work path was compared with three predefined work paths. The optimal work path obtained in the study could reduce the exposure dose for the given test work. Based on the results, the developed numerical method and simulation program could be useful tools in the planning of radiation work
Feasible Path Generation Using Bezier Curves for Car-Like Vehicle
Latip, Nor Badariyah Abdul; Omar, Rosli
2017-08-01
When planning a collision-free path for an autonomous vehicle, the main criteria that have to be considered are the shortest distance, lower computation time and completeness, i.e. a path can be found if one exists. Besides that, a feasible path for the autonomous vehicle is also crucial to guarantee that the vehicle can reach the target destination considering its kinematic constraints such as non-holonomic and minimum turning radius. In order to address these constraints, Bezier curves is applied. In this paper, Bezier curves are modeled and simulated using Matlab software and the feasibility of the resulting path is analyzed. Bezier curve is derived from a piece-wise linear pre-planned path. It is found that the Bezier curves has the capability of making the planned path feasible and could be embedded in a path planning algorithm for an autonomous vehicle with kinematic constraints. It is concluded that the length of segments of the pre-planned path have to be greater than a nominal value, derived from the vehicle wheelbase, maximum steering angle and maximum speed to ensure the path for the autonomous car is feasible.
Wang, Po-Jen; Keyawa, Nicholas R.; Euler, Craig
2012-01-01
In order to achieve highly accurate motion control and path planning for a mobile robot, an obstacle avoidance algorithm that provided a desired instantaneous turning radius and velocity was generated. This type of obstacle avoidance algorithm, which has been implemented in California State University Northridge's Intelligent Ground Vehicle (IGV), is known as Radial Polar Histogram (RPH). The RPH algorithm utilizes raw data in the form of a polar histogram that is read from a Laser Range Finder (LRF) and a camera. A desired open block is determined from the raw data utilizing a navigational heading and an elliptical approximation. The left and right most radii are determined from the calculated edges of the open block and provide the range of possible radial paths the IGV can travel through. In addition, the calculated obstacle edge positions allow the IGV to recognize complex obstacle arrangements and to slow down accordingly. A radial path optimization function calculates the best radial path between the left and right most radii and is sent to motion control for speed determination. Overall, the RPH algorithm allows the IGV to autonomously travel at average speeds of 3mph while avoiding all obstacles, with a processing time of approximately 10ms.
Directory of Open Access Journals (Sweden)
Yongfeng Ma
2014-01-01
Full Text Available Traffic incidents, caused by various factors, may lead to heavy traffic delay and be harmful to traffic capacity of downstream sections. Traffic incident management (TIM systems have been developed widely to respond to traffic incidents intelligently and reduce the losses. Traffic incident response plans, as an important component of TIM, can effectively guide responders as to what and how to do in traffic incidents. In the paper, a real-time automated traffic incident response plan management system was developed, which could generate and manage traffic incident response plans timely and automatically. A web application structure and a physical structure were designed to implement and show these functions. A standard framework of data storage was also developed to save information about traffic incidents and generated response plans. Furthermore, a conformation survey and case-based reasoning (CBR were introduced to identify traffic incident and generate traffic incident response plans automatically, respectively. Twenty-three traffic crash-related incidents were selected and three indicators were used to measure the system performance. Results showed that 20 of 23 cases could be retrieved effectively and accurately. The system is practicable to generate traffic incident response plans and has been implemented in China.
New magnetic real time shape control for MAST
Energy Technology Data Exchange (ETDEWEB)
Pangione, L., E-mail: luigi.pangione@ccfe.ac.uk [EURATOM/CCFE Fusion Association – Culham Science Centre, Abingdon, Oxon OX14 3DB (United Kingdom); McArdle, G.; Storrs, J. [EURATOM/CCFE Fusion Association – Culham Science Centre, Abingdon, Oxon OX14 3DB (United Kingdom)
2013-10-15
Highlights: ► New magnetic shape control system has been implemented. ► It has been intensively tested in a simulation environment. ► A tool chain to produce LTI model and simulate its behaviour has been implemented. ► Experimental results are shown. -- Abstract: The Mega Ampere Spherical Tokamak (MAST) real time plasma position controller is based on an optical linear camera placed on the mid plane of the vessel. This solution has the advantage of being a direct observation of the D{sub α} emissions coming from the interaction between the boundary of the plasma and neutral gas, but, on the other hand, it restricts the control to the outer radius of the plasma only. A complete chain of tools has been set up to implement, test and simulate a new real time magnetic plasma shape controller based on the rtEFIT code. The complete working path consists of three elements: a linear static relationship between control parameters and current demands, a linear state space model needed to represent the plasma dynamic response in closed loop simulations, and the possibility to run simulations inside the Plasma Control System (PCS). The linear relationship has been calculated using the FIESTA code, which is developed using Matlab at CCFE. The linear state space model was generated using the CREATE-L code developed by the CREATE Consortium. It has already been successfully used to model JET, FTU and TCV tokamaks. Using this working path many simulations have been carried out allowing fine tuning of the control gains before the real experiment. The simulation testing includes the plasma shape control law as implemented in PCS itself, so intensive debugging has been possible prior to operation. Successful control using rtEFIT was established in the second dedicated experiment during the MAST 2011–12 campaign. This work is a stepping stone towards divertor control which is ultimately intended for application to the super-X divertor in the MAST Upgrade experiment.
High-resolution near real-time drought monitoring in South Asia
Aadhar, Saran; Mishra, Vimal
2017-01-01
Drought in South Asia affect food and water security and pose challenges for millions of people. For policy-making, planning, and management of water resources at sub-basin or administrative levels, high-resolution datasets of precipitation and air temperature are required in near-real time. We develop a high-resolution (0.05°) bias-corrected precipitation and temperature data that can be used to monitor near real-time drought conditions over South Asia. Moreover, the dataset can be used to m...
Energy Technology Data Exchange (ETDEWEB)
Zilli, Thomas [Department of Radiation Oncology, Centre hospitalier de l' Universite de Montreal-Hopital Notre-Dame, Montreal, QC (Canada); Taussky, Daniel, E-mail: daniel.taussky.chum@ssss.gouv.qc.ca [Department of Radiation Oncology, Centre hospitalier de l' Universite de Montreal-Hopital Notre-Dame, Montreal, QC (Canada); Donath, David; Le, Hoa Phong; Larouche, Renee-Xaviere; Beliveau-Nadeau, Dominique; Hervieux, Yannick; Delouya, Guila [Department of Radiation Oncology, Centre hospitalier de l' Universite de Montreal-Hopital Notre-Dame, Montreal, QC (Canada)
2011-11-15
Purpose: To report the toxicity outcome in patients with localized prostate cancer undergoing {sup 125}I permanent-seed brachytherapy (BT) according to a urethra-sparing, intraoperative (IO), real-time planned conformal technique. Methods and Materials: Data were analyzed on 250 patients treated consecutively for low- or intermediate-risk prostate cancer between 2005 and 2009. The planned goal was urethral V{sub 150} = 0. Acute and late genitourinary (GU), gastrointestinal (GI), and erectile toxicities were scored with the International Prostate Symptom Score (IPSS) questionnaire and Common Terminology Criteria for Adverse Events (version 3.0). Median follow-up time for patients with at least 2 years of follow-up (n = 130) was 34.4 months (range, 24-56.9 months). Results: Mean IO urethra V{sub 150} was 0.018% {+-} 0.08%. Mean prostate D{sub 90} and V{sub 100} on day-30 computed tomography scan were 158.0 {+-} 27.0 Gy and 92.1% {+-} 7.2%, respectively. Mean IPSS peak was 9.5 {+-} 6.3 1 month after BT (mean difference from baseline IPSS, 5.3). No acute GI toxicity was observed in 86.8% of patients. The 3-year probability of Grade {>=}2 late GU toxicity-free survival was 77.4% {+-} 4.0%, with Grade 3 late GU toxicity encountered in only 3 patients. Three-year Grade 1 late GI toxicity-free survival was 86.1% {+-} 3.2%. No patient presented Grade {>=}2 late GI toxicity. Of patients with normal sexual status at baseline, 20.7% manifested Grade {>=}2 erectile dysfunction after BT. On multivariate analysis, elevated baseline IPSS (p = 0.016) and high-activity sources (median 0.61 mCi) (p = 0.033) predicted increased Grade {>=}2 late GU toxicity. Conclusions: Urethra-sparing IO BT results in low acute and late GU toxicity compared with the literature. High seed activity and elevated IPSS at baseline increased long-term GU toxicity.
Engineering of real-time systems with an experiment in hybrid control
DEFF Research Database (Denmark)
Ravn, Anders P.; Eriksen, Thomas Juul; Holdgaard, Michael
1998-01-01
powered manipulator with two links. The architecture uses local control for each of the links, and has a mode switched control algorithm which detects and reactson changes in model parameters due to variations in the forcesacting on the link. The result shows that it is feasible to check a design against...... of requirements and designs are expressed in duration calculus,a real-time interval logic, which is also used in verification. Theimplementation is done in occam for a network of four transputer's.Low level timing constraints are checked manually by calculating path lengths....
Ranking paths in stochastic time-dependent networks
DEFF Research Database (Denmark)
Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, Daniele D.
2014-01-01
In this paper we address optimal routing problems in networks where travel times are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns successors to nodes as a function of time. Nevertheless, in...
Spreading paths in partially observed social networks
Onnela, Jukka-Pekka; Christakis, Nicholas A.
2012-03-01
Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using static, structurally realistic social networks as platforms for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Although partial observation inflates the length of the shortest path, the stochastic nature of the spreading process also frequently derails the dynamic path from the shortest path. We find that the partially observed shortest path does not necessarily give an inflated estimate of the length of the process path; in fact, partial observation may, counterintuitively, make the path seem shorter than it actually is.
Spreading paths in partially observed social networks.
Onnela, Jukka-Pekka; Christakis, Nicholas A
2012-03-01
Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using static, structurally realistic social networks as platforms for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Although partial observation inflates the length of the shortest path, the stochastic nature of the spreading process also frequently derails the dynamic path from the shortest path. We find that the partially observed shortest path does not necessarily give an inflated estimate of the length of the process path; in fact, partial observation may, counterintuitively, make the path seem shorter than it actually is.
Ranking shortest paths in Stochastic time-denpendent networks
DEFF Research Database (Denmark)
Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, Daniele
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the ...... present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effective.......A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks...
K shortest paths in stochastic time-dependent networks
DEFF Research Database (Denmark)
Nielsen, Lars Relund; Pretolani, Daniele; Andersen, Kim Allan
2004-01-01
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the ...... present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effective.......A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks...
Optimal path planning for a mobile robot using cuckoo search algorithm
Mohanty, Prases K.; Parhi, Dayal R.
2016-03-01
The shortest/optimal path planning is essential for efficient operation of autonomous vehicles. In this article, a new nature-inspired meta-heuristic algorithm has been applied for mobile robot path planning in an unknown or partially known environment populated by a variety of static obstacles. This meta-heuristic algorithm is based on the levy flight behaviour and brood parasitic behaviour of cuckoos. A new objective function has been formulated between the robots and the target and obstacles, which satisfied the conditions of obstacle avoidance and target-seeking behaviour of robots present in the terrain. Depending upon the objective function value of each nest (cuckoo) in the swarm, the robot avoids obstacles and proceeds towards the target. The smooth optimal trajectory is framed with this algorithm when the robot reaches its goal. Some simulation and experimental results are presented at the end of the paper to show the effectiveness of the proposed navigational controller.
Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?
International Nuclear Information System (INIS)
Penney, Mark D; Koh, Dax Enshan; Spekkens, Robert W
2017-01-01
It is straightforward to compute the transition amplitudes of a quantum circuit using the sum-over-paths methodology when the gates in the circuit are balanced, where a balanced gate is one for which all non-zero transition amplitudes are of equal magnitude. Here we consider the question of whether, for such circuits, the relative phases of different discrete-time paths through the configuration space can be defined in terms of a classical action, as they are for continuous-time paths. We show how to do so for certain kinds of quantum circuits, namely, Clifford circuits where the elementary systems are continuous-variable systems or discrete systems of odd-prime dimension. These types of circuit are distinguished by having phase-space representations that serve to define their classical counterparts. For discrete systems, the phase-space coordinates are also discrete variables. We show that for each gate in the generating set, one can associate a symplectomorphism on the phase-space and to each of these one can associate a generating function, defined on two copies of the configuration space. For discrete systems, the latter association is achieved using tools from algebraic geometry. Finally, we show that if the action functional for a discrete-time path through a sequence of gates is defined using the sum of the corresponding generating functions, then it yields the correct relative phases for the path-sum expression. These results are likely to be relevant for quantizing physical theories where time is fundamentally discrete, characterizing the classical limit of discrete-time quantum dynamics, and proving complexity results for quantum circuits. (paper)
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.
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.
Heuristic methods for shared backup path protection planning
DEFF Research Database (Denmark)
Haahr, Jørgen Thorlund; Stidsen, Thomas Riis; Zachariasen, Martin
2012-01-01
schemes are employed. In contrast to manual intervention, automatic protection schemes such as Shared Backup Path Protection (SBPP) can recover from failure quickly and efficiently. SBPP is a simple but efficient protection scheme that can be implemented in backbone networks with technology available...... present heuristic algorithms and lower bound methods for the SBPP planning problem. Experimental results show that the heuristic algorithms are able to find good quality solutions in minutes. A solution gap of less than 3.5% was achieved for more than half of the benchmark instances (and a gap of less...
Path-Constrained Motion Planning for Robotics Based on Kinematic Constraints
Dijk, van N.J.M.; Wouw, van de N.; Pancras, W.C.M.; Nijmeijer, H.
2007-01-01
Common robotic tracking tasks consist of motions along predefined paths. The design of time-optimal path-constrained trajectories for robotic applications is discussed in this paper. To increase industrial applicability, the proposed method accounts for robot kinematics together with actuator
Murphy, Ryan J; Basafa, Ehsan; Hashemi, Sepehr; Grant, Gerald T; Liacouras, Peter; Susarla, Srinivas M; Otake, Yoshito; Santiago, Gabriel; Armand, Mehran; Gordon, Chad R
2015-08-01
The aesthetic and functional outcomes surrounding Le Fort-based, face-jaw-teeth transplantation have been suboptimal, often leading to posttransplant class II/III skeletal profiles, palatal defects, and "hybrid malocclusion." Therefore, a novel technology-real-time cephalometry-was developed to provide the surgical team instantaneous, intraoperative knowledge of three-dimensional dentoskeletal parameters. Mock face-jaw-teeth transplantation operations were performed on plastic and cadaveric human donor/recipient pairs (n = 2). Preoperatively, cephalometric landmarks were identified on donor/recipient skeletons using segmented computed tomographic scans. The computer-assisted planning and execution workstation tracked the position of the donor face-jaw-teeth segment in real time during the placement/inset onto recipient, reporting pertinent hybrid cephalometric parameters from any movement of donor tissue. The intraoperative data measured through real-time cephalometry were compared to posttransplant measurements for accuracy assessment. In addition, posttransplant cephalometric relationships were compared to planned outcomes to determine face-jaw-teeth transplantation success. Compared with postoperative data, the real-time cephalometry-calculated intraoperative measurement errors were 1.37 ± 1.11 mm and 0.45 ± 0.28 degrees for the plastic skull and 2.99 ± 2.24 mm and 2.63 ± 1.33 degrees for the human cadaver experiments. These results were comparable to the posttransplant relations to planned outcome (human cadaver experiment, 1.39 ± 1.81 mm and 2.18 ± 1.88 degrees; plastic skull experiment, 1.06 ± 0.63 mm and 0.53 ± 0.39 degrees). Based on this preliminary testing, real-time cephalometry may be a valuable adjunct for adjusting and measuring "hybrid occlusion" in face-jaw-teeth transplantation and other orthognathic surgical procedures.
Directory of Open Access Journals (Sweden)
Peter Juhasz
2017-03-01
Full Text Available While risk management gained popularity during the last decades even some of the basic risk types are still far out of focus. One of these is path dependency that refers to the uncertainty of how we reach a certain level of total performance over time. While decision makers are careful in accessing how their position will look like the end of certain periods, little attention is given how they will get there through the period. The uncertainty of how a process will develop across a shorter period of time is often “eliminated” by simply choosing a longer planning time interval, what makes path dependency is one of the most often overlooked business risk types. After reviewing the origin of the problem we propose and compare seven risk measures to access path. Traditional risk measures like standard deviation of sub period cash flows fail to capture this risk type. We conclude that in most cases considering the distribution of the expected cash flow effect caused by the path dependency may offer the best method, but we may need to use several measures at the same time to include all the optimisation limits of the given firm
Motion Planning in Multi-robot Systems using Timed Automata
DEFF Research Database (Denmark)
Andersen, Michael. S.; Jensen, Rune S.; Bak, Thomas
This paper dscribes how interacting timed automata can be used to model, analyze, and verify motion planning problems for systems with multiple mobile robots. The method assumes an infra-structure of simple unicycle type robots, moving om a planar grid. The motion of the robots, including simple...... kinematics, is captured in an automata formalism that allows formal composition and symbolic reasoning. The verification software UppAal is used to verify specification requirements formulated in computational tree logic (CTL), generating all feasible trajectories that satisfy specifications. The results...... of the planning are demonstrateted in a testbed that allows execution of the planned paths and motion primitives by synchronizing the planning results from UppAal with actual robotic vehicles. The planning problem may be modified online by moving obstacles in the physical environment, which causes a re...
Real Time Optima Tracking Using Harvesting Models of the Genetic Algorithm
Baskaran, Subbiah; Noever, D.
1999-01-01
Tracking optima in real time propulsion control, particularly for non-stationary optimization problems is a challenging task. Several approaches have been put forward for such a study including the numerical method called the genetic algorithm. In brief, this approach is built upon Darwinian-style competition between numerical alternatives displayed in the form of binary strings, or by analogy to 'pseudogenes'. Breeding of improved solution is an often cited parallel to natural selection in.evolutionary or soft computing. In this report we present our results of applying a novel model of a genetic algorithm for tracking optima in propulsion engineering and in real time control. We specialize the algorithm to mission profiling and planning optimizations, both to select reduced propulsion needs through trajectory planning and to explore time or fuel conservation strategies.
Eisemann, Elmar; Assarsson, Ulf; Wimmer, Michael
2011-01-01
Important elements of games, movies, and other computer-generated content, shadows are crucial for enhancing realism and providing important visual cues. In recent years, there have been notable improvements in visual quality and speed, making high-quality realistic real-time shadows a reachable goal. Real-Time Shadows is a comprehensive guide to the theory and practice of real-time shadow techniques. It covers a large variety of different effects, including hard, soft, volumetric, and semi-transparent shadows.The book explains the basics as well as many advanced aspects related to the domain
32 CFR 644.8 - Planning and scheduling real estate activities.
2010-07-01
... (CONTINUED) REAL PROPERTY REAL ESTATE HANDBOOK Project Planning Civil Works § 644.8 Planning and scheduling... of sound judgment, actual hardship is found to exist. (iii) Individual tract ownerships recommended...
Real time control of plasmas and ECRH systems on TCV
International Nuclear Information System (INIS)
Paley, J.I.; Berrino, J.; Coda, S.; Duval, B.P.; Felici, F.; Goodman, T.P.; Martin, Y.; Moret, J.M.; Piras, F.; Cruz, N.; Rodriques, A.P.; Santos, B.; Varandas, C.A.F.
2009-01-01
Developments in the real time control hardware on Tokamak a Configuration Variable (TCV) coupled with the flexibility of plasma shaping and electron cyclotron (EC) heating and current drive actuators are opening many opportunities to perform real time experiments and develop algorithms and methods for fusion applications. The ability to control magnetohydrodynamic instabilities is particularly important for achieving high performance fusion plasmas and EC is envisaged as a key actuator in maintaining high performance. We have successfully demonstrated control of the sawtooth instability using the EC launcher injection angle to modify the current profile around the q =1 surface. This paper presents an overview of recent real time control experiments on TCV, developments in the hardware and algorithms together with plans for the future.
Ali, Hazem; Pinho, Luis Miguel; Akesson, K.B.
2013-01-01
Designing cost-efficient multi-core real-time systems requires efficient techniques to allocate applications to cores while satisfying their timing constraints. However, existing approaches typically allocate using a First-Fit algorithm, which does not consider the execution time and potential
1991-09-30
0196 or 413 545-0720 PI E-mail Address: krithi@nirvan.cs.umass.edu, stankovic(ocs.umass.edu Grant or Contract Title: Dependable Real - Time Systems Grant...Dependable Real - Time Systems " Grant or Contract Number: N00014-85-k-0398 L " Reporting Period: 1 Oct 87 - 30 Sep 91 , 2. Summary of Accomplishments ’ 2.1 Our...in developing a sound approach to scheduling tasks in complex real - time systems , (2) developed a real-time operating system kernel, a preliminary
CERN. Geneva; Flockhart, Ronald Bruce; Seppey, P
2003-01-01
With LabVIEW Real-Time, you can choose from a variety of RT Series hardware. Add a real-time data acquisition component into a larger measurement and automation system or create a single stand-alone real-time solution with data acquisition, signal conditioning, motion control, RS-232, GPIB instrumentation, and Ethernet connectivity. With the various hardware options, you can create a system to meet your precise needs today, while the modularity of the system means you can add to the solution as your system requirements grow. If you are interested in Reliable and Deterministic systems for Measurement and Automation, you will profit from this seminar. Agenda: Real-Time Overview LabVIEW RT Hardware Platforms - Linux on PXI Programming with LabVIEW RT Real-Time Operating Systems concepts Timing Applications Data Transfer
Concepts of real time and semi-real time material control
International Nuclear Information System (INIS)
Lovett, J.E.
1975-01-01
After a brief consideration of the traditional material balance accounting on an MBA basis, this paper explores the basic concepts of real time and semi-real time material control, together with some of the major problems to be solved. Three types of short-term material control are discussed: storage, batch processing, and continuous processing. (DLC)
Pose estimation-based path planning for a tracked mobile robot traversing uneven terrains
Jun , Jae-Yun; Saut , Jean-Philippe; Benamar , Faïz
2015-01-01
International audience; A novel path-planning algorithm is proposed for a tracked mobile robot to traverse uneven terrains, which can efficiently search for stability sub-optimal paths. This algorithm consists of combining two RRT-like algorithms (the Transition-based RRT (T-RRT) and the Dynamic-Domain RRT (DD-RRT) algorithms) bidirectionally and of representing the robot-terrain interaction with the robot’s quasi-static tip-over stability measure (assuming that the robot traverses uneven ter...
Seasonal adjustment methods and real time trend-cycle estimation
Bee Dagum, Estela
2016-01-01
This book explores widely used seasonal adjustment methods and recent developments in real time trend-cycle estimation. It discusses in detail the properties and limitations of X12ARIMA, TRAMO-SEATS and STAMP - the main seasonal adjustment methods used by statistical agencies. Several real-world cases illustrate each method and real data examples can be followed throughout the text. The trend-cycle estimation is presented using nonparametric techniques based on moving averages, linear filters and reproducing kernel Hilbert spaces, taking recent advances into account. The book provides a systematical treatment of results that to date have been scattered throughout the literature. Seasonal adjustment and real time trend-cycle prediction play an essential part at all levels of activity in modern economies. They are used by governments to counteract cyclical recessions, by central banks to control inflation, by decision makers for better modeling and planning and by hospitals, manufacturers, builders, transportat...
DEFF Research Database (Denmark)
Christensen, Knud Smed
2000-01-01
Describes fundamentals of parallel programming and a kernel for that. Describes methods for modelling and checking parallel problems. Real time problems.......Describes fundamentals of parallel programming and a kernel for that. Describes methods for modelling and checking parallel problems. Real time problems....
International Nuclear Information System (INIS)
Asami, Tohru; Hashimoto, Kazuo; Yamamoto, Seiichi
1992-01-01
Recently, aiming at the application to the plant control for nuclear reactors and traffic and communication control, the research and the practical use of the expert system suitable to real time processing have become conspicuous. In this report, the condition for the required function to control the object that dynamically changes within a limited time is presented, and the technical difference between the real time expert system developed so as to satisfy it and the expert system of conventional type is explained with the actual examples and from theoretical aspect. The expert system of conventional type has the technical base in the problem-solving equipment originating in STRIPS. The real time expert system is applied to the fields accompanied by surveillance and control, to which conventional expert system is hard to be applied. The requirement for the real time expert system, the example of the real time expert system, and as the techniques of realizing real time processing, the realization of interruption processing, dispersion processing, and the mechanism of maintaining the consistency of knowledge are explained. (K.I.)
Future of medical physics: Real-time MRI-guided proton therapy.
Oborn, Bradley M; Dowdell, Stephen; Metcalfe, Peter E; Crozier, Stuart; Mohan, Radhe; Keall, Paul J
2017-08-01
With the recent clinical implementation of real-time MRI-guided x-ray beam therapy (MRXT), attention is turning to the concept of combining real-time MRI guidance with proton beam therapy; MRI-guided proton beam therapy (MRPT). MRI guidance for proton beam therapy is expected to offer a compelling improvement to the current treatment workflow which is warranted arguably more than for x-ray beam therapy. This argument is born out of the fact that proton therapy toxicity outcomes are similar to that of the most advanced IMRT treatments, despite being a fundamentally superior particle for cancer treatment. In this Future of Medical Physics article, we describe the various software and hardware aspects of potential MRPT systems and the corresponding treatment workflow. Significant software developments, particularly focused around adaptive MRI-based planning will be required. The magnetic interaction between the MRI and the proton beamline components will be a key area of focus. For example, the modeling and potential redesign of a magnetically compatible gantry to allow for beam delivery from multiple angles towards a patient located within the bore of an MRI scanner. Further to this, the accuracy of pencil beam scanning and beam monitoring in the presence of an MRI fringe field will require modeling, testing, and potential further development to ensure that the highly targeted radiotherapy is maintained. Looking forward we envisage a clear and accelerated path for hardware development, leveraging from lessons learnt from MRXT development. Within few years, simple prototype systems will likely exist, and in a decade, we could envisage coupled systems with integrated gantries. Such milestones will be key in the development of a more efficient, more accurate, and more successful form of proton beam therapy for many common cancer sites. © 2017 American Association of Physicists in Medicine.
Hybrid path planning for non-holonomic autonomous vehicles: An experimental evaluation
Esposto, F.; Goos, J.; Teerhuis, A.; Alirezaei, M.
2017-01-01
Path planning of an autonomous vehicle as a non-holonomic system is an essential part for many automated driving applications. Parking a car into a parking lot and maneuvering it through a narrow corridor would be a common driving scenarios in an urban environment. In this study a hybrid approach
Energy Technology Data Exchange (ETDEWEB)
Yun, Sangwon; Lee, Woongryol; Lee, Taegu; Park, Mikyung; Lee, Sangil [National Fusion Research Institute (NFRI), Gwahangno 169-148, Yuseong-Gu, Daejeon 305-806 (Korea, Republic of); Neto, André C. [Associação EURATOM/IST, Instituto de Plasmas e Fusão Nuclear, Instituto Superior Técnico, Universidade Técnica de Lisboa, P-1049-001 Lisboa (Portugal); Wallander, Anders [ITER Organization, Route de Vinon sur Verdon, 13115 St Paul Lez Durance (France); Kim, Young-Kuk, E-mail: ykim@cnu.ac.kr [Chungnam National University, Daejeon 305-764 (Korea, Republic of)
2013-10-15
Highlights: •We measured the performance of MARTe by measuring response time and jitter. •We compared the performance of application with and without MARTe. •We compared the performance of MARTe application on different O/Ss. -- Abstract: The Korea Super conducting Tokamak Advanced Research (KSTAR) is performing the task of “Demonstration and Evaluation of ITER CODAC Technologies at KSTAR” whose objective is the evaluation of real-time technologies for decision making on real-time operating systems (RTOS), real-time frameworks and 10 GbE networks. In this task, the Multi-threaded Application Real-Time executor (MARTe) has been evaluated as a real-time framework for real-time feedback control system. The performance of MARTe has been verified by measuring response time and jitter in a path of feedback control from an analog input of a monitoring system to an analog output of an actuator system. In addition, the evaluation has been performed in terms of applicability of MARTe and its performance depending on types of operating system and tuning of CPU affinity and priority. This paper describes the overview of MARTe as a real-time framework, the results of evaluation performance and its implementation.
International Nuclear Information System (INIS)
Yun, Sangwon; Lee, Woongryol; Lee, Taegu; Park, Mikyung; Lee, Sangil; Neto, André C.; Wallander, Anders; Kim, Young-Kuk
2013-01-01
Highlights: •We measured the performance of MARTe by measuring response time and jitter. •We compared the performance of application with and without MARTe. •We compared the performance of MARTe application on different O/Ss. -- Abstract: The Korea Super conducting Tokamak Advanced Research (KSTAR) is performing the task of “Demonstration and Evaluation of ITER CODAC Technologies at KSTAR” whose objective is the evaluation of real-time technologies for decision making on real-time operating systems (RTOS), real-time frameworks and 10 GbE networks. In this task, the Multi-threaded Application Real-Time executor (MARTe) has been evaluated as a real-time framework for real-time feedback control system. The performance of MARTe has been verified by measuring response time and jitter in a path of feedback control from an analog input of a monitoring system to an analog output of an actuator system. In addition, the evaluation has been performed in terms of applicability of MARTe and its performance depending on types of operating system and tuning of CPU affinity and priority. This paper describes the overview of MARTe as a real-time framework, the results of evaluation performance and its implementation
Cai, Wenyu; Zhang, Meiyan; Zheng, Yahong Rosa
2017-07-11
This paper investigates the task assignment and path planning problem for multiple AUVs in three dimensional (3D) underwater wireless sensor networks where nonholonomic motion constraints of underwater AUVs in 3D space are considered. The multi-target task assignment and path planning problem is modeled by the Multiple Traveling Sales Person (MTSP) problem and the Genetic Algorithm (GA) is used to solve the MTSP problem with Euclidean distance as the cost function and the Tour Hop Balance (THB) or Tour Length Balance (TLB) constraints as the stop criterion. The resulting tour sequences are mapped to 2D Dubins curves in the X - Y plane, and then interpolated linearly to obtain the Z coordinates. We demonstrate that the linear interpolation fails to achieve G 1 continuity in the 3D Dubins path for multiple targets. Therefore, the interpolated 3D Dubins curves are checked against the AUV dynamics constraint and the ones satisfying the constraint are accepted to finalize the 3D Dubins curve selection. Simulation results demonstrate that the integration of the 3D Dubins curve with the MTSP model is successful and effective for solving the 3D target assignment and path planning problem.
A conceptual framework for intelligent real-time information processing
Schudy, Robert
1987-01-01
By combining artificial intelligence concepts with the human information processing model of Rasmussen, a conceptual framework was developed for real time artificial intelligence systems which provides a foundation for system organization, control and validation. The approach is based on the description of system processing terms of an abstraction hierarchy of states of knowledge. The states of knowledge are organized along one dimension which corresponds to the extent to which the concepts are expressed in terms of the system inouts or in terms of the system response. Thus organized, the useful states form a generally triangular shape with the sensors and effectors forming the lower two vertices and the full evaluated set of courses of action the apex. Within the triangle boundaries are numerous processing paths which shortcut the detailed processing, by connecting incomplete levels of analysis to partially defined responses. Shortcuts at different levels of abstraction include reflexes, sensory motor control, rule based behavior, and satisficing. This approach was used in the design of a real time tactical decision aiding system, and in defining an intelligent aiding system for transport pilots.
The LBT real-time based control software to mitigate and compensate vibrations
Borelli, J.; Trowitzsch, J.; Brix, M.; Kürster, M.; Gässler, W.; Bertram, T.; Briegel, F.
2010-07-01
The Large Binocular Telescope (LBT) uses two 8.4 meters active primary mirrors and two adaptive secondary mirrors on the same mounting to take advantage of its interferometric capabilities. Both applications, interferometry and AO, are sensitive to vibrations. Several measurement campaigns have been carried out at the LBT and their results strongly indicate that a vibration monitoring system is required to improve the performance of LINC-NIRVANA, LBTI, and ARGOS, the laser guided ground layer adaptive optic system. Currently, a control software for mitigation and compensation of the vibrations is being designed. A complex set of algorithms collects real-time vibration data, archiving it for further analysis, and in parallel, generating the tip-tilt and optical path difference (OPD) data for the control loop of the instruments. A real-time data acquisition device equipped with embedded real-time Linux is used in our systems. A set of quick-look tools is currently under development in order to verify if the conditions at the telescope are suitable for interferometric/adaptive observations.
Rao, Akshay; Elara, Mohan Rajesh; Elangovan, Karthikeyan
This paper aims to develop a local path planning algorithm for a bio-inspired, reconfigurable crawling robot. A detailed description of the robotic platform is first provided, and the suitability for deployment of each of the current state-of-the-art local path planners is analyzed after an extensive literature review. The Enhanced Vector Polar Histogram algorithm is described and reformulated to better fit the requirements of the platform. The algorithm is deployed on the robotic platform in crawling configuration and favorably compared with other state-of-the-art local path planning algorithms.
Statistical aspects of quantitative real-time PCR experiment design
Czech Academy of Sciences Publication Activity Database
Kitchen, R.R.; Kubista, Mikael; Tichopád, Aleš
2010-01-01
Roč. 50, č. 4 (2010), s. 231-236 ISSN 1046-2023 R&D Projects: GA AV ČR IAA500520809 Institutional research plan: CEZ:AV0Z50520701 Keywords : Real-time PCR * Experiment design * Nested analysis of variance Subject RIV: EB - Genetics ; Molecular Biology Impact factor: 4.527, year: 2010
Process algebra with timing : real time and discrete time
Baeten, J.C.M.; Middelburg, C.A.; Bergstra, J.A.; Ponse, A.J.; Smolka, S.A.
2001-01-01
We present real time and discrete time versions of ACP with absolute timing and relative timing. The starting-point is a new real time version with absolute timing, called ACPsat, featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete
Process algebra with timing: Real time and discrete time
Baeten, J.C.M.; Middelburg, C.A.
1999-01-01
We present real time and discrete time versions of ACP with absolute timing and relative timing. The startingpoint is a new real time version with absolute timing, called ACPsat , featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete
U27 : real-time commercial vehicle safety & security monitoring final report.
2012-12-01
Accurate real-time vehicle tracking has a wide range of applications including fleet management, drug/speed/law enforcement, transportation planning, traffic safety, air quality, electronic tolling, and national security. While many alternative track...
Improvement of sampling plans for Salmonella detection in pooled table eggs by use of real-time PCR.
Pasquali, Frédérique; De Cesare, Alessandra; Valero, Antonio; Olsen, John Emerdhal; Manfreda, Gerardo
2014-08-01
Eggs and egg products have been described as the most critical food vehicles of salmonellosis. The prevalence and level of contamination of Salmonella on table eggs are low, which severely affects the sensitivity of sampling plans applied voluntarily in some European countries, where one to five pools of 10 eggs are tested by the culture based reference method ISO 6579:2004. In the current study we have compared the testing-sensitivity of the reference culture method ISO 6579:2004 and an alternative real-time PCR method on Salmonella contaminated egg-pool of different sizes (4-9 uninfected eggs mixed with one contaminated egg) and contamination levels (10°-10(1), 10(1)-10(2), 10(2)-10(3)CFU/eggshell). Two hundred and seventy samples corresponding to 15 replicates per pool size and inoculum level were tested. At the lowest contamination level real-time PCR detected Salmonella in 40% of contaminated pools vs 12% using ISO 6579. The results were used to estimate the lowest number of sample units needed to be tested in order to have a 95% certainty not falsely to accept a contaminated lot by Monte Carlo simulation. According to this simulation, at least 16 pools of 10 eggs each are needed to be tested by ISO 6579 in order to obtain this confidence level, while the minimum number of pools to be tested was reduced to 8 pools of 9 eggs each, when real-time PCR was applied as analytical method. This result underlines the importance of including analytical methods with higher sensitivity in order to improve the efficiency of sampling and reduce the number of samples to be tested. Copyright © 2013 Elsevier B.V. All rights reserved.
Fuzzy Logic Unmanned Air Vehicle Motion Planning
Directory of Open Access Journals (Sweden)
Chelsea Sabo
2012-01-01
Full Text Available There are a variety of scenarios in which the mission objectives rely on an unmanned aerial vehicle (UAV being capable of maneuvering in an environment containing obstacles in which there is little prior knowledge of the surroundings. With an appropriate dynamic motion planning algorithm, UAVs would be able to maneuver in any unknown environment towards a target in real time. This paper presents a methodology for two-dimensional motion planning of a UAV using fuzzy logic. The fuzzy inference system takes information in real time about obstacles (if within the agent's sensing range and target location and outputs a change in heading angle and speed. The FL controller was validated, and Monte Carlo testing was completed to evaluate the performance. Not only was the path traversed by the UAV often the exact path computed using an optimal method, the low failure rate makes the fuzzy logic controller (FLC feasible for exploration. The FLC showed only a total of 3% failure rate, whereas an artificial potential field (APF solution, a commonly used intelligent control method, had an average of 18% failure rate. These results highlighted one of the advantages of the FLC method: its adaptability to complex scenarios while maintaining low control effort.
Directory of Open Access Journals (Sweden)
Zheng Zhang
2013-03-01
Full Text Available In a hybrid wireless sensor network with mobile and static nodes, which have no prior geographical knowledge, successful navigation for mobile robots is one of the main challenges. In this paper, we propose two novel navigation algorithms for outdoor environments, which permit robots to travel from one static node to another along a planned path in the sensor field, namely the RAC and the IMAP algorithms. Using this, the robot can navigate without the help of a map, GPS or extra sensor modules, only using the received signal strength indication (RSSI and odometry. Therefore, our algorithms have the advantage of being cost-effective. In addition, a path planning algorithm to schedule mobile robots' travelling paths is presented, which focuses on shorter distances and robust paths for robots by considering the RSSI-Distance characteristics. The simulations and experiments conducted with an autonomous mobile robot show the effectiveness of the proposed algorithms in an outdoor environment.
International Nuclear Information System (INIS)
Bossi, R.H.; Oien, C.T.
1981-01-01
Real-time radiography is used for imaging both dynamic events and static objects. Fluorescent screens play an important role in converting radiation to light, which is then observed directly or intensified and detected. The radiographic parameters for real-time radiography are similar to conventional film radiography with special emphasis on statistics and magnification. Direct-viewing fluoroscopy uses the human eye as a detector of fluorescent screen light or the light from an intensifier. Remote-viewing systems replace the human observer with a television camera. The remote-viewing systems have many advantages over the direct-viewing conditions such as safety, image enhancement, and the capability to produce permanent records. This report reviews real-time imaging system parameters and components
DEFF Research Database (Denmark)
Amini, M. Hadi; Boroojeni, Kianoosh G.; Dragicevic, Tomislav
2017-01-01
of microgrids. The effectiveness of the proposed algorithm has been verified in MATLAB simulation. Furthermore, we propose a comprehensive simulation platform for further implementation of the proposed strategy on OPAL-RT real-time simulator system (RTDS). In our proposed platform, the communication path...
Energy Technology Data Exchange (ETDEWEB)
Johnson, R.; Hernandez, J.E.; Lu, Shin-yee [Lawrence Livermore National Lab., CA (United States)
1994-11-15
Many industrial and defence applications require an ability to make instantaneous decisions based on sensor input of a time varying process. Such systems are referred to as `real-time systems` because they process and act on data as it occurs in time. When a vision sensor is used in a real-time system, the processing demands can be quite substantial, with typical data rates of 10-20 million samples per second. A real-time Machine Vision Laboratory (MVL) was established in FY94 to extend our years of experience in developing computer vision algorithms to include the development and implementation of real-time vision systems. The laboratory is equipped with a variety of hardware components, including Datacube image acquisition and processing boards, a Sun workstation, and several different types of CCD cameras, including monochrome and color area cameras and analog and digital line-scan cameras. The equipment is reconfigurable for prototyping different applications. This facility has been used to support several programs at LLNL, including O Division`s Peacemaker and Deadeye Projects as well as the CRADA with the U.S. Textile Industry, CAFE (Computer Aided Fabric Inspection). To date, we have successfully demonstrated several real-time applications: bullet tracking, stereo tracking and ranging, and web inspection. This work has been documented in the ongoing development of a real-time software library.
Directory of Open Access Journals (Sweden)
Da-Sheng Lee
2010-01-01
Full Text Available Chip-based DNA quantification systems are widespread, and used in many point-of-care applications. However, instruments for such applications may not be maintained or calibrated regularly. Since machine reliability is a key issue for normal operation, this study presents a system model of the real-time Polymerase Chain Reaction (PCR machine to analyze the instrument design through numerical experiments. Based on model analysis, a systematic approach was developed to lower the variation of DNA quantification and achieve a robust design for a real-time PCR-on-a-chip system. Accelerated lift testing was adopted to evaluate the reliability of the chip prototype. According to the life test plan, this proposed real-time PCR-on-a-chip system was simulated to work continuously for over three years with similar reproducibility in DNA quantification. This not only shows the robustness of the lab-on-a-chip system, but also verifies the effectiveness of our systematic method for achieving a robust design.
Path following mobile robot in the presence of velocity constraints
DEFF Research Database (Denmark)
Bak, Martin; Poulsen, Niels Kjølstad; Ravn, Ole
2001-01-01
This paper focuses on path following algorithms for mobile robots with velocity constraints on the wheels. The path considered consists of straight lines intersected with given angles. We present a fast real-time receding horizon controller which anticipates the intersections and smoothly control...
Directory of Open Access Journals (Sweden)
Wenyu Cai
2017-07-01
Full Text Available This paper investigates the task assignment and path planning problem for multiple AUVs in three dimensional (3D underwater wireless sensor networks where nonholonomic motion constraints of underwater AUVs in 3D space are considered. The multi-target task assignment and path planning problem is modeled by the Multiple Traveling Sales Person (MTSP problem and the Genetic Algorithm (GA is used to solve the MTSP problem with Euclidean distance as the cost function and the Tour Hop Balance (THB or Tour Length Balance (TLB constraints as the stop criterion. The resulting tour sequences are mapped to 2D Dubins curves in the X − Y plane, and then interpolated linearly to obtain the Z coordinates. We demonstrate that the linear interpolation fails to achieve G 1 continuity in the 3D Dubins path for multiple targets. Therefore, the interpolated 3D Dubins curves are checked against the AUV dynamics constraint and the ones satisfying the constraint are accepted to finalize the 3D Dubins curve selection. Simulation results demonstrate that the integration of the 3D Dubins curve with the MTSP model is successful and effective for solving the 3D target assignment and path planning problem.
Towards Real-Time Distributed Planning in Multi-Robot Systems
Abdelkader, Mohamed
2018-04-01
Recently, there has been an increasing interest in robotics related to multi-robot applications. Such systems can be involved in several tasks such as collaborative search and rescue, aerial transportation, surveillance, and monitoring, to name a few. There are two possible architectures for the autonomous control of multi-robot systems. In the centralized architecture, a master controller communicates with all the robots to collect information. It uses this information to make decisions for the entire system and then sends commands to each robot. In contrast, in the distributed architecture, each robot makes its own decision independent from a central authority. While distributed architecture is a more portable solution, it comes at the expense of extensive information exchange (communication). The extensive communication between robots can result in decision delays because of which distributed architecture is often impractical for systems with strict real-time constraints, e.g. when decisions have to be taken in the order of milliseconds. In this thesis, we propose a distributed framework that strikes a balance between limited communicated information and reasonable system-wide performance while running in real-time. We implement the proposed approach in a game setting of two competing teams of drones, defenders and attackers. Defending drones execute a proposed linear program algorithm (using only onboard computing modules) to obstruct attackers from infiltrating a defense zone while having minimal local message passing. Another main contribution is that we developed a realistic simulation environment as well as lab and outdoor hardware setups of customized drones for testing the system in realistic scenarios. Our software is completely open-source and fully integrated with the well-known Robot Operating System (ROS) in hopes to make our work easily reproducible and for rapid future improvements.
Path planning in uncertain flow fields using ensemble method
Wang, Tong; Le Maî tre, Olivier P.; Hoteit, Ibrahim; Knio, Omar
2016-01-01
, we predict the path that minimizes the travel time 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
Memory controllers for real-time embedded systems predictable and composable real-time systems
Akesson, Benny
2012-01-01
Verification of real-time requirements in systems-on-chip becomes more complex as more applications are integrated. Predictable and composable systems can manage the increasing complexity using formal verification and simulation. This book explains the concepts of predictability and composability and shows how to apply them to the design and analysis of a memory controller, which is a key component in any real-time system. This book is generally intended for readers interested in Systems-on-Chips with real-time applications. It is especially well-suited for readers looking to use SDRAM memories in systems with hard or firm real-time requirements. There is a strong focus on real-time concepts, such as predictability and composability, as well as a brief discussion about memory controller architectures for high-performance computing. Readers will learn step-by-step how to go from an unpredictable SDRAM memory, offering highly variable bandwidth and latency, to a predictable and composable shared memory...
Solving the empty space problem in robot path planning by mathematical morphology
Roerdink, J.B.T.M.
1993-01-01
In this paper we formulate a morphological approach to path planning problems, in particular with respect to the empty-space problem, that is, the question of finding the allowed states for an object, moving in a space with obstacles. Our approach is based upon a recent generalization of
Interactive Learning Environment for Bio-Inspired Optimization Algorithms for UAV Path Planning
Duan, Haibin; Li, Pei; Shi, Yuhui; Zhang, Xiangyin; Sun, Changhao
2015-01-01
This paper describes the development of BOLE, a MATLAB-based interactive learning environment, that facilitates the process of learning bio-inspired optimization algorithms, and that is dedicated exclusively to unmanned aerial vehicle path planning. As a complement to conventional teaching methods, BOLE is designed to help students consolidate the…
Complete coverage path planning of a random polygon - A FroboMind component
DEFF Research Database (Denmark)
Aslund, Sebastian; Jensen, Kjeld; Jørgensen, Rasmus Nyholm
solution where all the steps in the process is included: Segmentation of a data set, creation of a configuration space, decomposition of a polygon, global and local path planning. To achieve this, a series of known algorithms are used including some tweaks and improvements to create a solid foundation...
LAV@HAZARD: a Web-GIS Framework for Real-Time Forecasting of Lava Flow Hazards
Del Negro, C.; Bilotta, G.; Cappello, A.; Ganci, G.; Herault, A.
2014-12-01
Crucial to lava flow hazard assessment is the development of tools for real-time prediction of flow paths, flow advance rates, and final flow lengths. Accurate prediction of flow paths and advance rates requires not only rapid assessment of eruption conditions (especially effusion rate) but also improved models of lava flow emplacement. Here we present the LAV@HAZARD web-GIS framework, which combines spaceborne remote sensing techniques and numerical simulations for real-time forecasting of lava flow hazards. By using satellite-derived discharge rates to drive a lava flow emplacement model, LAV@HAZARD allows timely definition of parameters and maps essential for hazard assessment, including the propagation time of lava flows and the maximum run-out distance. We take advantage of the flexibility of the HOTSAT thermal monitoring system to process satellite images coming from sensors with different spatial, temporal and spectral resolutions. HOTSAT was designed to ingest infrared satellite data acquired by the MODIS and SEVIRI sensors to output hot spot location, lava thermal flux and discharge rate. We use LAV@HAZARD to merge this output with the MAGFLOW physics-based model to simulate lava flow paths and to update, in a timely manner, flow simulations. Thus, any significant changes in lava discharge rate are included in the predictions. A significant benefit in terms of computational speed was obtained thanks to the parallel implementation of MAGFLOW on graphic processing units (GPUs). All this useful information has been gathered into the LAV@HAZARD platform which, due to the high degree of interactivity, allows generation of easily readable maps and a fast way to explore alternative scenarios. We will describe and demonstrate the operation of this framework using a variety of case studies pertaining to Mt Etna, Sicily. Although this study was conducted on Mt Etna, the approach used is designed to be applicable to other volcanic areas around the world.
Directory of Open Access Journals (Sweden)
Adel Akbarimajd
2012-02-01
Full Text Available A path planning method for mobile robots based on two dimensional cellular automata is proposed. The method can be applied for environments with both concave and convex obstacles. It is also appropriate for multi-robot problems as well as dynamic environments. In order to develop the planning method, environment of the robot is decomposed to a rectangular grid and the automata is defined with four states including Robot cell, Free cell, Goal cell and Obstacle cell. Evolution rules of automata are proposed in order to direct the robot toward its goal. CA based path planner method is afterwards modified by a colony technique to be applicable for concave obstacles. Then a layered architecture is proposed to autonomously implement the planning algorithm. The architecture employs an abstraction approach which makes the complexity manageable. An important feature of the architecture is internal artifacts that have some beliefs about the world. Most actions of the robot are planned and performed with respect to these artifacts.
Zadeh, S. M.; Powers, D. M. W.; Sammut, K.; Yazdani, A. M.
2016-12-01
Autonomous Underwater Vehicles (AUVs) are capable of spending long periods of time for carrying out various underwater missions and marine tasks. In this paper, a novel conflict-free motion planning framework is introduced to enhance underwater vehicle's mission performance by completing maximum number of highest priority tasks in a limited time through a large scale waypoint cluttered operating field, and ensuring safe deployment during the mission. The proposed combinatorial route-path planner model takes the advantages of the Biogeography-Based Optimization (BBO) algorithm toward satisfying objectives of both higher-lower level motion planners and guarantees maximization of the mission productivity for a single vehicle operation. The performance of the model is investigated under different scenarios including the particular cost constraints in time-varying operating fields. To show the reliability of the proposed model, performance of each motion planner assessed separately and then statistical analysis is undertaken to evaluate the total performance of the entire model. The simulation results indicate the stability of the contributed model and its feasible application for real experiments.
Enabling Advanced Path-Finding on Terrains and in Spatial Networks
DEFF Research Database (Denmark)
Kaul, Manohar
traffic updates. The solution assumes that the dynamic real-valued edge weights are bounded in a manner consistent with real-world data, which enables a theoretical guarantee on the travel time. Comprehensive experiments suggest that the proposed methods are accurate, efficient, robust, and scalable....... into the effectiveness and efficiency of the two approaches. Finally, we propose a scalable distributed system that maintains a large number of continuous fastest-path queries on a large spatial network, providing users with guaranteed approximate fastest paths to their destinations, while facing heavy real- time....... The first scans the 3D point-cloud in a single pass and constructs the 3D road network on the fly, while the second approach reads the 3D points as disk blocks in accordance to a locality-preserving space-filling curve. Results from empirical studies with real- world data offer insight...
Research overview of real-time monitoring system for micro leak of three-dimensional pipe network
Directory of Open Access Journals (Sweden)
Shaofeng WANG
2016-04-01
Full Text Available Aiming at the key technical problems encountered by domestic and foreign scholars in building the real-time monitoring system for the micro leak of three-dimensional pipe networks, the paper classifies the problems into three aspects: 1 in the extraction of fault signal frequency, how to avoid the effect of the mixed echo stack and improve the delay estimation accuracy of the correlation; 2 in network bifurcation structure, how to discern the signal propagation path, and how to locate the leak source; 3 under the uncertainly delay in transmitting and receiving information data, how to ensure the time synchronization accuracy of the real-time monitoring system for the three-dimensional pipe network leakage. Through the comparison of the monitoring technologies for the pipe network leakage at home and abroad, it shows that the acoustic emission sensor network based three-dimensional pipeline leak real-time monitoring has great advantages in detecting the weak leakage of flammable and explosive gas/liquid transportation pipelines.
Essays in real-time forecasting
Liebermann, Joelle
2012-01-01
This thesis contains three essays in the field of real-time econometrics, and more particularlyforecasting.The issue of using data as available in real-time to forecasters, policymakers or financialmarkets is an important one which has only recently been taken on board in the empiricalliterature. Data available and used in real-time are preliminary and differ from ex-postrevised data, and given that data revisions may be quite substantial, the use of latestavailable instead of real-time can s...
International Nuclear Information System (INIS)
Zamirian, M.; Kamyad, A.V.; Farahi, M.H.
2009-01-01
In this Letter a new approach for solving optimal path planning problems for a single rigid and free moving object in a two and three dimensional space in the presence of stationary or moving obstacles is presented. In this approach the path planning problems have some incompatible objectives such as the length of path that must be minimized, the distance between the path and obstacles that must be maximized and etc., then a multi-objective dynamic optimization problem (MODOP) is achieved. Considering the imprecise nature of decision maker's (DM) judgment, these multiple objectives are viewed as fuzzy variables. By determining intervals for the values of these fuzzy variables, flexible monotonic decreasing or increasing membership functions are determined as the degrees of satisfaction of these fuzzy variables on their intervals. Then, the optimal path planning policy is searched by maximizing the aggregated fuzzy decision values, resulting in a fuzzy multi-objective dynamic optimization problem (FMODOP). Using a suitable t-norm, the FMODOP is converted into a non-linear dynamic optimization problem (NLDOP). By using parametrization method and some calculations, the NLDOP is converted into the sequence of conventional non-linear programming problems (NLPP). It is proved that the solution of this sequence of the NLPPs tends to a Pareto optimal solution which, among other Pareto optimal solutions, has the best satisfaction of DM for the MODOP. Finally, the above procedure as a novel algorithm integrating parametrization method and fuzzy aggregation to solve the MODOP is proposed. Efficiency of our approach is confirmed by some numerical examples.
Monitoring external beam radiotherapy using real-time beam visualization
Energy Technology Data Exchange (ETDEWEB)
Jenkins, Cesare H. [Department of Mechanical Engineering and Department of Radiation Oncology, Stanford University, Stanford, California 94305 (United States); Naczynski, Dominik J.; Yu, Shu-Jung S.; Xing, Lei, E-mail: lei@stanford.edu [Department of Radiation Oncology, Stanford University School of Medicine, Stanford, California 94305 (United States)
2015-01-15
Purpose: To characterize the performance of a novel radiation therapy monitoring technique that utilizes a flexible scintillating film, common optical detectors, and image processing algorithms for real-time beam visualization (RT-BV). Methods: Scintillating films were formed by mixing Gd{sub 2}O{sub 2}S:Tb (GOS) with silicone and casting the mixture at room temperature. The films were placed in the path of therapeutic beams generated by medical linear accelerators (LINAC). The emitted light was subsequently captured using a CMOS digital camera. Image processing algorithms were used to extract the intensity, shape, and location of the radiation field at various beam energies, dose rates, and collimator locations. The measurement results were compared with known collimator settings to validate the performance of the imaging system. Results: The RT-BV system achieved a sufficient contrast-to-noise ratio to enable real-time monitoring of the LINAC beam at 20 fps with normal ambient lighting in the LINAC room. The RT-BV system successfully identified collimator movements with sub-millimeter resolution. Conclusions: The RT-BV system is capable of localizing radiation therapy beams with sub-millimeter precision and tracking beam movement at video-rate exposure.
Spreading paths in partially observed social networks
Onnela, Jukka-Pekka; Christakis, Nicholas A.
2012-01-01
Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using a static, s...
End-User Applications of Real-Time Earthquake Information in Europe
Cua, G. B.; Gasparini, P.; Giardini, D.; Zschau, J.; Filangieri, A. R.; Reakt Wp7 Team
2011-12-01
The primary objective of European FP7 project REAKT (Strategies and Tools for Real-Time Earthquake Risk Reduction) is to improve the efficiency of real-time earthquake risk mitigation methods and their capability of protecting structures, infrastructures, and populations. REAKT aims to address the issues of real-time earthquake hazard and response from end-to-end, with efforts directed along the full spectrum of methodology development in earthquake forecasting, earthquake early warning, and real-time vulnerability systems, through optimal decision-making, and engagement and cooperation of scientists and end users for the establishment of best practices for use of real-time information. Twelve strategic test cases/end users throughout Europe have been selected. This diverse group of applications/end users includes civil protection authorities, railway systems, hospitals, schools, industrial complexes, nuclear plants, lifeline systems, national seismic networks, and critical structures. The scale of target applications covers a wide range, from two school complexes in Naples, to individual critical structures, such as the Rion Antirion bridge in Patras, and the Fatih Sultan Mehmet bridge in Istanbul, to large complexes, such as the SINES industrial complex in Portugal and the Thessaloniki port area, to distributed lifeline and transportation networks and nuclear plants. Some end-users are interested in in-depth feasibility studies for use of real-time information and development of rapid response plans, while others intend to install real-time instrumentation and develop customized automated control systems. From the onset, REAKT scientists and end-users will work together on concept development and initial implementation efforts using the data products and decision-making methodologies developed with the goal of improving end-user risk mitigation. The aim of this scientific/end-user partnership is to ensure that scientific efforts are applicable to operational
National Research Council Canada - National Science Library
Hurezeanu, Vlad
2000-01-01
.... This vehicle performs tasks to include surveying fields, laying mines, and teleoperation. The capability of the vehicle will be increased if its supporting software plans paths that take into account the terrain features...
Real-time web application development with Vert.x 2.0
Parviainen, Tero
2013-01-01
A quick, clear, and concise tutorial-guide-based approach that helps you to develop a web application based on Vert.x.Real-time Web Application Development with Vert.x is written for web developers who want to take the next step and dive into real-time web application development.This book uses JavaScript (and some Java) to introduce the Vert.x platform, so basic JavaScript knowledge is expected. If you're planning to write your applications using some of the other Vert.x languages, all the techniques and concepts will translate to them directly. All you need to do is refer to the Vert.x API r
National Oceanic and Atmospheric Administration, Department of Commerce — The Ovation Prime Real-Time (OPRT) product is a real-time forecast and nowcast model of auroral power and is an operational implementation of the work by Newell et...
Path planning for persistent surveillance applications using fixed-wing unmanned aerial vehicles
Keller, James F.
This thesis addresses coordinated path planning for fixed-wing Unmanned Aerial Vehicles (UAVs) engaged in persistent surveillance missions. While uniquely suited to this mission, fixed wing vehicles have maneuver constraints that can limit their performance in this role. Current technology vehicles are capable of long duration flight with a minimal acoustic footprint while carrying an array of cameras and sensors. Both military tactical and civilian safety applications can benefit from this technology. We make three main contributions: C1 A sequential path planner that generates a C 2 flight plan to persistently acquire a covering set of data over a user designated area of interest. The planner features the following innovations: • A path length abstraction that embeds kino-dynamic motion constraints to estimate feasible path length. • A Traveling Salesman-type planner to generate a covering set route based on the path length abstraction. • A smooth path generator that provides C 2 routes that satisfy user specified curvature constraints. C2 A set of algorithms to coordinate multiple UAVs, including mission commencement from arbitrary locations to the start of a coordinated mission and de-confliction of paths to avoid collisions with other vehicles and fixed obstacles. C3 A numerically robust toolbox of spline-based algorithms tailored for vehicle routing validated through flight test experiments on multiple platforms. A variety of tests and platforms are discussed. The algorithms presented are based on a technical approach with approximately equal emphasis on analysis, computation, dynamic simulation, and flight test experimentation. Our planner (C1) directly takes into account vehicle maneuverability and agility constraints that could otherwise render simple solutions infeasible. This is especially important when surveillance objectives elevate the importance of optimized paths. Researchers have developed a diverse range of solutions for persistent
ISS Operations Cost Reductions Through Automation of Real-Time Planning Tasks
Hall, Timothy A.; Clancey, William J.; McDonald, Aaron; Toschlog, Jason; Tucker, Tyson; Khan, Ahmed; Madrid, Steven (Eric)
2011-01-01
In 2007 the Johnson Space Center s Mission Operations Directorate (MOD) management team challenged their organizations to find ways to reduce the cost of operations for supporting the International Space Station (ISS) in the Mission Control Center (MCC). Each MOD organization was asked to define and execute projects that would help them attain cost reductions by 2012. The MOD Operations Division Flight Planning Branch responded to this challenge by launching several software automation projects that would allow them to greatly improve console operations and reduce ISS console staffing and intern reduce operating costs. These tasks ranged from improving the management and integration mission plan changes, to automating the uploading and downloading of information to and from the ISS and the associated ground complex tasks that required multiple decision points. The software solutions leveraged several different technologies including customized web applications and implementation of industry standard web services architecture; as well as engaging a previously TRL 4-5 technology developed by Ames Research Center (ARC) that utilized an intelligent agent-based system to manage and automate file traffic flow, archive data, and generate console logs. These projects to date have allowed the MOD Operations organization to remove one full time (7 x 24 x 365) ISS console position in 2010; with the goal of eliminating a second full time ISS console support position by 2012. The team will also reduce one long range planning console position by 2014. When complete, these Flight Planning Branch projects will account for the elimination of 3 console positions and a reduction in staffing of 11 engineering personnel (EP) for ISS.
VERSE - Virtual Equivalent Real-time Simulation
Zheng, Yang; Martin, Bryan J.; Villaume, Nathaniel
2005-01-01
Distributed real-time simulations provide important timing validation and hardware in the- loop results for the spacecraft flight software development cycle. Occasionally, the need for higher fidelity modeling and more comprehensive debugging capabilities - combined with a limited amount of computational resources - calls for a non real-time simulation environment that mimics the real-time environment. By creating a non real-time environment that accommodates simulations and flight software designed for a multi-CPU real-time system, we can save development time, cut mission costs, and reduce the likelihood of errors. This paper presents such a solution: Virtual Equivalent Real-time Simulation Environment (VERSE). VERSE turns the real-time operating system RTAI (Real-time Application Interface) into an event driven simulator that runs in virtual real time. Designed to keep the original RTAI architecture as intact as possible, and therefore inheriting RTAI's many capabilities, VERSE was implemented with remarkably little change to the RTAI source code. This small footprint together with use of the same API allows users to easily run the same application in both real-time and virtual time environments. VERSE has been used to build a workstation testbed for NASA's Space Interferometry Mission (SIM PlanetQuest) instrument flight software. With its flexible simulation controls and inexpensive setup and replication costs, VERSE will become an invaluable tool in future mission development.
Formal language constrained path problems
Energy Technology Data Exchange (ETDEWEB)
Barrett, C.; Jacob, R.; Marathe, M.
1997-07-08
In many path finding problems arising in practice, certain patterns of edge/vertex labels in the labeled graph being traversed are allowed/preferred, while others are disallowed. Motivated by such applications as intermodal transportation planning, the authors investigate the complexity of finding feasible paths in a labeled network, where the mode choice for each traveler is specified by a formal language. The main contributions of this paper include the following: (1) the authors show that the problem of finding a shortest path between a source and destination for a traveler whose mode choice is specified as a context free language is solvable efficiently in polynomial time, when the mode choice is specified as a regular language they provide algorithms with improved space and time bounds; (2) in contrast, they show that the problem of finding simple paths between a source and a given destination is NP-hard, even when restricted to very simple regular expressions and/or very simple graphs; (3) for the class of treewidth bounded graphs, they show that (i) the problem of finding a regular language constrained simple path between source and a destination is solvable in polynomial time and (ii) the extension to finding context free language constrained simple paths is NP-complete. Several extensions of these results are presented in the context of finding shortest paths with additional constraints. These results significantly extend the results in [MW95]. As a corollary of the results, they obtain a polynomial time algorithm for the BEST k-SIMILAR PATH problem studied in [SJB97]. The previous best algorithm was given by [SJB97] and takes exponential time in the worst case.
Time optimized path-choice in the termite hunting ant Megaponera analis.
Frank, Erik T; Hönle, Philipp O; Linsenmair, K Eduard
2018-05-10
Trail network systems among ants have received a lot of scientific attention due to their various applications in problem solving of networks. Recent studies have shown that ants select the fastest available path when facing different velocities on different substrates, rather than the shortest distance. The progress of decision-making by these ants is determined by pheromone-based maintenance of paths, which is a collective decision. However, path optimization through individual decision-making remains mostly unexplored. Here we present the first study of time-optimized path selection via individual decision-making by scout ants. Megaponera analis scouts search for termite foraging sites and lead highly organized raid columns to them. The path of the scout determines the path of the column. Through installation of artificial roads around M. analis nests we were able to influence the pathway choice of the raids. After road installation 59% of all recorded raids took place completely or partly on the road, instead of the direct, i.e. distance-optimized, path through grass from the nest to the termites. The raid velocity on the road was more than double the grass velocity, the detour thus saved 34.77±23.01% of the travel time compared to a hypothetical direct path. The pathway choice of the ants was similar to a mathematical model of least time allowing us to hypothesize the underlying mechanisms regulating the behavior. Our results highlight the importance of individual decision-making in the foraging behavior of ants and show a new procedure of pathway optimization. © 2018. Published by The Company of Biologists Ltd.
Hippocampal “Time Cells”: Time versus Path Integration
Kraus, Benjamin J.; Robinson, Robert J.; White, John A.; Eichenbaum, Howard; Hasselmo, Michael E.
2014-01-01
SUMMARY Recent studies have reported the existence of hippocampal “time cells,” neurons that fire at particular moments during periods when behavior and location are relatively constant. However, an alternative explanation of apparent time coding is that hippocampal neurons “path integrate” to encode the distance an animal has traveled. Here, we examined hippocampal neuronal firing patterns as rats ran in place on a treadmill, thus “clamping” behavior and location, while we varied the treadmill speed to distinguish time elapsed from distance traveled. Hippocampal neurons were strongly influenced by time and distance, and less so by minor variations in location. Furthermore, the activity of different neurons reflected integration over time and distance to varying extents, with most neurons strongly influenced by both factors and some significantly influenced by only time or distance. Thus, hippocampal neuronal networks captured both the organization of time and distance in a situation where these dimensions dominated an ongoing experience. PMID:23707613
Characterization of radioactive-waste drum contents using real-time x-radiography
International Nuclear Information System (INIS)
Barna, B.A.; Bishoff, J.R.; Reinhardt, W.W.
1982-01-01
Low-level transuranic (TRU) waste is stored in a retrievable manner at the Radioactive Waste Management Complex (RWMC) operated by EG and G Idaho, Inc., for the Department of Energy. The waste, consisting of contaminated rags, paper, plastic, laboratory glassware, tools, scrap metal, wood, electrical components and parts, sludges, etc., is packed in various sized sealed containers, including 55 gallon drums. Waste which can be accurately characterized will be sent to the Waste Isolation Pilot Plant (WIPP) in New Mexico for long term storage if it is certified to meet the WIPP waste acceptance criteria. EG and G Idaho, Inc. is planning to install a real-time x-ray system designed for the automated and semi-automated examination of low-level TRU waste containers including 30, 55, and 83 gallon drums, 4 x 4 x 7 foot plywood boxes, and 4 x 5 x 6 foot metal bins during 1982. This system, designed for production, is capable of examining up to 20,000 waste containers per year using automated container handling, and features real-time x-ray imaging with a 420 kV, 10 ma constant potential source, digital image processing equipment, and video taping facilities (every container examination is required to be taped, for archival documentation). Work planned for the near future involves tests using real-time neutron radiography for waste characterization as a complement to real-time x-ray radiography. Ultimately, the NDE examinations will be combined with automated nondestructive assay (NDA) techniques for complete characterization of a given waste container's contents
Trinh, Lan Anh; Ekström, Mikael; Cürüklü, Baran
2018-01-01
Recent industrial developments in autonomous systems, or agents, which assume that humans and the agents share the same space or even work in close proximity, open for new challenges in robotics, especially in motion planning and control. In these settings, the control system should be able to provide these agents a reliable path following control when they are working in a group or in collaboration with one or several humans in complex and dynamic environments. In such scenarios, these agents are not only moving to reach their goals, i.e., locations, they are also aware of the movements of other entities to find a collision-free path. Thus, this paper proposes a dependable, i.e., safe, reliable and effective, path planning algorithm for a group of agents that share their working space with humans. Firstly, the method employs the Theta * algorithm to initialize the paths from a starting point to a goal for a set of agents. As Theta * algorithm is computationally heavy, it only reruns when there is a significant change of the environment. To deal with the movements of the agents, a static flow field along the configured path is defined. This field is used by the agents to navigate and reach their goals even if the planned trajectories are changed. Secondly, a dipole field is calculated to avoid the collision of agents with other agents and human subjects. In this approach, each agent is assumed to be a source of a magnetic dipole field in which the magnetic moment is aligned with the moving direction of the agent. The magnetic dipole-dipole interactions between these agents generate repulsive forces to help them to avoid collision. The effectiveness of the proposed approach has been evaluated with extensive simulations. The results show that the static flow field is able to drive agents to the goals with a small number of requirements to update the path of agents. Meanwhile, the dipole flow field plays an important role to prevent collisions. The combination of
Directory of Open Access Journals (Sweden)
Lan Anh Trinh
2018-06-01
Full Text Available Recent industrial developments in autonomous systems, or agents, which assume that humans and the agents share the same space or even work in close proximity, open for new challenges in robotics, especially in motion planning and control. In these settings, the control system should be able to provide these agents a reliable path following control when they are working in a group or in collaboration with one or several humans in complex and dynamic environments. In such scenarios, these agents are not only moving to reach their goals, i.e., locations, they are also aware of the movements of other entities to find a collision-free path. Thus, this paper proposes a dependable, i.e., safe, reliable and effective, path planning algorithm for a group of agents that share their working space with humans. Firstly, the method employs the Theta* algorithm to initialize the paths from a starting point to a goal for a set of agents. As Theta* algorithm is computationally heavy, it only reruns when there is a significant change of the environment. To deal with the movements of the agents, a static flow field along the configured path is defined. This field is used by the agents to navigate and reach their goals even if the planned trajectories are changed. Secondly, a dipole field is calculated to avoid the collision of agents with other agents and human subjects. In this approach, each agent is assumed to be a source of a magnetic dipole field in which the magnetic moment is aligned with the moving direction of the agent. The magnetic dipole-dipole interactions between these agents generate repulsive forces to help them to avoid collision. The effectiveness of the proposed approach has been evaluated with extensive simulations. The results show that the static flow field is able to drive agents to the goals with a small number of requirements to update the path of agents. Meanwhile, the dipole flow field plays an important role to prevent collisions. The
Energy Technology Data Exchange (ETDEWEB)
Carvalho, Ivo S., E-mail: ivoc@ipfn.ist.utl.pt; Duarte, Paulo; Fernandes, Horácio; Valcárcel, Daniel F.; Carvalho, Pedro J.; Silva, Carlos; Duarte, André S.; Neto, André; Sousa, Jorge; Batista, António J.N.; Hekkert, Tiago; Carvalho, Bernardo B.
2014-03-15
Highlights: • All real-time diagnostics and actuators were integrated in the same control platform. • A 100 μs control cycle was achieved under the MARTe framework. • Time-windows based control with several event-driven control strategies implemented. • AC discharges with exception handling on iron core flux saturation. • An HTML discharge configuration was developed for configuring the MARTe system. - Abstract: The ISTTOK tokamak was upgraded with a plasma control system based on the Advanced Telecommunications Computing Architecture (ATCA) standard. This control system was designed to improve the discharge stability and to extend the operational space to the alternate plasma current (AC) discharges as part of the ISTTOK scientific program. In order to accomplish these objectives all ISTTOK diagnostics and actuators relevant for real-time operation were integrated in the control system. The control system was programmed in C++ over the Multi-threaded Application Real-Time executor (MARTe) which provides, among other features, a real-time scheduler, an interrupt handler, an intercommunications interface between code blocks and a clearly bounded interface with the external devices. As a complement to the MARTe framework, the BaseLib2 library provides the foundations for the data, code introspection and also a Hypertext Transfer Protocol (HTTP) server service. Taking advantage of the modular nature of MARTe, the algorithms of each diagnostic data processing, discharge timing, context switch, control and actuators output reference generation, run on well-defined blocks of code named Generic Application Module (GAM). This approach allows reusability of the code, simplified simulation, replacement or editing without changing the remaining GAMs. The ISTTOK control system GAMs run sequentially each 100 μs cycle on an Intel{sup ®} Q8200 4-core processor running at 2.33 GHz located in the ATCA crate. Two boards (inside the ATCA crate) with 32 analog
International Nuclear Information System (INIS)
Carvalho, Ivo S.; Duarte, Paulo; Fernandes, Horácio; Valcárcel, Daniel F.; Carvalho, Pedro J.; Silva, Carlos; Duarte, André S.; Neto, André; Sousa, Jorge; Batista, António J.N.; Hekkert, Tiago; Carvalho, Bernardo B.
2014-01-01
Highlights: • All real-time diagnostics and actuators were integrated in the same control platform. • A 100 μs control cycle was achieved under the MARTe framework. • Time-windows based control with several event-driven control strategies implemented. • AC discharges with exception handling on iron core flux saturation. • An HTML discharge configuration was developed for configuring the MARTe system. - Abstract: The ISTTOK tokamak was upgraded with a plasma control system based on the Advanced Telecommunications Computing Architecture (ATCA) standard. This control system was designed to improve the discharge stability and to extend the operational space to the alternate plasma current (AC) discharges as part of the ISTTOK scientific program. In order to accomplish these objectives all ISTTOK diagnostics and actuators relevant for real-time operation were integrated in the control system. The control system was programmed in C++ over the Multi-threaded Application Real-Time executor (MARTe) which provides, among other features, a real-time scheduler, an interrupt handler, an intercommunications interface between code blocks and a clearly bounded interface with the external devices. As a complement to the MARTe framework, the BaseLib2 library provides the foundations for the data, code introspection and also a Hypertext Transfer Protocol (HTTP) server service. Taking advantage of the modular nature of MARTe, the algorithms of each diagnostic data processing, discharge timing, context switch, control and actuators output reference generation, run on well-defined blocks of code named Generic Application Module (GAM). This approach allows reusability of the code, simplified simulation, replacement or editing without changing the remaining GAMs. The ISTTOK control system GAMs run sequentially each 100 μs cycle on an Intel ® Q8200 4-core processor running at 2.33 GHz located in the ATCA crate. Two boards (inside the ATCA crate) with 32 analog
An exact formulation of the time-ordered exponential using path-sums
International Nuclear Information System (INIS)
Giscard, P.-L.; Lui, K.; Thwaite, S. J.; Jaksch, D.
2015-01-01
We present the path-sum formulation for the time-ordered exponential of a time-dependent matrix. The path-sum formulation gives the time-ordered exponential as a branched continued fraction of finite depth and breadth. The terms of the path-sum have an elementary interpretation as self-avoiding walks and self-avoiding polygons on a graph. Our result is based on a representation of the time-ordered exponential as the inverse of an operator, the mapping of this inverse to sums of walks on a graphs, and the algebraic structure of sets of walks. We give examples demonstrating our approach. We establish a super-exponential decay bound for the magnitude of the entries of the time-ordered exponential of sparse matrices. We give explicit results for matrices with commonly encountered sparse structures
An exact formulation of the time-ordered exponential using path-sums
Giscard, P.-L.; Lui, K.; Thwaite, S. J.; Jaksch, D.
2015-05-01
We present the path-sum formulation for the time-ordered exponential of a time-dependent matrix. The path-sum formulation gives the time-ordered exponential as a branched continued fraction of finite depth and breadth. The terms of the path-sum have an elementary interpretation as self-avoiding walks and self-avoiding polygons on a graph. Our result is based on a representation of the time-ordered exponential as the inverse of an operator, the mapping of this inverse to sums of walks on a graphs, and the algebraic structure of sets of walks. We give examples demonstrating our approach. We establish a super-exponential decay bound for the magnitude of the entries of the time-ordered exponential of sparse matrices. We give explicit results for matrices with commonly encountered sparse structures.
Real-time Planning Support: A Task-technology Fit Perspective
E. Krauth (Elfriede)
2008-01-01
textabstractPlanning technology by itself is not sufficient to improve planning performance. What are the factors that determine the extent to which the benefits of planning technology are realized? In order to answer this question, this dissertation studies four mechanisms of fit between task and
Acquisition Path Analysis as a Collaborative Activity
International Nuclear Information System (INIS)
Nakao, A.; Grundule, R.; Gushchyn, K.; El Gebaly, A.; Higgy, R.; Tsvetkov, I.; Mandl, W.
2015-01-01
In the International Atomic Energy Agency, acquisition path analysis (APA) is indispensable to safeguards implementation. It is an integral part of both State evaluation process and the development of State level safeguards approaches, all performed through ongoing collaborative analysis of all available safeguards relevant information by State evaluation groups (SEG) with participation of other contributors, as required. To perform comprehensive State evaluation, to develop and revise State-level safeguards approaches, and to prepare annual implementation plans, the SEG in its collaborative analysis follows accepted safeguards methodology and guidance. In particular, the guide ''Performing Acquisition Path Analysis for the Development of a State-level Safeguards Approach for a State with a CSA'' is used. This guide identifies four major steps of the APA process: 1. Consolidating information about the State's past, present and planned nuclear fuel cycle-related capabilities and infrastructure; 2. Identifying and visually presenting technically plausible acquisition paths for the State; 3. Assessing acquisition path steps (State's technical capabilities and possible actions) along the identified acquisition paths; and 4. Assessing the time needed to accomplish each identified technically plausible acquisition path for the State. The paper reports on SEG members' and other contributors' experience with APA when following the above steps, including the identification of plausible acquisition pathways, estimation of time frames for all identified steps and determination of the time needed to accomplish each acquisition path. The difficulties that the SEG encountered during the process of performing the APA are also addressed. Feedback in the form of practical suggestions for improving the clarity of the acquisition path step assessment forms and a proposal for software support are also included. (author)
Real time, real fast : drilling horizontal wells in a heavy oil environment
Energy Technology Data Exchange (ETDEWEB)
Balke, S.C.; Rosauer, M.S. [Petrolera Ameriven/Phillips Petroleum, Caracas, (Venezuela)
2002-07-01
Eastern Venezuela's Orinoco Tar Belt or the Faja Petrolifera del Orinoco is one of the largest heavy oil fields in the world, containing more than 1.2 trillion barrels of heavy and extra heavy oil with API gravity of 10 to 6. The field is 320 miles long by 40 miles wide and is divided into the Machete, Zuata, Hamaca and Cerro Negro. It has been under production since the 1970s by Venezuela's national oil company, Petroleos de Venezuela SA. The region is only marginally cost effective because of the high costs associated with development. It is expected that the Hamaca Project, which is centrally located in the Orinoco Tar Belt can be effectively and economically developed by applying the latest technology and innovative techniques. Petrolera Ameriven has committed to develop the 250 square mile Hamaca area. The objective is to produce 165,000 acres at rate of 190,000 BOPD for the life of the project. The challenge is that when the oil is cooled and degasified it looks more like a tar or asphalt for paving roads. In addition, the major reservoirs within the field were deposited in low stand and transgressive system tracks consisting of meandering fluvial to fluvial-tidal deltaic deposits. Methods such as logging while drilling (LWD), satellite links and continuous updating and real-time visualization were applied to assess and mitigate risks. These methods made it possible to accurately place the shoe of the build sections for control of well directions. The methods also made it possible to identify sand/shale interfaces, determine the redirection of the drill bit, locate non-pay zones and help plan well paths to optimize production. The technologies developed were also effective in minimizing development costs, thereby improving the financial viability of the project. 1 ref., 16 figs.
A framework for predicting three-dimensional prostate deformation in real time
Jahya, Alex; Herink, Mark; Misra, Sarthak
2013-01-01
Background Surgical simulation systems can be used to estimate soft tissue deformation during pre- and intra-operative planning. Such systems require a model that can accurately predict the deformation in real time. In this study, we present a back-propagation neural network for predicting
A Kinect-based real-time compressive tracking prototype system for amphibious spherical robots.
Pan, Shaowu; Shi, Liwei; Guo, Shuxiang
2015-04-08
A visual tracking system is essential as a basis for visual servoing, autonomous navigation, path planning, robot-human interaction and other robotic functions. To execute various tasks in diverse and ever-changing environments, a mobile robot requires high levels of robustness, precision, environmental adaptability and real-time performance of the visual tracking system. In keeping with the application characteristics of our amphibious spherical robot, which was proposed for flexible and economical underwater exploration in 2012, an improved RGB-D visual tracking algorithm is proposed and implemented. Given the limited power source and computational capabilities of mobile robots, compressive tracking (CT), which is the effective and efficient algorithm that was proposed in 2012, was selected as the basis of the proposed algorithm to process colour images. A Kalman filter with a second-order motion model was implemented to predict the state of the target and select candidate patches or samples for the CT tracker. In addition, a variance ratio features shift (VR-V) tracker with a Kalman estimation mechanism was used to process depth images. Using a feedback strategy, the depth tracking results were used to assist the CT tracker in updating classifier parameters at an adaptive rate. In this way, most of the deficiencies of CT, including drift and poor robustness to occlusion and high-speed target motion, were partly solved. To evaluate the proposed algorithm, a Microsoft Kinect sensor, which combines colour and infrared depth cameras, was adopted for use in a prototype of the robotic tracking system. The experimental results with various image sequences demonstrated the effectiveness, robustness and real-time performance of the tracking system.
A Kinect-Based Real-Time Compressive Tracking Prototype System for Amphibious Spherical Robots
Directory of Open Access Journals (Sweden)
Shaowu Pan
2015-04-01
Full Text Available A visual tracking system is essential as a basis for visual servoing, autonomous navigation, path planning, robot-human interaction and other robotic functions. To execute various tasks in diverse and ever-changing environments, a mobile robot requires high levels of robustness, precision, environmental adaptability and real-time performance of the visual tracking system. In keeping with the application characteristics of our amphibious spherical robot, which was proposed for flexible and economical underwater exploration in 2012, an improved RGB-D visual tracking algorithm is proposed and implemented. Given the limited power source and computational capabilities of mobile robots, compressive tracking (CT, which is the effective and efficient algorithm that was proposed in 2012, was selected as the basis of the proposed algorithm to process colour images. A Kalman filter with a second-order motion model was implemented to predict the state of the target and select candidate patches or samples for the CT tracker. In addition, a variance ratio features shift (VR-V tracker with a Kalman estimation mechanism was used to process depth images. Using a feedback strategy, the depth tracking results were used to assist the CT tracker in updating classifier parameters at an adaptive rate. In this way, most of the deficiencies of CT, including drift and poor robustness to occlusion and high-speed target motion, were partly solved. To evaluate the proposed algorithm, a Microsoft Kinect sensor, which combines colour and infrared depth cameras, was adopted for use in a prototype of the robotic tracking system. The experimental results with various image sequences demonstrated the effectiveness, robustness and real-time performance of the tracking system.
Welding Robot Collision-Free Path Optimization
Directory of Open Access Journals (Sweden)
Xuewu Wang
2017-02-01
Full Text Available Reasonable welding path has a significant impact on welding efficiency, and a collision-free path should be considered first in the process of welding robot path planning. The shortest path length is considered as an optimization objective, and obstacle avoidance is considered as the constraint condition in this paper. First, a grid method is used as a modeling method after the optimization objective is analyzed. For local collision-free path planning, an ant colony algorithm is selected as the search strategy. Then, to overcome the shortcomings of the ant colony algorithm, a secondary optimization is presented to improve the optimization performance. Finally, the particle swarm optimization algorithm is used to realize global path planning. Simulation results show that the desired welding path can be obtained based on the optimization strategy.
Real-Time Noise Prediction of V/STOL Aircraft in Maneuvering Flight, Phase I
National Aeronautics and Space Administration — This proposal outlines a plan for enhancing and integrating new breakthrough technologies to provide accurate real-time noise prediction of V/STOL aircraft in...
Wireless real-time haze monitoring device | Ya'acob | Journal of ...
African Journals Online (AJOL)
controller to control the transmission process of measured data taken via wireless data network to the MySQL database. The reading, which is real-time reading and more accurate compared to pollutant PM10, can provide haze awareness and guidance to people to plan their activities. Keywords: PSI; PM10; PM2.5; ...
Lee, Hong-Won; Kyung, Taeyoon; Yoo, Janghyun; Kim, Tackhoon; Chung, Chaeuk; Ryu, Ji Young; Lee, Hanki; Park, Kihyun; Lee, Sangkyu; Jones, Walton D.; Lim, Dae-Sik; Hyeon, Changbong; Do Heo, Won; Yoon, Tae-Young
2013-01-01
Co-immunoprecipitation (co-IP) has become a standard technique, but its protein-band output provides only static, qualitative information about protein–protein interactions. Here we demonstrate a real-time single-molecule co-IP technique that generates real-time videos of individual protein–protein interactions as they occur in unpurified cell extracts. By analysing single Ras–Raf interactions with a 50-ms time resolution, we have observed transient intermediates of the protein–protein interaction and determined all the essential kinetic rates. Using this technique, we have quantified the active fraction of native Ras proteins in xenograft tumours, normal tissue and cancer cell lines. We demonstrate that the oncogenic Ras mutations selectively increase the active-Ras fraction by one order of magnitude, without affecting total Ras levels or single-molecule signalling kinetics. Our approach allows us to probe the previously hidden, dynamic aspects of weak protein–protein interactions. It also suggests a path forward towards precision molecular diagnostics at the protein–protein interaction level. PMID:23422673
Reaction paths based on mean first-passage times
International Nuclear Information System (INIS)
Park, Sanghyun; Sener, Melih K.; Lu Deyu; Schulten, Klaus
2003-01-01
Finding representative reaction pathways is important for understanding the mechanism of molecular processes. We propose a new approach for constructing reaction paths based on mean first-passage times. This approach incorporates information about all possible reaction events as well as the effect of temperature. As an application of this method, we study representative pathways of excitation migration in a photosynthetic light-harvesting complex, photosystem I. The paths thus computed provide a complete, yet distilled, representation of the kinetic flow of excitation toward the reaction center, thereby succinctly characterizing the function of the system
Path integration on space times with symmetry
International Nuclear Information System (INIS)
Low, S.G.
1985-01-01
Path integration on space times with symmetry is investigated using a definition of path integration of Gaussian integrators. Gaussian integrators, systematically developed using the theory of projective distributions, may be defined in terms of a Jacobi operator Green function. This definition of the path integral yields a semiclassical expansion of the propagator which is valid on caustics. The semiclassical approximation to the free particle propagator on symmetric and reductive homogeneous spaces is computed in terms of the complete solution of the Jacobi equation. The results are used to test the validity of using the Schwinger-DeWitt transform to compute an approximation to the coincidence limit of a field theory Green function from a WKB propagator. The method is found not to be valid except for certain special cases. These cases include manifolds constructed from the direct product of flat space and group manifolds, on which the free particle WKB approximation is exact and two sphere. The multiple geodesic contribution to 2 > on Schwarzschild in the neighborhood of rho = 3M is computed using the transform
Clement, Warren F.; Gorder, Peter J.; Jewell, Wayne F.
1991-01-01
Developing a single-pilot, all-weather nap-of-the-earth (NOE) capability requires fully automatic NOE (ANOE) navigation and flight control. Innovative guidance and control concepts are investigated in a four-fold research effort that: (1) organizes the on-board computer-based storage and real-time updating of NOE terrain profiles and obstacles in course-oriented coordinates indexed to the mission flight plan; (2) defines a class of automatic anticipative pursuit guidance algorithms and necessary data preview requirements to follow the vertical, lateral, and longitudinal guidance commands dictated by the updated flight profiles; (3) automates a decision-making process for unexpected obstacle avoidance; and (4) provides several rapid response maneuvers. Acquired knowledge from the sensed environment is correlated with the forehand knowledge of the recorded environment (terrain, cultural features, threats, and targets), which is then used to determine an appropriate evasive maneuver if a nonconformity of the sensed and recorded environments is observed. This four-fold research effort was evaluated in both fixed-based and moving-based real-time piloted simulations, thereby, providing a practical demonstration for evaluating pilot acceptance of the automated concepts, supervisory override, manual operation, and re-engagement of the automatic system. Volume one describes the major components of the guidance and control laws as well as the results of the piloted simulations. Volume two describes the complete mathematical model of the fully automatic guidance system for rotorcraft NOE flight following planned flight profiles.
Current status of DIII-D real-time digital plasma control
International Nuclear Information System (INIS)
Penaflor, B.G.; Piglowski, D.A.; Ferron, J.R.; Walker, M.L.
1999-06-01
This paper describes the current status of real-time digital plasma control for the DIII-D tokamak. The digital plasma control system (PCS) has been in place at DIII-D since the early 1990s and continues to expand and improve in its capabilities to monitor and control plasma parameters for DIII-D fusion science experiments. The PCs monitors over 200 tokamak parameters from the DIII-D experiment using a real-time data acquisition system that acquires a new set of samples once every 60 micros. This information is then used in a number of feedback control algorithms to compute and control a variety of parameters including those affecting plasma shape and position. A number of system related improvements has improved the usability and flexibility of the DIII-D PCS. These include more graphical user interfaces to assist in entering and viewing the large and ever growing number of parameters controlled by the PCS, increased interaction and accessibility from other DIII-D applications, and upgrades to the computer hardware and vended software. Future plans for the system include possible upgrades of the real-time computers, further links to other DIII-D diagnostic measurements such as real-time Thomson scattering analysis, and joint collaborations with other tokamak experiments including the NSTX at Princeton
Canonical failure modes of real-time control systems: insights from cognitive theory
Wallace, Rodrick
2016-04-01
Newly developed necessary conditions statistical models from cognitive theory are applied to generalisation of the data-rate theorem for real-time control systems. Rather than graceful degradation under stress, automatons and man/machine cockpits appear prone to characteristic sudden failure under demanding fog-of-war conditions. Critical dysfunctions span a spectrum of phase transition analogues, ranging from a ground state of 'all targets are enemies' to more standard data-rate instabilities. Insidious pathologies also appear possible, akin to inattentional blindness consequent on overfocus on an expected pattern. Via no-free-lunch constraints, different equivalence classes of systems, having structure and function determined by 'market pressures', in a large sense, will be inherently unreliable under different but characteristic canonical stress landscapes, suggesting that deliberate induction of failure may often be relatively straightforward. Focusing on two recent military case histories, these results provide a caveat emptor against blind faith in the current path-dependent evolutionary trajectory of automation for critical real-time processes.
Mathematical optimization for planning and design of cycle paths
Energy Technology Data Exchange (ETDEWEB)
LiÑan Ruiz, R.J.; Perez Aracil, J.; Cabrera Cañizares, V.
2016-07-01
The daily need for citizens to move for different activities, whatever its nature, has been greatly affected by the changes. The advantages resulting from the inclusion of the bicycle as a mode of transport and the proliferation of its use among citizens are numerous and extend both in the field of urban mobility and sustainable development.Currently, there are a number of programs for the implementation, promotion or increased public participation related to cycling in cities. But ultimately, each and every one of these initiatives have the same goal, to create a mesh of effective, useful and cycling trails that allow the use of bicycles in preferred routes with high guarantees of security, incorporating bicycle model intermodal urban transport.With the gradual implementation of bike lanes, many people have begun to use them to get around the city. But everything again needs a period of adaptation, and the reality is that the road network for these vehicles is full of obstacles to the rider. The current situation has led to the proposal that many kilometers of cycle paths needed to supply the demand of this mode of transport and, if implemented and planned are correct and sufficient.This paper presents a mathematical programming model for optimal design of a network for cyclists is presented. Specifically, the model determines a network of bicycle infrastructure, appropriate to the characteristics of a network of existing roads.As an application of the proposed model, the result of these experiments give a number of useful conclusions for planning and designing networks of cycle paths from a social perspective, applied to the case in the city of Malaga. (Author)
Application of real-time cooperative editing in urban planning management system
Jing, Changfeng; Liu, Renyi; Liu, Nan; Bao, Weizheng
2007-06-01
With the increasing of business requirement of urban planning bureau, co-edit function is needed urgently, however conventional GIS are not support this. In order to overcome this limitation, a new kind urban 1planning management system with co-edit function is needed. Such a system called PM2006 has been used in Suzhou Urban Planning Bureau. PM2006 is introduced in this paper. In this paper, four main issues of Co-edit system--consistency, responsiveness time, data recoverability and unconstrained operation--were discussed. And for these four questions, resolutions were put forward in paper. To resolve these problems of co-edit GIS system, a data model called FGDB (File and ESRI GeoDatabase) that is mixture architecture of File and ESRI Geodatabase was introduced here. The main components of FGDB data model are ESRI versioned Geodatabase and replicated architecture. With FGDB, client responsiveness, spatial data recoverability and unconstrained operation were overcome. In last of paper, MapServer, the co-edit map server module, is presented. Main functions of MapServer are operation serialization and spatial data replication between file and versioned data.
Real-time control of fusion reactors
International Nuclear Information System (INIS)
Goncalves, B.; Sousa, J.; Varandas, C.A.F.
2010-01-01
The next generation fusion experiments, e.g. ITER, will be highly complex and raise new challenges in the field of control and data acquisition systems. The more advanced operation scenarios have to be capable of sustaining long pulse steady-state plasma and to suppress plasma instabilities almost completely. Such scenarios will heavily rely on Multiple-Input-Multiple-Output (MIMO) fast control systems. To ensure safety for the operation these systems have to be robust and resilient to faults while ensuring high availability. Mindful of the importance of such features for future fusion experiments ATCA based systems have been successfully used in fusion experiment as MIMO fast controller. This is the most promising architecture to substantially enhance the performance and capability of existing standard systems delivering well high throughput as well as high availability. The real-time control needs of a fusion experiment, the rational for the presently pursued solutions, the existing problems and the broad scientific and technical questions that need to be addressed on the path to a fusion power plant will be discussed.
Real-Time Forecasting of EV Charging Station Scheduling for Smart Energy Systems
Directory of Open Access Journals (Sweden)
Bharatiraja Chokkalingam
2017-03-01
Full Text Available The enormous growth in the penetration of electric vehicles (EVs, has laid the path to advancements in the charging infrastructure. Connectivity between charging stations is an essential prerequisite for future EV adoption to alleviate user’s “range anxiety”. The existing charging stations fail to adopt power provision, allocation and scheduling management. To improve the existing charging infrastructure, data based on real-time information and availability of reserves at charging stations could be uploaded to the users to help them locate the nearest charging station for an EV. This research article focuses on an a interactive user application developed through SQL and PHP platform to allocate the charging slots based on estimated battery parameters, which uses data communication with charging stations to receive the slot availability information. The proposed server-based real-time forecast charging infrastructure avoids waiting times and its scheduling management efficiently prevents the EV from halting on the road due to battery drain out. The proposed model is implemented using a low-cost microcontroller and the system etiquette tested.
A real-time architecture for time-aware agents.
Prouskas, Konstantinos-Vassileios; Pitt, Jeremy V
2004-06-01
This paper describes the specification and implementation of a new three-layer time-aware agent architecture. This architecture is designed for applications and environments where societies of humans and agents play equally active roles, but interact and operate in completely different time frames. The architecture consists of three layers: the April real-time run-time (ART) layer, the time aware layer (TAL), and the application agents layer (AAL). The ART layer forms the underlying real-time agent platform. An original online, real-time, dynamic priority-based scheduling algorithm is described for scheduling the computation time of agent processes, and it is shown that the algorithm's O(n) complexity and scalable performance are sufficient for application in real-time domains. The TAL layer forms an abstraction layer through which human and agent interactions are temporally unified, that is, handled in a common way irrespective of their temporal representation and scale. A novel O(n2) interaction scheduling algorithm is described for predicting and guaranteeing interactions' initiation and completion times. The time-aware predicting component of a workflow management system is also presented as an instance of the AAL layer. The described time-aware architecture addresses two key challenges in enabling agents to be effectively configured and applied in environments where humans and agents play equally active roles. It provides flexibility and adaptability in its real-time mechanisms while placing them under direct agent control, and it temporally unifies human and agent interactions.
Unmanned airborne system in real-time radiological monitoring
International Nuclear Information System (INIS)
Zafrir, H.; Pernick, A.; Yaffe, U.; Grushka, A.
1993-01-01
The unmanned airborne vehicle (UAV) platform, equipped with an appropriate payload and capable of carrying a variety of modular sensors, is an effective tool for real-time control of environmental disasters of different types (e.g. nuclear or chemical accidents). The suggested payloads consist of a miniaturised self-collimating nuclear spectrometry sensor and electro-optical sensors for day and night imagery. The system provides means of both real-time field data acquisition in an endangered environment and on-line hazard assessment computation from the down link raw data. All the processing, including flight planning using an expert system, is performed by a dedicated microcomputer located in a Mobile Ground Control Station (MGCS) situated outside the hazardous area. The UAV equipment is part of a system designed especially for the critically important early phase of emergency response. Decisions by the Emergency Response Manager (ERM) are also based on the ability to estimate the potential dose to individuals and the mitigation of dose when protection measures are implemented. (author)
Path planning for first responders in the presence of moving obstacles
Directory of Open Access Journals (Sweden)
Zhiyong Wang
2015-06-01
the above research questions, this research has been conducted using the following outline: 1. literature review; 2. conceptual design and analysis; 3. implementation of the prototype; and 4. assessment of the prototype and adaption. We investigated previous research related to navigation in disasters, and designed an integrated navigation system architecture, assisting responders in spatial data storage, processing and analysis.Within this architecture, we employ hazard models to provide the predicted information about the obstacles, and select a geo-database to store the data needed for emergency navigation. Throughout the development of the prototype navigation system, we have proposed: • a taxonomy of navigation among obstacles, which categorizes navigation cases on basis of type and multiplicity of first responders, destinations, and obstacles; • a multi-agent system, which supports information collection from hazard simulations, spatio-temporal data processing and analysis, connection with a geo-database, and route generation in dynamic environments affected by disasters; • data models, which structure the information required for finding paths among moving obstacles, capturing both static information, such as the type of the response team, the topology of the road network, and dynamic information, such as changing availabilities of roads during disasters, the uncertainty of the moving obstacles generated from hazard simulations, and the position of the vehicle; • path planning algorithms, which generate routes for one or more responders in the presence of moving obstacles. Using the speed of vehicles, departure time, and the predicted information about the state of the road network, etc., three versions (I, II, and III of Moving Obstacle Avoiding A* (MOAAStar algorithms are developed: 1. MOAAstar– I/Non-waiting, which supports path planning in the case of forest fires; 2. MOAAstar–II/Waiting, which introduces waiting options to avoid moving
Towards Real-Time Argumentation
Directory of Open Access Journals (Sweden)
Vicente JULIÁN
2016-07-01
Full Text Available In this paper, we deal with the problem of real-time coordination with the more general approach of reaching real-time agreements in MAS. Concretely, this work proposes a real-time argumentation framework in an attempt to provide agents with the ability of engaging in argumentative dialogues and come with a solution for their underlying agreement process within a bounded period of time. The framework has been implemented and evaluated in the domain of a customer support application. Concretely, we consider a society of agents that act on behalf of a group of technicians that must solve problems in a Technology Management Centre (TMC within a bounded time. This centre controls every process implicated in the provision of technological and customer support services to private or public organisations by means of a call centre. The contract signed between the TCM and the customer establishes penalties if the specified time is exceeded.
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.
Highly reconfigurable production systems controlled by real-time agents
Schütz, D.;Schraufstetter, M.;Folmer, J.;Vogel-Heuser, B.;Gmeiner, T.;Shea, K.
2017-01-01
Flexible plant components can significantly increase the flexibility of manufacturing systems and enable concepts like mass-customized production. This paper presents an approach for production planning and execution for flexible manufacturing system components, based on software agents. The agents are implemented directly on a PLC, making them capable of real-time operation. Additionally, a service-interface contributes to the vertical integration of the approach into the higher level planni...
Fast leaf-fitting with generalized underdose/overdose constraints for real-time MLC tracking
Energy Technology Data Exchange (ETDEWEB)
Moore, Douglas, E-mail: douglas.moore@utsouthwestern.edu; Sawant, Amit [Department of Radiation Oncology, UT Southwestern Medical Center, Dallas, Texas 75390 (United States); Ruan, Dan [Department of Radiation Oncology, University of California, Los Angeles, California 90095 (United States)
2016-01-15
Purpose: Real-time multileaf collimator (MLC) tracking is a promising approach to the management of intrafractional tumor motion during thoracic and abdominal radiotherapy. MLC tracking is typically performed in two steps: transforming a planned MLC aperture in response to patient motion and refitting the leaves to the newly generated aperture. One of the challenges of this approach is the inability to faithfully reproduce the desired motion-adapted aperture. This work presents an optimization-based framework with which to solve this leaf-fitting problem in real-time. Methods: This optimization framework is designed to facilitate the determination of leaf positions in real-time while accounting for the trade-off between coverage of the PTV and avoidance of organs at risk (OARs). Derived within this framework, an algorithm is presented that can account for general linear transformations of the planned MLC aperture, particularly 3D translations and in-plane rotations. This algorithm, together with algorithms presented in Sawant et al. [“Management of three-dimensional intrafraction motion through real-time DMLC tracking,” Med. Phys. 35, 2050–2061 (2008)] and Ruan and Keall [Presented at the 2011 IEEE Power Engineering and Automation Conference (PEAM) (2011) (unpublished)], was applied to apertures derived from eight lung intensity modulated radiotherapy plans subjected to six-degree-of-freedom motion traces acquired from lung cancer patients using the kilovoltage intrafraction monitoring system developed at the University of Sydney. A quality-of-fit metric was defined, and each algorithm was evaluated in terms of quality-of-fit and computation time. Results: This algorithm is shown to perform leaf-fittings of apertures, each with 80 leaf pairs, in 0.226 ms on average as compared to 0.082 and 64.2 ms for the algorithms of Sawant et al., Ruan, and Keall, respectively. The algorithm shows approximately 12% improvement in quality-of-fit over the Sawant et al
Fast leaf-fitting with generalized underdose/overdose constraints for real-time MLC tracking
International Nuclear Information System (INIS)
Moore, Douglas; Sawant, Amit; Ruan, Dan
2016-01-01
Purpose: Real-time multileaf collimator (MLC) tracking is a promising approach to the management of intrafractional tumor motion during thoracic and abdominal radiotherapy. MLC tracking is typically performed in two steps: transforming a planned MLC aperture in response to patient motion and refitting the leaves to the newly generated aperture. One of the challenges of this approach is the inability to faithfully reproduce the desired motion-adapted aperture. This work presents an optimization-based framework with which to solve this leaf-fitting problem in real-time. Methods: This optimization framework is designed to facilitate the determination of leaf positions in real-time while accounting for the trade-off between coverage of the PTV and avoidance of organs at risk (OARs). Derived within this framework, an algorithm is presented that can account for general linear transformations of the planned MLC aperture, particularly 3D translations and in-plane rotations. This algorithm, together with algorithms presented in Sawant et al. [“Management of three-dimensional intrafraction motion through real-time DMLC tracking,” Med. Phys. 35, 2050–2061 (2008)] and Ruan and Keall [Presented at the 2011 IEEE Power Engineering and Automation Conference (PEAM) (2011) (unpublished)], was applied to apertures derived from eight lung intensity modulated radiotherapy plans subjected to six-degree-of-freedom motion traces acquired from lung cancer patients using the kilovoltage intrafraction monitoring system developed at the University of Sydney. A quality-of-fit metric was defined, and each algorithm was evaluated in terms of quality-of-fit and computation time. Results: This algorithm is shown to perform leaf-fittings of apertures, each with 80 leaf pairs, in 0.226 ms on average as compared to 0.082 and 64.2 ms for the algorithms of Sawant et al., Ruan, and Keall, respectively. The algorithm shows approximately 12% improvement in quality-of-fit over the Sawant et al
Mackay, Ian M; Arden, Katherine E; Nitsche, Andreas
2002-03-15
The use of the polymerase chain reaction (PCR) in molecular diagnostics has increased to the point where it is now accepted as the gold standard for detecting nucleic acids from a number of origins and it has become an essential tool in the research laboratory. Real-time PCR has engendered wider acceptance of the PCR due to its improved rapidity, sensitivity, reproducibility and the reduced risk of carry-over contamination. There are currently five main chemistries used for the detection of PCR product during real-time PCR. These are the DNA binding fluorophores, the 5' endonuclease, adjacent linear and hairpin oligoprobes and the self-fluorescing amplicons, which are described in detail. We also discuss factors that have restricted the development of multiplex real-time PCR as well as the role of real-time PCR in quantitating nucleic acids. Both amplification hardware and the fluorogenic detection chemistries have evolved rapidly as the understanding of real-time PCR has developed and this review aims to update the scientist on the current state of the art. We describe the background, advantages and limitations of real-time PCR and we review the literature as it applies to virus detection in the routine and research laboratory in order to focus on one of the many areas in which the application of real-time PCR has provided significant methodological benefits and improved patient outcomes. However, the technology discussed has been applied to other areas of microbiology as well as studies of gene expression and genetic disease.
Real-time temperature field measurement based on acoustic tomography
International Nuclear Information System (INIS)
Bao, Yong; Jia, Jiabin; Polydorides, Nick
2017-01-01
Acoustic tomography can be used to measure the temperature field from the time-of-flight (TOF). In order to capture real-time temperature field changes and accurately yield quantitative temperature images, two improvements to the conventional acoustic tomography system are studied: simultaneous acoustic transmission and TOF collection along multiple ray paths, and an offline iteration reconstruction algorithm. During system operation, all the acoustic transceivers send modulated and filtered wideband Kasami sequences simultaneously to facilitate fast and accurate TOF measurements using cross-correlation detection. For image reconstruction, the iteration process is separated and executed offline beforehand to shorten computation time for online temperature field reconstruction. The feasibility and effectiveness of the developed methods are validated in the simulation study. The simulation results demonstrate that the proposed method can reduce the processing time per frame from 160 ms to 20 ms, while the reconstruction error remains less than 5%. Hence, the proposed method has great potential in the measurement of rapid temperature change with good temporal and spatial resolution. (paper)
Real time programming environment for Windows
Energy Technology Data Exchange (ETDEWEB)
LaBelle, D.R. [LaBelle (Dennis R.), Clifton Park, NY (United States)
1998-04-01
This document provides a description of the Real Time Programming Environment (RTProE). RTProE tools allow a programmer to create soft real time projects under general, multi-purpose operating systems. The basic features necessary for real time applications are provided by RTProE, leaving the programmer free to concentrate efforts on his specific project. The current version supports Microsoft Windows{trademark} 95 and NT. The tasks of real time synchronization and communication with other programs are handled by RTProE. RTProE includes a generic method for connecting a graphical user interface (GUI) to allow real time control and interaction with the programmer`s product. Topics covered in this paper include real time performance issues, portability, details of shared memory management, code scheduling, application control, Operating System specific concerns and the use of Computer Aided Software Engineering (CASE) tools. The development of RTProE is an important step in the expansion of the real time programming community. The financial costs associated with using the system are minimal. All source code for RTProE has been made publicly available. Any person with access to a personal computer, Windows 95 or NT, and C or FORTRAN compilers can quickly enter the world of real time modeling and simulation.
A two-hop based adaptive routing protocol for real-time wireless sensor networks.
Rachamalla, Sandhya; Kancherla, Anitha Sheela
2016-01-01
One of the most important and challenging issues in wireless sensor networks (WSNs) is to optimally manage the limited energy of nodes without degrading the routing efficiency. In this paper, we propose an energy-efficient adaptive routing mechanism for WSNs, which saves energy of nodes by removing the much delayed packets without degrading the real-time performance of the used routing protocol. It uses the adaptive transmission power algorithm which is based on the attenuation of the wireless link to improve the energy efficiency. The proposed routing mechanism can be associated with any geographic routing protocol and its performance is evaluated by integrating with the well known two-hop based real-time routing protocol, PATH and the resulting protocol is energy-efficient adaptive routing protocol (EE-ARP). The EE-ARP performs well in terms of energy consumption, deadline miss ratio, packet drop and end-to-end delay.
An In-Home Digital Network Architecture for Real-Time and Non-Real-Time Communication
Scholten, Johan; Jansen, P.G.; Hanssen, F.T.Y.; Hattink, Tjalling
2002-01-01
This paper describes an in-home digital network architecture that supports both real-time and non-real-time communication. The architecture deploys a distributed token mechanism to schedule communication streams and to offer guaranteed quality-ofservice. Essentially, the token mechanism prevents
Salecker-Wigner-Peres clock, Feynman paths, and a tunneling time that should not exist
Sokolovski, D.
2017-08-01
The Salecker-Wigner-Peres (SWP) clock is often used to determine the duration a quantum particle is supposed to spend in a specified region of space Ω . By construction, the result is a real positive number, and the method seems to avoid the difficulty of introducing complex time parameters, which arises in the Feynman paths approach. However, it tells little about the particle's motion. We investigate this matter further, and show that the SWP clock, like any other Larmor clock, correlates the rotation of its angular momentum with the durations τ , which the Feynman paths spend in Ω , thereby destroying interference between different durations. An inaccurate weakly coupled clock leaves the interference almost intact, and the need to resolve the resulting "which way?" problem is one of the main difficulties at the center of the "tunnelling time" controversy. In the absence of a probability distribution for the values of τ , the SWP results are expressed in terms of moduli of the "complex times," given by the weighted sums of the corresponding probability amplitudes. It is shown that overinterpretation of these results, by treating the SWP times as physical time intervals, leads to paradoxes and should be avoided. We also analyze various settings of the SWP clock, different calibration procedures, and the relation between the SWP results and the quantum dwell time. The cases of stationary tunneling and tunnel ionization are considered in some detail. Although our detailed analysis addresses only one particular definition of the duration of a tunneling process, it also points towards the impossibility of uniting various time parameters, which may occur in quantum theory, within the concept of a single tunnelling time.
MARTe: A Multiplatform Real-Time Framework
Neto, André C.; Sartori, Filippo; Piccolo, Fabio; Vitelli, Riccardo; De Tommasi, Gianmaria; Zabeo, Luca; Barbalace, Antonio; Fernandes, Horacio; Valcarcel, Daniel F.; Batista, Antonio J. N.
2010-04-01
Development of real-time applications is usually associated with nonportable code targeted at specific real-time operating systems. The boundary between hardware drivers, system services, and user code is commonly not well defined, making the development in the target host significantly difficult. The Multithreaded Application Real-Time executor (MARTe) is a framework built over a multiplatform library that allows the execution of the same code in different operating systems. The framework provides the high-level interfaces with hardware, external configuration programs, and user interfaces, assuring at the same time hard real-time performances. End-users of the framework are required to define and implement algorithms inside a well-defined block of software, named Generic Application Module (GAM), that is executed by the real-time scheduler. Each GAM is reconfigurable with a set of predefined configuration meta-parameters and interchanges information using a set of data pipes that are provided as inputs and required as output. Using these connections, different GAMs can be chained either in series or parallel. GAMs can be developed and debugged in a non-real-time system and, only once the robustness of the code and correctness of the algorithm are verified, deployed to the real-time system. The software also supplies a large set of utilities that greatly ease the interaction and debugging of a running system. Among the most useful are a highly efficient real-time logger, HTTP introspection of real-time objects, and HTTP remote configuration. MARTe is currently being used to successfully drive the plasma vertical stabilization controller on the largest magnetic confinement fusion device in the world, with a control loop cycle of 50 ?s and a jitter under 1 ?s. In this particular project, MARTe is used with the Real-Time Application Interface (RTAI)/Linux operating system exploiting the new ?86 multicore processors technology.
Directory of Open Access Journals (Sweden)
Carlos Garre
2014-01-01
Full Text Available Physical simulation is a valuable tool in many fields of engineering for the tasks of design, prototyping, and testing. General-purpose operating systems (GPOS are designed for real-fast tasks, such as offline simulation of complex physical models that should finish as soon as possible. Interfacing hardware at a given rate (as in a hardware-in-the-loop test requires instead maximizing time determinism, for which real-time operating systems (RTOS are designed. In this paper, real-fast and real-time performance of RTOS and GPOS are compared when simulating models of high complexity with large time steps. This type of applications is usually present in the automotive industry and requires a good trade-off between real-fast and real-time performance. The performance of an RTOS and a GPOS is compared by running a tire model scalable on the number of degrees-of-freedom and parallel threads. The benchmark shows that the GPOS present better performance in real-fast runs but worse in real-time due to nonexplicit task switches and to the latency associated with interprocess communication (IPC and task switch.
Directory of Open Access Journals (Sweden)
Matthew Lyndon Armstrong
2015-12-01
Full Text Available This study explored how the Planning Alternatives Tomorrows with Hope (PATH process could enhance and strengthen an individual’s personal journey of recovery. This article utilised the knowledge base of members of a Community of Practice, located in Brisbane Australia. Members had a deep concern and passion to promote and strengthen wellbeing for people who live with the experience of mental ill health. They were invited to form a focus group to explore the use of PATH and its relationship with mental health wellness. After contemplating and reflecting on an example of the PATH process, the focus group explored opportunities for PATH to become one of many wellness resources for people experiencing and overcoming mental ill health. Through the exploration of personal meaning, storytelling and community connection (anchored in the visuals and graphics of the PATH example, the study found that PATH can make a valuable contribution by restoring some of the power inbalances in traditonal service frameworks and enhancing personal self direction. Keywords: mental health distress, practitioners, recovery, facilitation, creativity, planning
Chen, Liang; Zhao, Qile; Hu, Zhigang; Jiang, Xinyuan; Geng, Changjiang; Ge, Maorong; Shi, Chuang
2018-01-01
Lots of ambiguities in un-differenced (UD) model lead to lower calculation efficiency, which isn't appropriate for the high-frequency real-time GNSS clock estimation, like 1 Hz. Mixed differenced model fusing UD pseudo-range and epoch-differenced (ED) phase observations has been introduced into real-time clock estimation. In this contribution, we extend the mixed differenced model for realizing multi-GNSS real-time clock high-frequency updating and a rigorous comparison and analysis on same conditions are performed to achieve the best real-time clock estimation performance taking the efficiency, accuracy, consistency and reliability into consideration. Based on the multi-GNSS real-time data streams provided by multi-GNSS Experiment (MGEX) and Wuhan University, GPS + BeiDou + Galileo global real-time augmentation positioning prototype system is designed and constructed, including real-time precise orbit determination, real-time precise clock estimation, real-time Precise Point Positioning (RT-PPP) and real-time Standard Point Positioning (RT-SPP). The statistical analysis of the 6 h-predicted real-time orbits shows that the root mean square (RMS) in radial direction is about 1-5 cm for GPS, Beidou MEO and Galileo satellites and about 10 cm for Beidou GEO and IGSO satellites. Using the mixed differenced estimation model, the prototype system can realize high-efficient real-time satellite absolute clock estimation with no constant clock-bias and can be used for high-frequency augmentation message updating (such as 1 Hz). The real-time augmentation message signal-in-space ranging error (SISRE), a comprehensive accuracy of orbit and clock and effecting the users' actual positioning performance, is introduced to evaluate and analyze the performance of GPS + BeiDou + Galileo global real-time augmentation positioning system. The statistical analysis of real-time augmentation message SISRE is about 4-7 cm for GPS, whlile 10 cm for Beidou IGSO/MEO, Galileo and about 30 cm
Closed-time path formalism of quantum scattering
International Nuclear Information System (INIS)
Manoukian, E.B.
1988-01-01
The closed-time path formalism of quantum mechanics, first introduced by Schwinger, is developed starting from a second-quantized formalism by using a functional calculus. An exact functional expression for the closed-time amplitude for a particle state (not just of the vacuum state)is derived from which time-dependent expectation value of observables may be written in closed functional form. In particular, this leads directly to the expression for transition probabilities for scattering theory without computing first the corresponding amplitudes. Finally it is made a comparison with the standard approach
Using a virtual world for robot planning
Benjamin, D. Paul; Monaco, John V.; Lin, Yixia; Funk, Christopher; Lyons, Damian
2012-06-01
We are building a robot cognitive architecture that constructs a real-time virtual copy of itself and its environment, including people, and uses the model to process perceptual information and to plan its movements. This paper describes the structure of this architecture. The software components of this architecture include PhysX for the virtual world, OpenCV and the Point Cloud Library for visual processing, and the Soar cognitive architecture that controls the perceptual processing and task planning. The RS (Robot Schemas) language is implemented in Soar, providing the ability to reason about concurrency and time. This Soar/RS component controls visual processing, deciding which objects and dynamics to render into PhysX, and the degree of detail required for the task. As the robot runs, its virtual model diverges from physical reality, and errors grow. The Match-Mediated Difference component monitors these errors by comparing the visual data with corresponding data from virtual cameras, and notifies Soar/RS of significant differences, e.g. a new object that appears, or an object that changes direction unexpectedly. Soar/RS can then run PhysX much faster than real-time and search among possible future world paths to plan the robot's actions. We report experimental results in indoor environments.
Scalable Real-Time Negotiation Toolkit
National Research Council Canada - National Science Library
Lesser, Victor
2004-01-01
... to implement an adaptive distributed sensor network. These activities involved the development of a distributed soft, real-time heuristic resource allocation protocol, the development of a domain-independent soft, real time agent architecture...
Real-Time Wireless Data Acquisition System
Valencia, Emilio J.; Perotti, Jose; Lucena, Angel; Mata, Carlos
2007-01-01
Current and future aerospace requirements demand the creation of a new breed of sensing devices, with emphasis on reduced weight, power consumption, and physical size. This new generation of sensors must possess a high degree of intelligence to provide critical data efficiently and in real-time. Intelligence will include self-calibration, self-health assessment, and pre-processing of raw data at the sensor level. Most of these features are already incorporated in the Wireless Sensors Network (SensorNet(TradeMark)), developed by the Instrumentation Group at Kennedy Space Center (KSC). A system based on the SensorNet(TradeMark) architecture consists of data collection point(s) called Central Stations (CS) and intelligent sensors called Remote Stations (RS) where one or more CSs can be accommodated depending on the specific application. The CS's major function is to establish communications with the Remote Stations and to poll each RS for data and health information. The CS also collects, stores and distributes these data to the appropriate systems requiring the information. The system has the ability to perform point-to-point, multi-point and relay mode communications with an autonomous self-diagnosis of each communications link. Upon detection of a communication failure, the system automatically reconfigures to establish new communication paths. These communication paths are automatically and autonomously selected as the best paths by the system based on the existing operating environment. The data acquisition system currently under development at KSC consists of the SensorNet(TradeMark) wireless sensors as the remote stations and the central station called the Radio Frequency Health Node (RFHN). The RFF1N is the central station which remotely communicates with the SensorNet(TradeMark) sensors to control them and to receive data. The system's salient feature is the ability to provide deterministic sensor data with accurate time stamps for both time critical and non-time
Real-Time Traffic Information for Emergency Evacuation Operations: Phase A Final Report
Energy Technology Data Exchange (ETDEWEB)
Franzese, Oscar [ORNL; Zhang, Li [Mississippi State University (MSU); Mahmoud, Anas M. [Mississippi State University (MSU); Lascurain, Mary Beth [ORNL; Wen, Yi [Mississippi State University (MSU)
2010-05-01
There are many instances in which it is possible to plan ahead for an emergency evacuation (e.g., an explosion at a chemical processing facility). For those cases, if an accident (or an attack) were to happen, then the best evacuation plan for the prevailing network and weather conditions would be deployed. In other cases (e.g., the derailment of a train transporting hazardous materials), there may not be any previously developed plan to be implemented and decisions must be made ad-hoc on how to proceed with an emergency evacuation. In both situations, the availability of real-time traffic information plays a critical role in the management of the evacuation operations. To improve public safety during a vehicular emergency evacuation it is necessary to detect losses of road capacity (due to incidents, for example) as early as possible. Once these bottlenecks are identified, re-routing strategies must be determined in real-time and deployed in the field to help dissipate the congestion and increase the efficiency of the evacuation. Due to cost constraints, only large urban areas have traffic sensor deployments that permit access to some sort of real-time traffic information; any evacuation taking place in any other areas of the country would have to proceed without real-time traffic information. The latter was the focus of this SERRI/DHS (Southeast Region Research Initiative/Department of Homeland Security) sponsored project. That is, the main objective on the project was to improve the operations during a vehicular emergency evacuation anywhere by using newly developed real-time traffic-information-gathering technologies to assess traffic conditions and therefore to potentially detect incidents on the main evacuation routes. Phase A of the project consisted in the development and testing of a prototype system composed of sensors that are engineered in such a way that they can be rapidly deployed in the field where and when they are needed. Each one of these sensors
Model Checking Real-Time Systems
DEFF Research Database (Denmark)
Bouyer, Patricia; Fahrenberg, Uli; Larsen, Kim Guldstrand
2018-01-01
This chapter surveys timed automata as a formalism for model checking real-time systems. We begin with introducing the model, as an extension of finite-state automata with real-valued variables for measuring time. We then present the main model-checking results in this framework, and give a hint...
Modular specification of real-time systems
DEFF Research Database (Denmark)
Inal, Recep
1994-01-01
Duration Calculus, a real-time interval logic, has been embedded in the Z specification language to provide a notation for real-time systems that combines the modularisation and abstraction facilities of Z with a logic suitable for reasoning about real-time properties. In this article the notation...
Hard Real-Time Networking on Firewire
Zhang, Yuchen; Orlic, Bojan; Visser, Peter; Broenink, Jan
2005-01-01
This paper investigates the possibility of using standard, low-cost, widely used FireWire as a new generation fieldbus medium for real-time distributed control applications. A real-time software subsys- tem, RT-FireWire was designed that can, in combination with Linux-based real-time operating
Integrating and Visualizing Tropical Cyclone Data Using the Real Time Mission Monitor
Goodman, H. Michael; Blakeslee, Richard; Conover, Helen; Hall, John; He, Yubin; Regner, Kathryn
2009-01-01
The Real Time Mission Monitor (RTMM) is a visualization and information system that fuses multiple Earth science data sources, to enable real time decision-making for airborne and ground validation experiments. Developed at the NASA Marshall Space Flight Center, RTMM is a situational awareness, decision-support system that integrates satellite imagery, radar, surface and airborne instrument data sets, model output parameters, lightning location observations, aircraft navigation data, soundings, and other applicable Earth science data sets. The integration and delivery of this information is made possible using data acquisition systems, network communication links, network server resources, and visualizations through the Google Earth virtual globe application. RTMM is extremely valuable for optimizing individual Earth science airborne field experiments. Flight planners, scientists, and managers appreciate the contributions that RTMM makes to their flight projects. A broad spectrum of interdisciplinary scientists used RTMM during field campaigns including the hurricane-focused 2006 NASA African Monsoon Multidisciplinary Analyses (NAMMA), 2007 NOAA-NASA Aerosonde Hurricane Noel flight, 2007 Tropical Composition, Cloud, and Climate Coupling (TC4), plus a soil moisture (SMAP-VEX) and two arctic research experiments (ARCTAS) in 2008. Improving and evolving RTMM is a continuous process. RTMM recently integrated the Waypoint Planning Tool, a Java-based application that enables aircraft mission scientists to easily develop a pre-mission flight plan through an interactive point-and-click interface. Individual flight legs are automatically calculated "on the fly". The resultant flight plan is then immediately posted to the Google Earth-based RTMM for interested scientists to view the planned flight track and subsequently compare it to the actual real time flight progress. We are planning additional capabilities to RTMM including collaborations with the Jet Propulsion
International Nuclear Information System (INIS)
Testa, D.; Carfantan, H.; Fasoli, A.; Goodyear, A.; King, Q.; Blanchard, P.; Klein, A.; Lavanchy, P.; Panis, T.
2011-01-01
We present the real-time VME system used to detect and track MHD instabilities, and particularly Alfven Eigenmodes, on the JET tokamak [J. Wesson, Tokamaks, 3rd ed., Oxford Science Publication, Oxford, 2003, p. 617]. This system runs on a 1 kHz clock cycle, and allows performing a real-time, unsupervised and blind detection, decomposition and tracking of the individual components in a frequency-degenerate, multi-harmonic spectrum, using a small number of input data which are unevenly sampled in the spatial domain. This makes it possible to follow in real-time the detected modes as the plasma background evolves, and measure in real-time their frequency, damping rate, toroidal mode-number and relative amplitude. The successful implementation of this system opens a clear path towards developing real-time control tools for electro-magnetic instabilities in future fusion devices aimed at achieving a net energy gain, such as ITER [J. Wesson, Tokamaks, 3rd ed., Oxford Science Publication, Oxford, 2003, p. 711].
Multiprocessor scheduling for real-time systems
Baruah, Sanjoy; Buttazzo, Giorgio
2015-01-01
This book provides a comprehensive overview of both theoretical and pragmatic aspects of resource-allocation and scheduling in multiprocessor and multicore hard-real-time systems. The authors derive new, abstract models of real-time tasks that capture accurately the salient features of real application systems that are to be implemented on multiprocessor platforms, and identify rules for mapping application systems onto the most appropriate models. New run-time multiprocessor scheduling algorithms are presented, which are demonstrably better than those currently used, both in terms of run-time efficiency and tractability of off-line analysis. Readers will benefit from a new design and analysis framework for multiprocessor real-time systems, which will translate into a significantly enhanced ability to provide formally verified, safety-critical real-time systems at a significantly lower cost.
Energy Technology Data Exchange (ETDEWEB)
Poulin, Eric; Beaulieu, Luc, E-mail: Luc.Beaulieu@phy.ulaval.ca [Département de Physique, de Génie Physique et d’optique et Centre de Recherche sur le Cancer de l’Université Laval, Université Laval, Québec, Québec G1V 0A6, Canada and Département de Radio-oncologie et Axe Oncologie du Centre de Recherche du CHU de Québec, CHU de Québec, 11 Côte du Palais, Québec, Québec G1R 2J6 (Canada); Gardi, Lori; Barker, Kevin; Montreuil, Jacques; Fenster, Aaron [Imaging Research Laboratories, Robarts Research Institute, 100 Perth Drive, London, Ontario N6A 5K8 (Canada)
2015-12-15
Purpose: In current clinical practice, there is no integrated 3D ultrasound (3DUS) guidance system clinically available for breast brachytherapy. In this study, the authors present a novel robot-assisted 3DUS system for real-time planning and guidance of breast interstitial high dose rate (HDR) brachytherapy treatment. Methods: For this work, a new computer controlled robotic 3DUS system was built to perform a hybrid motion scan, which is a combination of a 6 cm linear translation with a 30° rotation at both ends. The new 3DUS scanner was designed to fit on a modified Kuske assembly, keeping the current template grid configuration but modifying the frame to allow the mounting of the 3DUS system at several positions. A finer grid was also tested. A user interface was developed to perform image reconstruction, semiautomatic segmentation of the surgical bed as well as catheter reconstruction and tracking. A 3D string phantom was used to validate the geometric accuracy of the reconstruction. The volumetric accuracy of the system was validated with phantoms using magnetic resonance imaging (MRI) and computed tomography (CT) images. In order to accurately determine whether 3DUS can effectively replace CT for treatment planning, the authors have compared the 3DUS catheter reconstruction to the one obtained from CT images. In addition, in agarose-based phantoms, an end-to-end procedure was performed by executing six independent complete procedures with both 14 and 16 catheters, and for both standard and finer Kuske grids. Finally, in phantoms, five end-to-end procedures were performed with the final CT planning for the validation of 3DUS preplanning. Results: The 3DUS acquisition time is approximately 10 s. A paired Student t-test showed that there was no statistical significant difference between known and measured values of string separations in each direction. Both MRI and CT volume measurements were not statistically different from 3DUS volume (Student t-test: p > 0
Rigorous time slicing approach to Feynman path integrals
Fujiwara, Daisuke
2017-01-01
This book proves that Feynman's original definition of the path integral actually converges to the fundamental solution of the Schrödinger equation at least in the short term if the potential is differentiable sufficiently many times and its derivatives of order equal to or higher than two are bounded. The semi-classical asymptotic formula up to the second term of the fundamental solution is also proved by a method different from that of Birkhoff. A bound of the remainder term is also proved. The Feynman path integral is a method of quantization using the Lagrangian function, whereas Schrödinger's quantization uses the Hamiltonian function. These two methods are believed to be equivalent. But equivalence is not fully proved mathematically, because, compared with Schrödinger's method, there is still much to be done concerning rigorous mathematical treatment of Feynman's method. Feynman himself defined a path integral as the limit of a sequence of integrals over finite-dimensional spaces which is obtained by...
Directory of Open Access Journals (Sweden)
Jiang Zhao
2016-01-01
Full Text Available This paper presents an improved ant colony algorithm for the path planning of the omnidirectional mobile vehicle. The purpose of the improved ant colony algorithm is to design an appropriate route to connect the starting point and ending point of the environment with obstacles. Ant colony algorithm, which is used to solve the path planning problem, is improved according to the characteristics of the omnidirectional mobile vehicle. And in the improved algorithm, the nonuniform distribution of the initial pheromone and the selection strategy with direction play a very positive role in the path search. The coverage and updating strategy of pheromone is introduced to avoid repeated search reducing the effect of the number of ants on the performance of the algorithm. In addition, the pheromone evaporation coefficient is segmented and adjusted, which can effectively balance the convergence speed and search ability. Finally, this paper provides a theoretical basis for the improved ant colony algorithm by strict mathematical derivation, and some numerical simulations are also given to illustrate the effectiveness of the theoretical results.
Energy Technology Data Exchange (ETDEWEB)
Cutler, M.; Pineda, G. [Halliburton Energy Services, Bakersfield, CA (United States)
2002-06-01
A horizontal well can be geologically steered using a forward modelling geosteering software that helps determine the stratigraphic position of the drillstring and interpret the well in the reservoir. The software shows reservoir engineers how to maximize the pay zone, optimize the well path, characterize reservoir properties and avoid entering undesired beds or fluid contacts. The best way to maximize the pay zone is to use an integrated arrangement of formation evaluation tools, software and reservoir engineering expertise. This paper presents a series of measurements while drilling and logging. Drilling (MWD/LWD) tools obtain real-time data and forward modelling while drilling software. When interpreted by a trained specialist, these tools help in decision making processes regarding reservoir depletion. The paper presents a case study from offshore eastern Canada in which a well was drilled horizontally from a semi-submersible mobile drilling unit. StrataSteer {sup TM}, a software tool developed by Halliburton Energy Services, was used to interpret the LWD data. The software is compatible with other downhole tools and the INSITE information system which provides real-time data. The objective of the study is to demonstrate the capabilities of the forward modelling tool while drilling the well. A computer was set up at the client's office and at the offshore rig site. The geological model which was constructed using the acquired data was then used to make real-time collaborative decisions to land the well correctly in the reservoir, maximize the productive interval, optimize the well path, and analyze the reservoir properties. However, it was noted that due to geological uncertainty, the objectives in this well were not achieved. 6 figs.
Underwater Time Service and Synchronization Based on Time Reversal Technique
Lu, Hao; Wang, Hai-bin; Aissa-El-Bey, Abdeldjalil; Pyndiah, Ramesh
2010-09-01
Real time service and synchronization are very important to many underwater systems. But the time service and synchronization in existence cannot work well due to the multi-path propagation and random phase fluctuation of signals in the ocean channel. The time reversal mirror technique can realize energy concentration through self-matching of the ocean channel and has very good spatial and temporal focusing properties. Based on the TRM technique, we present the Time Reversal Mirror Real Time service and synchronization (TRMRT) method which can bypass the processing of multi-path on the server side and reduce multi-path contamination on the client side. So TRMRT can improve the accuracy of time service. Furthermore, as an efficient and precise method of time service, TRMRT could be widely used in underwater exploration activities and underwater navigation and positioning systems.
Clynch, Gary
1994-01-01
The traditional software development paradigm, the waterfall life cycle model, is defective when used for developing real-time systems. This thesis puts forward an executable prototyping approach for the development of real-time systems. A prototyping system is proposed which uses ESML (Extended Systems Modelling Language) as a prototype specification language. The prototyping system advocates the translation of non-executable ESML specifications into executable LOOPN (Language of Object ...
Software Design Methods for Real-Time Systems
1989-12-01
This module describes the concepts and methods used in the software design of real time systems . It outlines the characteristics of real time systems , describes...the role of software design in real time system development, surveys and compares some software design methods for real - time systems , and
Real-time Pricing in Power Markets
DEFF Research Database (Denmark)
Boom, Anette; Schwenen, Sebastian
We examine welfare e ects of real-time pricing in electricity markets. Before stochastic energy demand is known, competitive retailers contract with nal consumers who exogenously do not have real-time meters. After demand is realized, two electricity generators compete in a uniform price auction...... to satisfy demand from retailers acting on behalf of subscribed customers and from consumers with real-time meters. Increasing the number of consumers on real-time pricing does not always increase welfare since risk-averse consumers dislike uncertain and high prices arising through market power...
Real-time Pricing in Power Markets
DEFF Research Database (Denmark)
Boom, Anette; Schwenen, Sebastian
We examine welfare eects of real-time pricing in electricity markets. Before stochastic energy demand is known, competitive retailers contract with nal consumers who exogenously do not have real-time meters. After demand is realized, two electricity generators compete in a uniform price auction...... to satisfy demand from retailers acting on behalf of subscribed customers and from consumers with real-time meters. Increasing the number of consumers on real-time pricing does not always increase welfare since risk-averse consumers dislike uncertain and high prices arising through market power...
Distributed, Embedded and Real-time Java Systems
Wellings, Andy
2012-01-01
Research on real-time Java technology has been prolific over the past decade, leading to a large number of corresponding hardware and software solutions, and frameworks for distributed and embedded real-time Java systems. This book is aimed primarily at researchers in real-time embedded systems, particularly those who wish to understand the current state of the art in using Java in this domain. Much of the work in real-time distributed, embedded and real-time Java has focused on the Real-time Specification for Java (RTSJ) as the underlying base technology, and consequently many of the Chapters in this book address issues with, or solve problems using, this framework. Describes innovative techniques in: scheduling, memory management, quality of service and communication systems supporting real-time Java applications; Includes coverage of multiprocessor embedded systems and parallel programming; Discusses state-of-the-art resource management for embedded systems, including Java’s real-time garbage collect...
Research of real-time communication software
Li, Maotang; Guo, Jingbo; Liu, Yuzhong; Li, Jiahong
2003-11-01
Real-time communication has been playing an increasingly important role in our work, life and ocean monitor. With the rapid progress of computer and communication technique as well as the miniaturization of communication system, it is needed to develop the adaptable and reliable real-time communication software in the ocean monitor system. This paper involves the real-time communication software research based on the point-to-point satellite intercommunication system. The object-oriented design method is adopted, which can transmit and receive video data and audio data as well as engineering data by satellite channel. In the real-time communication software, some software modules are developed, which can realize the point-to-point satellite intercommunication in the ocean monitor system. There are three advantages for the real-time communication software. One is that the real-time communication software increases the reliability of the point-to-point satellite intercommunication system working. Second is that some optional parameters are intercalated, which greatly increases the flexibility of the system working. Third is that some hardware is substituted by the real-time communication software, which not only decrease the expense of the system and promotes the miniaturization of communication system, but also aggrandizes the agility of the system.
Kenneth J. Ruzicka; Deanna H. Olson; Klaus J. Puettmann
2013-01-01
Initiated simultaneously, the Density Management and Riparian Buff er Study of western Oregon and the Northwest Forest Plan have had intertwining paths related to federal forest management and policy changes in the Pacifi c Northwest over the last 15 to 20 years. We briefl y discuss the development of the Northwest Forest Plan and how it changed the way forest policy...
PRELIMINARY PROJECT PLAN FOR LANSCE INTEGRATED FLIGHT PATHS 11A, 11B, 12, and 13
International Nuclear Information System (INIS)
Bultman, D. H.; Weinacht, D.
2000-01-01
This Preliminary Project Plan Summarizes the Technical, Cost, and Schedule baselines for an integrated approach to developing several flight paths at the Manual Lujan Jr. Neutron Scattering Center at the Los Alamos Neutron Science Center. For example, the cost estimate is intended to serve only as a rough order of magnitude assessment of the cost that might be incurred as the flight paths are developed. Further refinement of the requirements and interfaces for each beamline will permit additional refinement and confidence in the accuracy of all three baselines (Technical, Cost, Schedule)
International Nuclear Information System (INIS)
Edwards, R.M.; Lee, K.Y.; Kumara, S.; Levine, S.H.
1989-01-01
An approach for an integrated real-time diagnostic system is being developed for inclusion as an integral part of a power plant automatic control system. In order to participate in control decisions and automatic closed loop operation, the diagnostic system must operate in real-time. Thus far, an expert system with real-time capabilities has been developed and installed on a subsystem at the Experimental Breeder Reactor (EBR-II) in Idaho, USA. Real-time simulation testing of advanced power plant concepts at the Pennsylvania State University has been developed and was used to support the expert system development and installation at EBR-II. Recently, the US National Science Foundation (NSF) and the US Department of Energy (DOE) have funded a Penn State research program to further enhance application of real-time diagnostic systems by pursuing implementation in a distributed power plant computer system including microprocessor based controllers. This paper summarizes past, current, planned, and possible future approaches to power plant diagnostic systems research at Penn State. 34 refs., 9 figs
Cendagorta, Joseph R.; Bačić, Zlatko; Tuckerman, Mark E.
2018-03-01
We introduce a scheme for approximating quantum time correlation functions numerically within the Feynman path integral formulation. Starting with the symmetrized version of the correlation function expressed as a discretized path integral, we introduce a change of integration variables often used in the derivation of trajectory-based semiclassical methods. In particular, we transform to sum and difference variables between forward and backward complex-time propagation paths. Once the transformation is performed, the potential energy is expanded in powers of the difference variables, which allows us to perform the integrals over these variables analytically. The manner in which this procedure is carried out results in an open-chain path integral (in the remaining sum variables) with a modified potential that is evaluated using imaginary-time path-integral sampling rather than requiring the generation of a large ensemble of trajectories. Consequently, any number of path integral sampling schemes can be employed to compute the remaining path integral, including Monte Carlo, path-integral molecular dynamics, or enhanced path-integral molecular dynamics. We believe that this approach constitutes a different perspective in semiclassical-type approximations to quantum time correlation functions. Importantly, we argue that our approximation can be systematically improved within a cumulant expansion formalism. We test this approximation on a set of one-dimensional problems that are commonly used to benchmark approximate quantum dynamical schemes. We show that the method is at least as accurate as the popular ring-polymer molecular dynamics technique and linearized semiclassical initial value representation for correlation functions of linear operators in most of these examples and improves the accuracy of correlation functions of nonlinear operators.
Cendagorta, Joseph R; Bačić, Zlatko; Tuckerman, Mark E
2018-03-14
We introduce a scheme for approximating quantum time correlation functions numerically within the Feynman path integral formulation. Starting with the symmetrized version of the correlation function expressed as a discretized path integral, we introduce a change of integration variables often used in the derivation of trajectory-based semiclassical methods. In particular, we transform to sum and difference variables between forward and backward complex-time propagation paths. Once the transformation is performed, the potential energy is expanded in powers of the difference variables, which allows us to perform the integrals over these variables analytically. The manner in which this procedure is carried out results in an open-chain path integral (in the remaining sum variables) with a modified potential that is evaluated using imaginary-time path-integral sampling rather than requiring the generation of a large ensemble of trajectories. Consequently, any number of path integral sampling schemes can be employed to compute the remaining path integral, including Monte Carlo, path-integral molecular dynamics, or enhanced path-integral molecular dynamics. We believe that this approach constitutes a different perspective in semiclassical-type approximations to quantum time correlation functions. Importantly, we argue that our approximation can be systematically improved within a cumulant expansion formalism. We test this approximation on a set of one-dimensional problems that are commonly used to benchmark approximate quantum dynamical schemes. We show that the method is at least as accurate as the popular ring-polymer molecular dynamics technique and linearized semiclassical initial value representation for correlation functions of linear operators in most of these examples and improves the accuracy of correlation functions of nonlinear operators.
DEFF Research Database (Denmark)
Hameed, Ibrahim; la Cour-Harbo, Anders; Osen, O. L.
2016-01-01
Automated path planning is important for the automation and optimization of field operations. It can provide the waypoints required for guidance, navigation and control of agricultural robots and autonomous tractors throughout the execution of these field operations. In agriculture, field...... operations are usually repeated in the same field and from year to year as well, therefore, it should be carried out in a manner that minimizes environmental impact and cost taking into account the topographic land features. Current 3D terrain field coverage path planning algorithms are simply 2D coverage...
Integration of MDSplus in real-time systems
International Nuclear Information System (INIS)
Luchetta, A.; Manduchi, G.; Taliercio, C.
2006-01-01
RFX-mod makes extensive usage of real-time systems for feedback control and uses MDSplus to interface them to the main Data Acquisition system. For this purpose, the core of MDSplus has been ported to VxWorks, the operating system used for real-time control in RFX. Using this approach, it is possible to integrate real-time systems, but MDSplus is used only for non-real-time tasks, i.e. those tasks which are executed before and after the pulse and whose performance does not affect the system time constraints. More extensive use of MDSplus in real-time systems is foreseen, and a real-time layer for MDSplus is under development, which will provide access to memory-mapped pulse files, shared by the tasks running on the same CPU. Real-time communication will also be integrated in the MDSplus core to provide support for distributed memory-mapped pulse files
General new time formalism in the path integral
International Nuclear Information System (INIS)
Pak, N.K.; Sokmen, I.
1983-08-01
We describe a general method of applying point canonical transformations to the path integral followed by the corresponding new time transformations aimed at reducing an arbitrary one-dimensional problem into an exactly solvable form. Our result is independent of operator ordering ambiguities by construction. (author)
Real time thermal hydraulic model for high temperature gas-cooled reactor core
International Nuclear Information System (INIS)
Sui Zhe; Sun Jun; Ma Yuanle; Zhang Ruipeng
2013-01-01
A real-time thermal hydraulic model of the reactor core was described and integrated into the simulation system for the high temperature gas-cooled pebble bed reactor nuclear power plant, which was developed in the vPower platform, a new simulation environment for nuclear and fossil power plants. In the thermal hydraulic model, the helium flow paths were established by the flow network tools in order to obtain the flow rates and pressure distributions. Meanwhile, the heat structures, representing all the solid heat transfer elements in the pebble bed, graphite reflectors and carbon bricks, were connected by the heat transfer network in order to solve the temperature distributions in the reactor core. The flow network and heat transfer network were coupled and calculated in real time. Two steady states (100% and 50% full power) and two transients (inlet temperature step and flow step) were tested that the quantitative comparisons of the steady results with design data and qualitative analysis of the transients showed the good applicability of the present thermal hydraulic model. (authors)
Dense time discretization technique for verification of real time systems
International Nuclear Information System (INIS)
Makackas, Dalius; Miseviciene, Regina
2016-01-01
Verifying the real-time system there are two different models to control the time: discrete and dense time based models. This paper argues a novel verification technique, which calculates discrete time intervals from dense time in order to create all the system states that can be reached from the initial system state. The technique is designed for real-time systems specified by a piece-linear aggregate approach. Key words: real-time system, dense time, verification, model checking, piece-linear aggregate
Directory of Open Access Journals (Sweden)
A. M. Rawani
2002-01-01
Full Text Available This paper presents a path analytic model showing the cause and effect relationships among various Information Systems (IS planning variables for the banking sector in India. In recent years, there has been an increased awareness among banks of the potential of Information Technology (IT and the use of information systems. Strategic information system planning (SISP becomes an important issue in the use of IS strategically. In India, banks have now started realizing the importance of SISP. In this study, 11 IS planning variables for the banking sector in India are examined and the influence of one over the other is investigated using path analysis. Data for the study are collected from 52 banks operating in India. The results of the study indicate that top management involvement in IS planning greatly influences the whole planning exercise. Moreover, top management involvement is higher when they foresee greater future impact of IS. The study also highlights the need and importance of user training in the banking sector. Change in the focus and orientation of user-training will make the users competent to conceive with innovative IS applications.
Storm real-time processing cookbook
Anderson, Quinton
2013-01-01
A Cookbook with plenty of practical recipes for different uses of Storm.If you are a Java developer with basic knowledge of real-time processing and would like to learn Storm to process unbounded streams of data in real time, then this book is for you.
Tsunami Amplitude Estimation from Real-Time GNSS.
Jeffries, C.; MacInnes, B. T.; Melbourne, T. I.
2017-12-01
Tsunami early warning systems currently comprise modeling of observations from the global seismic network, deep-ocean DART buoys, and a global distribution of tide gauges. While these tools work well for tsunamis traveling teleseismic distances, saturation of seismic magnitude estimation in the near field can result in significant underestimation of tsunami excitation for local warning. Moreover, DART buoy and tide gauge observations cannot be used to rectify the underestimation in the available time, typically 10-20 minutes, before local runup occurs. Real-time GNSS measurements of coseismic offsets may be used to estimate finite faulting within 1-2 minutes and, in turn, tsunami excitation for local warning purposes. We describe here a tsunami amplitude estimation algorithm; implemented for the Cascadia subduction zone, that uses continuous GNSS position streams to estimate finite faulting. The system is based on a time-domain convolution of fault slip that uses a pre-computed catalog of hydrodynamic Green's functions generated with the GeoClaw shallow-water wave simulation software and maps seismic slip along each section of the fault to points located off the Cascadia coast in 20m of water depth and relies on the principle of the linearity in tsunami wave propagation. The system draws continuous slip estimates from a message broker, convolves the slip with appropriate Green's functions which are then superimposed to produce wave amplitude at each coastal location. The maximum amplitude and its arrival time are then passed into a database for subsequent monitoring and display. We plan on testing this system using a suite of synthetic earthquakes calculated for Cascadia whose ground motions are simulated at 500 existing Cascadia GPS sites, as well as real earthquakes for which we have continuous GNSS time series and surveyed runup heights, including Maule, Chile 2010 and Tohoku, Japan 2011. This system has been implemented in the CWU Geodesy Lab for the Cascadia
Keall, Paul J; Nguyen, Doan Trang; O'Brien, Ricky; Zhang, Pengpeng; Happersett, Laura; Bertholet, Jenny; Poulsen, Per R
2018-04-14
To review real-time 3-dimensional (3D) image guided radiation therapy (IGRT) on standard-equipped cancer radiation therapy systems, focusing on clinically implemented solutions. Three groups in 3 continents have clinically implemented novel real-time 3D IGRT solutions on standard-equipped linear accelerators. These technologies encompass kilovoltage, combined megavoltage-kilovoltage, and combined kilovoltage-optical imaging. The cancer sites treated span pelvic and abdominal tumors for which respiratory motion is present. For each method the 3D-measured motion during treatment is reported. After treatment, dose reconstruction was used to assess the treatment quality in the presence of motion with and without real-time 3D IGRT. The geometric accuracy was quantified through phantom experiments. A literature search was conducted to identify additional real-time 3D IGRT methods that could be clinically implemented in the near future. The real-time 3D IGRT methods were successfully clinically implemented and have been used to treat more than 200 patients. Systematic target position shifts were observed using all 3 methods. Dose reconstruction demonstrated that the delivered dose is closer to the planned dose with real-time 3D IGRT than without real-time 3D IGRT. In addition, compromised target dose coverage and variable normal tissue doses were found without real-time 3D IGRT. The geometric accuracy results with real-time 3D IGRT had a mean error of real-time 3D IGRT methods using standard-equipped radiation therapy systems that could also be clinically implemented. Multiple clinical implementations of real-time 3D IGRT on standard-equipped cancer radiation therapy systems have been demonstrated. Many more approaches that could be implemented were identified. These solutions provide a pathway for the broader adoption of methods to make radiation therapy more accurate, impacting tumor and normal tissue dose, margins, and ultimately patient outcomes. Copyright © 2018
Mixed - mode Operating System for Real - time Performance
Directory of Open Access Journals (Sweden)
Hasan M. M.
2017-11-01
Full Text Available The purpose of the mixed-mode system research is to handle devices with the accuracy of real-time systems and at the same time, having all the benefits and facilities of a matured Graphic User Interface(GUIoperating system which is typicallynon-real-time. This mixed-mode operating system comprising of a real-time portion and a non-real-time portion was studied and implemented to identify the feasibilities and performances in practical applications (in the context of scheduled the real-time events. In this research an i8751 microcontroller-based hardware was used to measure the performance of the system in real-time-only as well as non-real-time-only configurations. The real-time portion is an 486DX-40 IBM PC system running under DOS-based real-time kernel and the non-real-time portion is a Pentium IIIbased system running under Windows NT. It was found that mixed-mode systems performed as good as a typical real-time system and in fact, gave many additional benefits such as simplified/modular programming and load tolerance.
A real time sorting algorithm to time sort any deterministic time disordered data stream
Saini, J.; Mandal, S.; Chakrabarti, A.; Chattopadhyay, S.
2017-12-01
In new generation high intensity high energy physics experiments, millions of free streaming high rate data sources are to be readout. Free streaming data with associated time-stamp can only be controlled by thresholds as there is no trigger information available for the readout. Therefore, these readouts are prone to collect large amount of noise and unwanted data. For this reason, these experiments can have output data rate of several orders of magnitude higher than the useful signal data rate. It is therefore necessary to perform online processing of the data to extract useful information from the full data set. Without trigger information, pre-processing on the free streaming data can only be done with time based correlation among the data set. Multiple data sources have different path delays and bandwidth utilizations and therefore the unsorted merged data requires significant computational efforts for real time manifestation of sorting before analysis. Present work reports a new high speed scalable data stream sorting algorithm with its architectural design, verified through Field programmable Gate Array (FPGA) based hardware simulation. Realistic time based simulated data likely to be collected in an high energy physics experiment have been used to study the performance of the algorithm. The proposed algorithm uses parallel read-write blocks with added memory management and zero suppression features to make it efficient for high rate data-streams. This algorithm is best suited for online data streams with deterministic time disorder/unsorting on FPGA like hardware.
Quantum cosmology based on discrete Feynman paths
International Nuclear Information System (INIS)
Chew, Geoffrey F.
2002-01-01
Although the rules for interpreting local quantum theory imply discretization of process, Lorentz covariance is usually regarded as precluding time quantization. Nevertheless a time-discretized quantum representation of redshifting spatially-homogeneous universe may be based on discrete-step Feynman paths carrying causal Lorentz-invariant action--paths that not only propagate the wave function but provide a phenomenologically-promising elementary-particle Hilbert-space basis. In a model under development, local path steps are at Planck scale while, at a much larger ''wave-function scale'', global steps separate successive wave-functions. Wave-function spacetime is but a tiny fraction of path spacetime. Electromagnetic and gravitational actions are ''at a distance'' in Wheeler-Feynman sense while strong (color) and weak (isospin) actions, as well as action of particle motion, are ''local'' in a sense paralleling the action of local field theory. ''Nonmaterial'' path segments and ''trivial events'' collaborate to define energy and gravity. Photons coupled to conserved electric charge enjoy privileged model status among elementary fermions and vector bosons. Although real path parameters provide no immediate meaning for ''measurement'', the phase of the complex wave function allows significance for ''information'' accumulated through ''gentle'' electromagnetic events involving charged matter and ''soft'' photons. Through its soft-photon content the wave function is an ''information reservoir''
The time-varying shortest path problem with fuzzy transit costs and speedup
Directory of Open Access Journals (Sweden)
Rezapour Hassan
2016-08-01
Full Text Available In this paper, we focus on the time-varying shortest path problem, where the transit costs are fuzzy numbers. Moreover, we consider this problem in which the transit time can be shortened at a fuzzy speedup cost. Speedup may also be a better decision to find the shortest path from a source vertex to a specified vertex.
International Nuclear Information System (INIS)
Dasgupta, I.
1998-01-01
We discuss new bounce-like (but non-time-reversal-invariant) solutions to Euclidean equations of motion, which we dub boomerons. In the Euclidean path integral approach to quantum theories, boomerons make an imaginary contribution to the vacuum energy. The fake vacuum instability can be removed by cancelling boomeron contributions against contributions from time reversed boomerons (anti-boomerons). The cancellation rests on a sign choice whose significance is not completely understood in the path integral method. (orig.)
Understanding and applying open-path optical sensing data
Virag, Peter; Kricks, Robert J.
1999-02-01
During the last 10 years, open-path air monitors have evolved to yield reliable and effective measurements of single and multiple compounds on a real-time basis. To many individuals within the optical remote sensing community, the attributes of open-path and its the potential uses seem unlimited. Then why has the market has been stagnant for the last few years? The reason may center on how open-path information is applied and how well the end user understands that information. We constantly try to compare open-path data to risk/health or safety levels that are based for use at a single point and for a specific averaging period often far longer than a typical open-path data point. Often this approach is perceived as putting a square peg in a round hole. This perception may be well founded, as open-path data at times may need to go through extensive data manipulation and assumptions before it can be applied. This paper will review pervious open-path monitoring programs and their success in applying the data collected. We will also look at how open-path data is being currently used, some previous pitfalls in data use, alternate methods of data interpretation, and how open-path data can be best practically applied to fit current needs.
Research in Distributed Real-Time Systems
Mukkamala, R.
1997-01-01
This document summarizes the progress we have made on our study of issues concerning the schedulability of real-time systems. Our study has produced several results in the scalability issues of distributed real-time systems. In particular, we have used our techniques to resolve schedulability issues in distributed systems with end-to-end requirements. During the next year (1997-98), we propose to extend the current work to address the modeling and workload characterization issues in distributed real-time systems. In particular, we propose to investigate the effect of different workload models and component models on the design and the subsequent performance of distributed real-time systems.
Real-time data access layer for MDSplus
International Nuclear Information System (INIS)
Manduchi, G.; Luchetta, A.; Taliercio, C.; Fredian, T.; Stillerman, J.
2008-01-01
Recent extensions to MDSplus allow data handling in long discharges and provide a real-time data access and communication layer. The real-time data access layer is an additional component of MDSplus: it is possible to use the traditional MDSplus API during normal operation, and to select a subset of data items to be used in real time. Real-time notification is provided by a communication layer using a publish-subscribe pattern. The notification covers processes sharing the same data items even running on different machines, thus allowing the implementation of distributed control systems. The real-time data access layer has been developed for Windows, Linux, and VxWorks; it is currently being ported to Linux RTAI. In order to quantify the fingerprint of the presented system, the performance of the real-time access layer approach is compared with that of an ad hoc, manually optimized program in a sample real-time application
A Real-Time Systems Symposium Preprint.
1983-09-01
Real - Time Systems Symposium Preprint Interim Tech...estimate of the occurence of the error. Unclassii ledSECUqITY CLASSIF’ICA T" NO MI*IA If’ inDI /’rrd erter for~~ble. ’Corrputnqg A REAL - TIME SYSTEMS SYMPOSIUM...ABSTRACT This technical report contains a preprint of a paper accepted for presentation at the REAL - TIME SYSTEMS SYMPOSIUM, Arlington,
Benefits of real-time gas management
International Nuclear Information System (INIS)
Nolty, R.; Dolezalek, D. Jr.
1994-01-01
In today's competitive gas gathering, processing, storage and transportation business environment, the requirements to do business are continually changing. These changes arise from government regulations such as the amendments to the Clean Air Act concerning the environment and FERC Order 636 concerning business practices. Other changes are due to advances in technology such as electronic flow measurement (EFM) and real-time communications capabilities within the gas industry. Gas gathering, processing, storage and transportation companies must be flexible in adapting to these changes to remain competitive. These dynamic requirements can be met with an open, real-time gas management computer information system. Such a system provides flexible services with a variety of software applications. Allocations, nominations management and gas dispatching are examples of applications that are provided on a real-time basis. By providing real-time services, the gas management system enables operations personnel to make timely adjustments within the current accounting period. Benefits realized from implementing a real-time gas management system include reduced unaccountable gas, reduced imbalance penalties, reduced regulatory violations, improved facility operations and better service to customers. These benefits give a company the competitive edge. This article discusses the applications provided, the benefits from implementing a real-time gas management system, and the definition of such a system
Prinzel, III, Lawrence J. (Inventor); Pope, Alan T. (Inventor); Williams, Steven P. (Inventor); Bailey, Randall E. (Inventor); Arthur, Jarvis J. (Inventor); Kramer, Lynda J. (Inventor); Schutte, Paul C. (Inventor)
2012-01-01
Embodiments of the invention permit flight paths (current and planned) to be viewed from various orientations to provide improved path and terrain awareness via graphical two-dimensional or three-dimensional perspective display formats. By coupling the flight path information with a terrain database, uncompromising terrain awareness relative to the path and ownship is provided. In addition, missed approaches, path deviations, and any navigational path can be reviewed and rehearsed before performing the actual task. By rehearsing a particular mission, check list items can be reviewed, terrain awareness can be highlighted, and missed approach procedures can be discussed by the flight crew. Further, the use of Controller Pilot Datalink Communications enables data-linked path, flight plan changes, and Air Traffic Control requests to be integrated into the flight display of the present invention.
Making real-time reactive systems reliable
Marzullo, Keith; Wood, Mark
1990-01-01
A reactive system is characterized by a control program that interacts with an environment (or controlled program). The control program monitors the environment and reacts to significant events by sending commands to the environment. This structure is quite general. Not only are most embedded real time systems reactive systems, but so are monitoring and debugging systems and distributed application management systems. Since reactive systems are usually long running and may control physical equipment, fault tolerance is vital. The research tries to understand the principal issues of fault tolerance in real time reactive systems and to build tools that allow a programmer to design reliable, real time reactive systems. In order to make real time reactive systems reliable, several issues must be addressed: (1) How can a control program be built to tolerate failures of sensors and actuators. To achieve this, a methodology was developed for transforming a control program that references physical value into one that tolerates sensors that can fail and can return inaccurate values; (2) How can the real time reactive system be built to tolerate failures of the control program. Towards this goal, whether the techniques presented can be extended to real time reactive systems is investigated; and (3) How can the environment be specified in a way that is useful for writing a control program. Towards this goal, whether a system with real time constraints can be expressed as an equivalent system without such constraints is also investigated.
Real time analysis with the upgraded LHCb trigger in Run III
Szumlak, Tomasz
2017-10-01
The current LHCb trigger system consists of a hardware level, which reduces the LHC bunch-crossing rate of 40 MHz to 1.1 MHz, a rate at which the entire detector is read out. A second level, implemented in a farm of around 20k parallel processing CPUs, the event rate is reduced to around 12.5 kHz. The LHCb experiment plans a major upgrade of the detector and DAQ system in the LHC long shutdown II (2018-2019). In this upgrade, a purely software based trigger system is being developed and it will have to process the full 30 MHz of bunch crossings with inelastic collisions. LHCb will also receive a factor of 5 increase in the instantaneous luminosity, which further contributes to the challenge of reconstructing and selecting events in real time with the CPU farm. We discuss the plans and progress towards achieving efficient reconstruction and selection with a 30 MHz throughput. Another challenge is to exploit the increased signal rate that results from removing the 1.1 MHz readout bottleneck, combined with the higher instantaneous luminosity. Many charm hadron signals can be recorded at up to 50 times higher rate. LHCb is implementing a new paradigm in the form of real time data analysis, in which abundant signals are recorded in a reduced event format that can be fed directly to the physics analyses. These data do not need any further offline event reconstruction, which allows a larger fraction of the grid computing resources to be devoted to Monte Carlo productions. We discuss how this real-time analysis model is absolutely critical to the LHCb upgrade, and how it will evolve during Run-II.
Chang, Wen-Chung; Chen, Chin-Sheng; Tai, Hung-Chi; Liu, Chia-Yuan; Chen, Yu-Jen
2014-01-01
The current practice of radiotherapy examines target coverage solely from digitally reconstructed beam's eye view (BEV) in a way that is indirectly accessible and that is not in real time. We aimed to visualize treatment targets in real time from each BEV. The image data of phantom or patients from ultrasound (US) and computed tomography (CT) scans were captured to perform image registration. We integrated US, CT, US/CT image registration, robotic manipulation of US, a radiation treatment planning system, and a linear accelerator to constitute an innovative target visualization system. The performance of this algorithm segmented the target organ in CT images, transformed and reconstructed US images to match each orientation, and generated image registration in real time mode with acceptable accuracy. This image transformation allowed physicians to visualize the CT image-reconstructed target via a US probe outside the BEV that was non-coplanar to the beam's plane. It allowed the physicians to remotely control the US probe that was equipped on a robotic arm to dynamically trace and real time monitor the coverage of the target within the BEV during a simulated beam-on situation. This target visualization system may provide a direct remotely accessible and real time way to visualize, verify, and ensure tumor targeting during radiotherapy.
Space Weather and Real-Time Monitoring
Directory of Open Access Journals (Sweden)
S Watari
2009-04-01
Full Text Available Recent advance of information and communications technology enables to collect a large amount of ground-based and space-based observation data in real-time. The real-time data realize nowcast of space weather. This paper reports a history of space weather by the International Space Environment Service (ISES in association with the International Geophysical Year (IGY and importance of real-time monitoring in space weather.
Research Directions in Real-Time Systems.
1996-09-01
This report summarizes a survey of published research in real time systems . Material is presented that provides an overview of the topic, focusing on...communications protocols and scheduling techniques. It is noted that real - time systems deserve special attention separate from other areas because of...formal tools for design and analysis of real - time systems . The early work on applications as well as notable theoretical advances are summarized
A new multiple robot path planning algorithm: dynamic distributed particle swarm optimization.
Ayari, Asma; Bouamama, Sadok
2017-01-01
Multiple robot systems have become a major study concern in the field of robotic research. Their control becomes unreliable and even infeasible if the number of robots increases. In this paper, a new dynamic distributed particle swarm optimization (D 2 PSO) algorithm is proposed for trajectory path planning of multiple robots in order to find collision-free optimal path for each robot in the environment. The proposed approach consists in calculating two local optima detectors, LOD pBest and LOD gBest . Particles which are unable to improve their personal best and global best for predefined number of successive iterations would be replaced with restructured ones. Stagnation and local optima problems would be avoided by adding diversity to the population, without losing the fast convergence characteristic of PSO. Experiments with multiple robots are provided and proved effectiveness of such approach compared with the distributed PSO.
Minnis, P.; Smith, W., Jr.; Bedka, K. M.; Nguyen, L.; Palikonda, R.; Hong, G.; Trepte, Q.; Chee, T.; Scarino, B. R.; Spangenberg, D.; Sun-Mack, S.; Fleeger, C.; Ayers, J. K.; Chang, F. L.; Heck, P. W.
2014-12-01
Cloud properties determined from satellite imager radiances provide a valuable source of information for nowcasting and weather forecasting. In recent years, it has been shown that assimilation of cloud top temperature, optical depth, and total water path can increase the accuracies of weather analyses and forecasts. Aircraft icing conditions can be accurately diagnosed in near-real time (NRT) retrievals of cloud effective particle size, phase, and water path, providing valuable data for pilots. NRT retrievals of surface skin temperature can also be assimilated in numerical weather prediction models to provide more accurate representations of solar heating and longwave cooling at the surface, where convective initiation. These and other applications are being exploited more frequently as the value of NRT cloud data become recognized. At NASA Langley, cloud properties and surface skin temperature are being retrieved in near-real time globally from both geostationary (GEO) and low-earth orbiting (LEO) satellite imagers for weather model assimilation and nowcasting for hazards such as aircraft icing. Cloud data from GEO satellites over North America are disseminated through NCEP, while those data and global LEO and GEO retrievals are disseminated from a Langley website. This paper presents an overview of the various available datasets, provides examples of their application, and discusses the use of the various datasets downstream. Future challenges and areas of improvement are also presented.
Minnis, Patrick; Smith, William L., Jr.; Bedka, Kristopher M.; Nguyen, Louis; Palikonda, Rabindra; Hong, Gang; Trepte, Qing Z.; Chee, Thad; Scarino, Benjamin; Spangenberg, Douglas A.;
2014-01-01
Cloud properties determined from satellite imager radiances provide a valuable source of information for nowcasting and weather forecasting. In recent years, it has been shown that assimilation of cloud top temperature, optical depth, and total water path can increase the accuracies of weather analyses and forecasts. Aircraft icing conditions can be accurately diagnosed in near--real time (NRT) retrievals of cloud effective particle size, phase, and water path, providing valuable data for pilots. NRT retrievals of surface skin temperature can also be assimilated in numerical weather prediction models to provide more accurate representations of solar heating and longwave cooling at the surface, where convective initiation. These and other applications are being exploited more frequently as the value of NRT cloud data become recognized. At NASA Langley, cloud properties and surface skin temperature are being retrieved in near--real time globally from both geostationary (GEO) and low--earth orbiting (LEO) satellite imagers for weather model assimilation and nowcasting for hazards such as aircraft icing. Cloud data from GEO satellites over North America are disseminated through NCEP, while those data and global LEO and GEO retrievals are disseminated from a Langley website. This paper presents an overview of the various available datasets, provides examples of their application, and discusses the use of the various datasets downstream. Future challenges and areas of improvement are also presented.
Real time simulation techniques in Taiwan - Maanshan compact simulator
International Nuclear Information System (INIS)
Liang, K.-S.; Chuang, Y.-M.; Ko, H.-T.
2004-01-01
Recognizing the demand and potential market of simulators in various industries, a special project for real time simulation technology transfer was initiated in Taiwan in 1991. In this technology transfer program, the most advanced real-time dynamic modules for nuclear power simulation were introduced. Those modules can be divided into two categories; one is modeling related to catch dynamic response of each system, and the other is computer related to provide special real time computing environment and man-machine interface. The modeling related modules consist of the thermodynamic module, the three-dimensional core neutronics module and the advanced balance of plant module. As planned in the project, the technology transfer team should build a compact simulator for the Maanshan power plant before the end of the project to demonstrate the success of the technology transfer program. The compact simulator was designed to support the training from the regular full scope simulator which was already equipped in the Maanshan plant. The feature of this compact simulator focused on providing know-why training by the enhanced graphic display. The potential users were identified as senior operators, instructors and nuclear engineers. Total about 13 important systems were covered in the scope of the compact simulator, and multi-graphic displays from three color monitors mounted on the 10 feet compact panel were facilitated to help the user visualize detailed phenomena under scenarios of interest. (author)
TRIANA. A control strategy for Smart Grids. Forecasting, planning and real-time control
International Nuclear Information System (INIS)
Bakker, V.
2012-01-01
Increasing demand, extra fluctuation and a large share of distributed electricity generation will put more stress on the electricity supply chain. Therefore, changes are required in the supply chain to maintain a properly functioning, stable and affordable grid. Currently the supply chain is completely driven by demand by constantly adapting the production to the demand. The exploitation of flexibility on the demand side of the supply chain allows for a more efficient and sustainable electricity production. Techniques like controllable distributed generation, distributed storage, and smart appliances can introduce this required flexibility. To exploit the new flexibility, the grid has to become more intelligent, i.e. become a Smart Grid. In this thesis TRIANA, a three step control strategy for the Smart Grid is presented. In the first step of TRIANA, the forecasting step, the scheduling freedom (flexibility) of a device is determined for each individual device by a local controller. In the second step, a (central) planner tries to exploit the freedom of the devices determined in the first step for his objective. The last step of TRIANA is the real-time control step performed by the local controller achieving the planning in the best possible way. In order to analyze the impact of control methodologies for Smart Grid, a simulator based on an energy model has been built. The basic elements of the model are individual devices and between devices energy streams are defined. The energy streams are connected via so called pools, which represent the physical connections between the devices. To study the effectiveness of the control methodology and study the most economic use of the flexibility of devices, multiple scenarios have been simulated. Simulations show that TRIANA can optimize the energy flows and can control the operation of the domestic devices in an economic manner without discomfort for the residents. TRIANA is a methodology capable of adjusting the energy
Chen, Jiajia; Zhao, Pan; Liang, Huawei; Mei, Tao
2014-09-18
The autonomous vehicle is an automated system equipped with features like environment perception, decision-making, motion planning, and control and execution technology. Navigating in an unstructured and complex environment is a huge challenge for autonomous vehicles, due to the irregular shape of road, the requirement of real-time planning, and the nonholonomic constraints of vehicle. This paper presents a motion planning method, based on the Radial Basis Function (RBF) neural network, to guide the autonomous vehicle in unstructured environments. The proposed algorithm extracts the drivable region from the perception grid map based on the global path, which is available in the road network. The sample points are randomly selected in the drivable region, and a gradient descent method is used to train the RBF network. The parameters of the motion-planning algorithm are verified through the simulation and experiment. It is observed that the proposed approach produces a flexible, smooth, and safe path that can fit any road shape. The method is implemented on autonomous vehicle and verified against many outdoor scenes; furthermore, a comparison of proposed method with the existing well-known Rapidly-exploring Random Tree (RRT) method is presented. The experimental results show that the proposed method is highly effective in planning the vehicle path and offers better motion quality.
Kato, Moritoshi; Zhou, Yicheng
This paper presents a novel method to evaluate replacement plan for aged thermal power plants under uncertain circumstances through a real option approach. The most economical plan is selected among the three options: an option to operate an existing oil-fired thermal plant, an option to mothball it, and an option to abandon it and to construct an advanced gas combined cycle power plant (ACC) at the same time. Basic ideas of our model are: we use quadranomial approach in order to evaluate an option value consisted by two different uncertain assets; we consider cash flow with a dividend in order to reflect conditions of an aged oil-fired thermal plant and use the sequential compound option approach; we evaluate replacement time using quadranomial decision tree taking into account the options. We also analyze value and time of replacement using numerical examples. Our proposed method will be practically used for generation planning. For example it is possible to make priority quantitatively in replacements of aged thermal power plants by real option values. The target year of replacement may be set as a year when cumulative probability of replacement becomes over certain level.
Real-Time MENTAT programming language and architecture
Grimshaw, Andrew S.; Silberman, Ami; Liu, Jane W. S.
1989-01-01
Real-time MENTAT, a programming environment designed to simplify the task of programming real-time applications in distributed and parallel environments, is described. It is based on the same data-driven computation model and object-oriented programming paradigm as MENTAT. It provides an easy-to-use mechanism to exploit parallelism, language constructs for the expression and enforcement of timing constraints, and run-time support for scheduling and exciting real-time programs. The real-time MENTAT programming language is an extended C++. The extensions are added to facilitate automatic detection of data flow and generation of data flow graphs, to express the timing constraints of individual granules of computation, and to provide scheduling directives for the runtime system. A high-level view of the real-time MENTAT system architecture and programming language constructs is provided.
Real Time Conference 2016 Overview
Luchetta, Adriano
2017-06-01
This is a special issue of the IEEE Transactions on Nuclear Science containing papers from the invited, oral, and poster presentation of the 20th Real Time Conference (RT2016). The conference was held June 6-10, 2016, at Centro Congressi Padova “A. Luciani,” Padova, Italy, and was organized by Consorzio RFX (CNR, ENEA, INFN, Università di Padova, Acciaierie Venete SpA) and the Istituto Nazionale di Fisica Nucleare. The Real Time Conference is multidisciplinary and focuses on the latest developments in real-time techniques in high-energy physics, nuclear physics, astrophysics and astroparticle physics, nuclear fusion, medical physics, space instrumentation, nuclear power instrumentation, general radiation instrumentation, and real-time security and safety. Taking place every second year, it is sponsored by the Computer Application in Nuclear and Plasma Sciences technical committee of the IEEE Nuclear and Plasma Sciences Society. RT2016 attracted more than 240 registrants, with a large proportion of young researchers and engineers. It had an attendance of 67 students from many countries.
Run-time middleware to support real-time system scenarios
Goossens, K.; Koedam, M.; Sinha, S.; Nelson, A.; Geilen, M.
2015-01-01
Systems on Chip (SOC) are powerful multiprocessor systems capable of running multiple independent applications, often with both real-time and non-real-time requirements. Scenarios exist at two levels: first, combinations of independent applications, and second, different states of a single
Advanced real-time manipulation of video streams
Herling, Jan
2014-01-01
Diminished Reality is a new fascinating technology that removes real-world content from live video streams. This sensational live video manipulation actually removes real objects and generates a coherent video stream in real-time. Viewers cannot detect modified content. Existing approaches are restricted to moving objects and static or almost static cameras and do not allow real-time manipulation of video content. Jan Herling presents a new and innovative approach for real-time object removal with arbitrary camera movements.
Wojcieszynski, Andrzej P; Hill, Patrick M; Rosenberg, Stephen A; Hullett, Craig R; Labby, Zacariah E; Paliwal, Bhudatt; Geurts, Mark W; Bayliss, R Adam; Bayouth, John E; Harari, Paul M; Bassetti, Michael F; Baschnagel, Andrew M
2017-06-01
-quality stereotactic body radiation therapy plans that are clinically acceptable as compared to volumetric-modulated arc therapy-based plans. Real-time magnetic resonance imaging provides the unique capacity to directly observe tumor motion during treatment for purposes of motion management.
Segment Fixed Priority Scheduling for Self Suspending Real Time Tasks
2016-08-11
a compute- intensive system such as a self - driving car that we have recently developed [28]. Such systems run computation-demanding algorithms...Applications. In RTSS, 2012. [12] J. Kim et al. Parallel Scheduling for Cyber-Physical Systems: Analysis and Case Study on a Self - Driving Car . In ICCPS...leveraging GPU can be modeled using a multi-segment self -suspending real-time task model. For example, a planning algorithm for autonomous driving can
Interfacing real-time information with OILMAP
International Nuclear Information System (INIS)
Howlett, E.; Jayko, K.; Spaulding, M.
1993-01-01
OILMAP is a state-of-the-art, microcomputer-based oil spill response system applicable to oil spill contingency planning and real-time response for any location in the world. OILMAP has a graphic user interface and was designed in a modular framework so that different spill models could be incorporated into the system, as well as a suite of sophisticated data management tools, without increasing the complexity of the user interface. The basic OILMAP configuration contains a surface trajectory model intended for rapid, first-order estimates of spill movement. A variety of additional models are available within the OILMAP shell to address issues such as weathering, cleanup activities, and probabilities of oiling. A simplified geographic information system (GIS) allows display and manipulation of point, line, and area data geographically referenced to the spill domain. The GIS can import raster data so that images collected by satellite and aerial photography may be displayed. Several new capabilities have been implemented for OILMAP that allow real-time data to be integrated. These features include linking with the OILTRACKER free-floating buoys via a global positioning system, linking of hydrodynamic data from the Ocean Data and Information Network, the Harvard ocean forecasting system, and SeaSonde radar, and the capability of importing spill observations from any remotely sensed data. A further link between OILMAP's GIS and spill models has been developed which allows model predictions to be corrected to observed oil locations while the model runs. 13 refs., 6 figs
MO-F-CAMPUS-T-05: SQL Database Queries to Determine Treatment Planning Resource Usage
International Nuclear Information System (INIS)
Fox, C; Gladstone, D
2015-01-01
Purpose: A radiation oncology clinic’s treatment capacity is traditionally thought to be limited by the number of machines in the clinic. As the number of fractions per course decrease and the number of adaptive plans increase, the question of how many treatment plans a clinic can plan becomes increasingly important. This work seeks to lay the ground work for assessing treatment planning resource usage. Methods: Care path templates were created using the Aria 11 care path interface. Care path tasks included key steps in the treatment planning process from the completion of CT simulation through the first radiation treatment. SQL Server Management Studio was used to run SQL queries to extract task completion time stamps along with care path template information and diagnosis codes from the Aria database. 6 months of planning cycles were evaluated. Elapsed time was evaluated in terms of work hours within Monday – Friday, 7am to 5pm. Results: For the 195 validated treatment planning cycles, the average time for planning and MD review was 22.8 hours. Of those cases 33 were categorized as urgent. The average planning time for urgent plans was 5 hours. A strong correlation between diagnosis code and range of elapsed planning time was as well as between elapsed time and select diagnosis codes was observed. It was also observed that tasks were more likely to be completed on the date due than the time that they were due. Follow-up confirmed that most users did not look at the due time. Conclusion: Evaluation of elapsed planning time and other tasks suggest that care paths should be adjusted to allow for different contouring and planning times for certain diagnosis codes and urgent cases. Additional clinic training around task due times vs dates or a structuring of care paths around due dates is also needed
MO-F-CAMPUS-T-05: SQL Database Queries to Determine Treatment Planning Resource Usage
Energy Technology Data Exchange (ETDEWEB)
Fox, C; Gladstone, D [Dartmouth Hitchcock-Medical Center, Hanover, NH (United States)
2015-06-15
Purpose: A radiation oncology clinic’s treatment capacity is traditionally thought to be limited by the number of machines in the clinic. As the number of fractions per course decrease and the number of adaptive plans increase, the question of how many treatment plans a clinic can plan becomes increasingly important. This work seeks to lay the ground work for assessing treatment planning resource usage. Methods: Care path templates were created using the Aria 11 care path interface. Care path tasks included key steps in the treatment planning process from the completion of CT simulation through the first radiation treatment. SQL Server Management Studio was used to run SQL queries to extract task completion time stamps along with care path template information and diagnosis codes from the Aria database. 6 months of planning cycles were evaluated. Elapsed time was evaluated in terms of work hours within Monday – Friday, 7am to 5pm. Results: For the 195 validated treatment planning cycles, the average time for planning and MD review was 22.8 hours. Of those cases 33 were categorized as urgent. The average planning time for urgent plans was 5 hours. A strong correlation between diagnosis code and range of elapsed planning time was as well as between elapsed time and select diagnosis codes was observed. It was also observed that tasks were more likely to be completed on the date due than the time that they were due. Follow-up confirmed that most users did not look at the due time. Conclusion: Evaluation of elapsed planning time and other tasks suggest that care paths should be adjusted to allow for different contouring and planning times for certain diagnosis codes and urgent cases. Additional clinic training around task due times vs dates or a structuring of care paths around due dates is also needed.
Kordaß, Bernd; Ruge, Sebastian
2015-01-01
Analysis of temporomandibular joint (TMJ) function using condylar path tracings is a challenge in functionally oriented dentistry. In most cases, reference points on the skin surface over the TMJ region are defined as "arbitrary", "individual" or "kinematic" condylar hinge axis points, which are displayed as "condylar paths" in motion. To what extent these reference points represent the actual condylar paths in each individual patient is ultimately unclear because the geometric relationship of the actual condyle to the selected reference point is usually unknown. Depending on the location of the point on the condyle and the centers of rotation of mandibular movement, these trajectories can vary greatly during combined rotational and sliding movements (eg, opening and closing movements of the mandible); this represents a grid of points located in the vicinity of the TMJ. To record the actual condylar path as the movement trajectory of a given point (eg, the condylar center), technological solutions are needed with which to link the tracing technology with the appropriate imaging technology capable of scanning the condyle, including the points of interest, and displaying them in real dynamic motion. Sicat Function (Sicat, D-Bonn) is such a solution. Sicat Function links cone beam computed tomography (CBCT) scans (made using the Galileos CBCT scanner; Sirona, Bensheim, Germany) with ultrasound-based, three-dimensional (3D) functional jaw movement recordings of the mandible (made using the JMT+ Jaw Motion Tracker; Sicat, Bonn, Germany). Digital images of the dental arches acquired with the intraoral scanner Cerec system (Sirona) can also be superimposed. This results in the generation of a 3D model of the bony mandible, including the TMJ, which reproduces the 3D real dynamic movement of the condyles simultaneously with that of the condylar paths at defined points (with the condylar centers being a particular point of interest). Sicat Function is an integrated, digital
Archtecture of distributed real-time systems
Wing Leung, Cheuk
2013-01-01
CRAFTERS (Constraint and Application Driven Framework for Tailoring Embedded Real-time System) project aims to address the problem of uncertainty and heterogeneity in a distributed system by providing seamless, portable connectivity and middleware. This thesis contributes to the project by investigating the techniques that can be used in a distributed real-time embedded system. The conclusion is that, there is a list of specifications to be meet in order to provide a transparent and real-time...
The real-time price elasticity of electricity
Lijesen, M.G.
2007-01-01
The real-time price elasticity of electricity contains important information on the demand response of consumers to the volatility of peak prices. Despite the importance, empirical estimates of the real-time elasticity are hardly available. This paper provides a quantification of the real-time
Directory of Open Access Journals (Sweden)
Kun-Lin Wu
2016-01-01
Full Text Available In this paper, mobile robot navigation on a 3D terrain with a single obstacle is addressed. The terrain is modelled as a smooth, complete manifold with well-defined tangent planes and the hazardous region is modelled as an enclosing circle with a hazard grade tuned radius representing the obstacle projected onto the terrain to allow efficient path-obstacle intersection checking. To resolve the intersections along the initial geodesic, by resorting to the geodesic ideas from differential geometry on surfaces and manifolds, we present a geodesic-based planning and replanning algorithm as a new method for obstacle avoidance on a 3D terrain without using boundary following on the obstacle surface. The replanning algorithm generates two new paths, each a composition of two geodesics, connected via critical points whose locations are found to be heavily relying on the exploration of the terrain via directional scanning on the tangent plane at the first intersection point of the initial geodesic with the circle. An advantage of this geodesic path replanning procedure is that traversability of terrain on which the detour path traverses could be explored based on the local Gauss-Bonnet Theorem of the geodesic triangle at the planning stage. A simulation demonstrates the practicality of the analytical geodesic replanning procedure for navigating a constant speed point robot on a 3D hill-like terrain.
A Near Real-time Decision Support System Improving Forest Management in the Tropics
Tabor, K.; Musinsky, J.; Ledezma, J.; Rasolohery, A.; Mendoza, E.; Kistler, H.; Steininger, M.; Morton, D. C.; Melton, F. S.; Manwell, J.; Koenig, K.
2013-12-01
Conservation International (CI) has a decade of experience developing near real-time fire and deforestation monitoring and forecasting systems that channel monitoring information from satellite observations directly to national and sub-national government agencies, Non-Government Organizations (NGOs), and local communities. These systems are used to strengthen forest surveillance and monitoring, fire management and prevention, protected areas management and sustainable land use planning. With support from a NASA Wildland Fires grant, in September 2013 CI will launch a brand new near real-time alert system (FIRECAST) to better meet the outstanding needs and challenges users face in addressing ecosystem degradation from wildland fire and illegal forest activities. Outreach efforts and user feedback have indicated the need for seasonal fire forecasts for effective land use planning, faster alert delivery to enhance response to illegal forest activities, and expanded forest monitoring capabilities that enable proactive responses and that strengthen forest conservation and sustainable development actions. The new FIRECAST system addresses these challenges by integrating the current fire alert and deforestation systems and adding improved ecological forecasting of fire risk; expanding data exchange capabilities with mobile technologies; and delivering a deforestation alert product that can inform policies related to land use management and Reduced Emissions from Deforestation and forest Degradation (REDD+). In addition to demonstrating the capabilities of this new real-time alert system, we also highlight how coordination with host-country institutions enhances the system's capacity to address the implementation needs of REDD+ forest carbon projects, improve tropical forest management, strengthen environmental law enforcement, and facilitate the uptake of near real-time satellite monitoring data into business practices of these national/sub-national institutions.
Implementing Run-Time Evaluation of Distributed Timing Constraints in a Real-Time Environment
DEFF Research Database (Denmark)
Kristensen, C. H.; Drejer, N.
1994-01-01
In this paper we describe a solution to the problem of implementing run-time evaluation of timing constraints in distributed real-time environments......In this paper we describe a solution to the problem of implementing run-time evaluation of timing constraints in distributed real-time environments...
Xu, Wenzhao; Collingsworth, Paris D.; Bailey, Barbara; Carlson Mazur, Martha L.; Schaeffer, Jeff; Minsker, Barbara
2017-01-01
This paper proposes a geospatial analysis framework and software to interpret water-quality sampling data from towed undulating vehicles in near-real time. The framework includes data quality assurance and quality control processes, automated kriging interpolation along undulating paths, and local hotspot and cluster analyses. These methods are implemented in an interactive Web application developed using the Shiny package in the R programming environment to support near-real time analysis along with 2- and 3-D visualizations. The approach is demonstrated using historical sampling data from an undulating vehicle deployed at three rivermouth sites in Lake Michigan during 2011. The normalized root-mean-square error (NRMSE) of the interpolation averages approximately 10% in 3-fold cross validation. The results show that the framework can be used to track river plume dynamics and provide insights on mixing, which could be related to wind and seiche events.
REAL TIME SYSTEM OPERATIONS 2006-2007
Energy Technology Data Exchange (ETDEWEB)
Eto, Joseph H.; Parashar, Manu; Lewis, Nancy Jo
2008-08-15
The Real Time System Operations (RTSO) 2006-2007 project focused on two parallel technical tasks: (1) Real-Time Applications of Phasors for Monitoring, Alarming and Control; and (2) Real-Time Voltage Security Assessment (RTVSA) Prototype Tool. The overall goal of the phasor applications project was to accelerate adoption and foster greater use of new, more accurate, time-synchronized phasor measurements by conducting research and prototyping applications on California ISO's phasor platform - Real-Time Dynamics Monitoring System (RTDMS) -- that provide previously unavailable information on the dynamic stability of the grid. Feasibility assessment studies were conducted on potential application of this technology for small-signal stability monitoring, validating/improving existing stability nomograms, conducting frequency response analysis, and obtaining real-time sensitivity information on key metrics to assess grid stress. Based on study findings, prototype applications for real-time visualization and alarming, small-signal stability monitoring, measurement based sensitivity analysis and frequency response assessment were developed, factory- and field-tested at the California ISO and at BPA. The goal of the RTVSA project was to provide California ISO with a prototype voltage security assessment tool that runs in real time within California ISO?s new reliability and congestion management system. CERTS conducted a technical assessment of appropriate algorithms, developed a prototype incorporating state-of-art algorithms (such as the continuation power flow, direct method, boundary orbiting method, and hyperplanes) into a framework most suitable for an operations environment. Based on study findings, a functional specification was prepared, which the California ISO has since used to procure a production-quality tool that is now a part of a suite of advanced computational tools that is used by California ISO for reliability and congestion management.
Application of XML in real-time data warehouse
Zhao, Yanhong; Wang, Beizhan; Liu, Lizhao; Ye, Su
2009-07-01
At present, XML is one of the most widely-used technologies of data-describing and data-exchanging, and the needs for real-time data make real-time data warehouse a popular area in the research of data warehouse. What effects can we have if we apply XML technology to the research of real-time data warehouse? XML technology solves many technologic problems which are impossible to be addressed in traditional real-time data warehouse, and realize the integration of OLAP (On-line Analytical Processing) and OLTP (Online transaction processing) environment. Then real-time data warehouse can truly be called "real time".
Mixed - mode Operating System for Real - time Performance
Hasan M. M.; Sultana S.; Foo C.K.
2017-01-01
The purpose of the mixed-mode system research is to handle devices with the accuracy of real-time systems and at the same time, having all the benefits and facilities of a matured Graphic User Interface(GUI)operating system which is typicallynon-real-time. This mixed-mode operating system comprising of a real-time portion and a non-real-time portion was studied and implemented to identify the feasibilities and performances in practical applications (in the context of scheduled the real-time e...
Comparison of time required for traditional versus virtual orthognathic surgery treatment planning.
Wrzosek, M K; Peacock, Z S; Laviv, A; Goldwaser, B R; Ortiz, R; Resnick, C M; Troulis, M J; Kaban, L B
2016-09-01
Virtual surgical planning (VSP) is a tool for predicting complex surgical movements in three dimensions and it may reduce preoperative laboratory time. A prospective study to compare the time required for standard preoperative planning versus VSP was conducted at Massachusetts General Hospital from January 2014 through January 2015. Workflow data for bimaxillary cases planned by both standard techniques and VSP were recorded in real time. Time spent was divided into three parts: (1) obtaining impressions, face-bow mounting, and model preparation; (2) occlusal analysis and modification, model surgery, and splint fabrication; (3) online VSP session. Average times were compared between standard treatment planning (sum of parts 1 and 2) and VSP (sum of parts 1 and 3). Of 41 bimaxillary cases included, 20 were simple (symmetric) and 21 were complex (asymmetry and segmental osteotomies). Average times for parts 1, 2, and 3 were 4.43, 3.01, and 0.67h, respectively. The average time required for standard treatment planning was 7.45h and for VSP was 5.10h, a 31% time reduction (Porthognathic surgery cases. Copyright © 2016 International Association of Oral and Maxillofacial Surgeons. Published by Elsevier Ltd. All rights reserved.
A common real time framework for SuperKEKB and Hyper Suprime-Cam at Subaru telescope
International Nuclear Information System (INIS)
Lee, S; Itoh, R; Katayama, N; Furusawa, H; Aihara, H; Mineo, S
2010-01-01
The real time data analysis at next generation experiments is a challenge because of their enormous data rate and size. The SuperKEKB experiment, the upgraded Belle experiment, requires to process 100 times larger data of current one. The offline-level data analysis is necessary in the HLT farm for the efficient data reduction. The real time processing of huge data is also the key at the planned dark energy survey using the Subaru telescope. The main camera for the survey called Hyper Suprime-Cam consists of 100 CCDs with 8 mega pixels each, and the total data size is expected to become comparable with that of SuperKEKB. The online tuning of measurement parameters is being planned by the real time processing, which was done empirically in the past. We started a joint development of the real time framework to be shared both by SuperKEKB and Hyper Suprime-Cam. The parallel processing technique is widely adopted in the framework design to utilize a huge number of network-connected PCs with multi-core CPUs. The parallel processing is performed not only in the trivial event-by-event manner, but also in the pipeline of the software modules which are dynamically placed over the distributed computing nodes. The object data flow in the framework is realized by the object serializing technique with the object persistency. On-the-fly collection of histograms and N-tuples is supported for the run-time monitoring. The detailed design and the development status of the framework is presented.
Mixed-mode Operating System for Real-time Performance
Directory of Open Access Journals (Sweden)
M.M. Hasan
2017-11-01
Full Text Available The purpose of the mixed-mode system research is to handle devices with the accuracy of real-time systems and at the same time, having all the benefits and facilities of a matured Graphic User Interface (GUI operating system which is typically nonreal-time. This mixed-mode operating system comprising of a real-time portion and a non-real-time portion was studied and implemented to identify the feasibilities and performances in practical applications (in the context of scheduled the real-time events. In this research an i8751 microcontroller-based hardware was used to measure the performance of the system in real-time-only as well as non-real-time-only configurations. The real-time portion is an 486DX-40 IBM PC system running under DOS-based realtime kernel and the non-real-time portion is a Pentium III based system running under Windows NT. It was found that mixed-mode systems performed as good as a typical realtime system and in fact, gave many additional benefits such as simplified/modular programming and load tolerance.
Path-integral approach to resonant electron-molecule scattering
International Nuclear Information System (INIS)
Winterstetter, M.; Domcke, W.
1993-01-01
A path-integral formulation of resonant electron-molecule scattering is developed within the framework of the projection-operator formalism of scattering theory. The formation and decay of resonances is treated in real time as a quantum-mechanical electronic-tunneling process, modified by the coupling of the electronic motion with the nuclear degrees of freedom. It is shown that the electronic continuum can be summed over in the path-integral formulation, resulting formally in the path integral for an effective two-state system with coupling to vibrations. The harmonic-oscillator approximation is adopted for the vibrational motion in the present work. Approximation methods are introduced which render the numerical evaluation of the sum over paths feasible for up to ∼10 3 elementary time slices. The theory is numerically realized for simple but nontrivial models representing the 2 Π g d-wave shape resonance in e - +N 2 collisions and the 2 Σ u + p-wave shape resonance in e - +H 2 collisions, respectively. The accuracy of the path-integral results is assessed by comparison with exact numerical reference data for these models. The essential virtue of the path-integral approach is the fact that the computational effort scales at most linearly with the number of vibrational degrees of freedom. The path-integral method is thus well suited to treat electron collisions with polyatomic molecules and molecular aggregates
Passage times of asymmetric anomalous walks with multiple paths
International Nuclear Information System (INIS)
Caceres, Manuel O; Insua, G Liliana
2005-01-01
We investigate the transient and the long-time behaviour of asymmetric anomalous walks in heterogeneous media. Two types of disorder are worked out explicitly: weak and strong disorder; in addition, the occurrence of disordered multiple paths is considered. We calculate the first passage time distribution of the associated stochastic transport process. We discuss the occurrence of the crossover from a power law to an exponential decay for the long-time behaviour of the distribution of the first passage times of disordered biased walks
32 CFR 644.23 - Real Estate Planning Documents.
2010-07-01
... PROPERTY REAL ESTATE HANDBOOK Project Planning Military (army and Air Force) and Other Federal Agencies... of any peculiar or unusual problems anticipated in connection with the proposed acquisition including... property for U.S. Army Reserve and Army National Guard use by transfer from another military department or...
Keall, Paul J; Nguyen, Doan Trang; O'Brien, Ricky; Caillet, Vincent; Hewson, Emily; Poulsen, Per Rugaard; Bromley, Regina; Bell, Linda; Eade, Thomas; Kneebone, Andrew; Martin, Jarad; Booth, Jeremy T
2018-04-01
Until now, real-time image guided adaptive radiation therapy (IGART) has been the domain of dedicated cancer radiotherapy systems. The purpose of this study was to clinically implement and investigate real-time IGART using a standard linear accelerator. We developed and implemented two real-time technologies for standard linear accelerators: (1) Kilovoltage Intrafraction Monitoring (KIM) that finds the target and (2) multileaf collimator (MLC) tracking that aligns the radiation beam to the target. Eight prostate SABR patients were treated with this real-time IGART technology. The feasibility, geometric accuracy and the dosimetric fidelity were measured. Thirty-nine out of forty fractions with real-time IGART were successful (95% confidence interval 87-100%). The geometric accuracy of the KIM system was -0.1 ± 0.4, 0.2 ± 0.2 and -0.1 ± 0.6 mm in the LR, SI and AP directions, respectively. The dose reconstruction showed that real-time IGART more closely reproduced the planned dose than that without IGART. For the largest motion fraction, with real-time IGART 100% of the CTV received the prescribed dose; without real-time IGART only 95% of the CTV would have received the prescribed dose. The clinical implementation of real-time image-guided adaptive radiotherapy on a standard linear accelerator using KIM and MLC tracking is feasible. This achievement paves the way for real-time IGART to be a mainstream treatment option. Copyright © 2018 Elsevier B.V. All rights reserved.
International Nuclear Information System (INIS)
Friesland, G.; Ovenhausen, H.
1975-05-01
The situation in the area of testing real-time-software is unsatisfactory. During the first phase of the project PROMOTE (prozessorientiertes Modul- und Gesamttestsystem) an analysis of the momentary situation took place, results of which are summarized in the following study about some user interviews and an analysis of relevant literature. 22 users (industry, software-houses, hardware-manufacturers, and institutes) have been interviewed. Discussions were held about reliability of real-time software with special interest to error avoidance, testing, and debugging. Main aims of the analysis of the literature were elaboration of standard terms, comparison of existing test methods and -systems, and the definition of boundaries to related areas. During the further steps of this project some means and techniques will be worked out to systematically test real-time software. (orig.) [de
Directory of Open Access Journals (Sweden)
Liang Wang
2018-02-01
Full Text Available Precise Point Positioning (PPP is a popular technology for precise applications based on the Global Navigation Satellite System (GNSS. Multi-GNSS combined PPP has become a hot topic in recent years with the development of multiple GNSSs. Meanwhile, with the operation of the real-time service (RTS of the International GNSS Service (IGS agency that provides satellite orbit and clock corrections to broadcast ephemeris, it is possible to obtain the real-time precise products of satellite orbits and clocks and to conduct real-time PPP. In this contribution, the real-time multi-GNSS orbit and clock corrections of the CLK93 product are applied for real-time multi-GNSS PPP processing, and its orbit and clock qualities are investigated, first with a seven-day experiment by comparing them with the final multi-GNSS precise product ‘GBM’ from GFZ. Then, an experiment involving real-time PPP processing for three stations in the Multi-GNSS Experiment (MGEX network with a testing period of two weeks is conducted in order to evaluate the convergence performance of real-time PPP in a simulated kinematic mode. The experimental result shows that real-time PPP can achieve a convergence performance of less than 15 min for an accuracy level of 20 cm. Finally, the real-time data streams from 12 globally distributed IGS/MGEX stations for one month are used to assess and validate the positioning accuracy of real-time multi-GNSS PPP. The results show that the simulated kinematic positioning accuracy achieved by real-time PPP on different stations is about 3.0 to 4.0 cm for the horizontal direction and 5.0 to 7.0 cm for the three-dimensional (3D direction.
Barbagallo, Simone; Corradi, Luca; de Ville de Goyet, Jean; Iannucci, Marina; Porro, Ivan; Rosso, Nicola; Tanfani, Elena; Testi, Angela
2015-05-17
The Operating Room (OR) is a key resource of all major hospitals, but it also accounts for up 40% of resource costs. Improving cost effectiveness, while maintaining a quality of care, is a universal objective. These goals imply an optimization of planning and a scheduling of the activities involved. This is highly challenging due to the inherent variable and unpredictable nature of surgery. A Business Process Modeling Notation (BPMN 2.0) was used for the representation of the "OR Process" (being defined as the sequence of all of the elementary steps between "patient ready for surgery" to "patient operated upon") as a general pathway ("path"). The path was then both further standardized as much as possible and, at the same time, keeping all of the key-elements that would allow one to address or define the other steps of planning, and the inherent and wide variability in terms of patient specificity. The path was used to schedule OR activity, room-by-room, and day-by-day, feeding the process from a "waiting list database" and using a mathematical optimization model with the objective of ending up in an optimized planning. The OR process was defined with special attention paid to flows, timing and resource involvement. Standardization involved a dynamics operation and defined an expected operating time for each operation. The optimization model has been implemented and tested on real clinical data. The comparison of the results reported with the real data, shows that by using the optimization model, allows for the scheduling of about 30% more patients than in actual practice, as well as to better exploit the OR efficiency, increasing the average operating room utilization rate up to 20%. The optimization of OR activity planning is essential in order to manage the hospital's waiting list. Optimal planning is facilitated by defining the operation as a standard pathway where all variables are taken into account. By allowing a precise scheduling, it feeds the process of
Borehole images while drilling : real-time dip picking in the foothills
Energy Technology Data Exchange (ETDEWEB)
Dexter, D. [Schlumberger Canada Ltd., Calgary, AB (Canada); Brezsnyak, F. [Talisman Energy Inc., Calgary, AB (Canada); Roth, J. [Talisman Energy Inc., Calgary, AB (Canada)
2008-07-01
The Alberta Foothills drilling environment is a structurally complex thrust belt with slow costly drilling and frequent plan changes after logging. The cross sections are not always accurate due to poor resolution. Therefore, the placement of the wellbore is crucial to success. This presentation showed borehole images from drilling in the Foothills. Topics that were addressed included the Foothills drilling environment; target selection; current well placement methods; and current well performance. Borehole images included resistivity images and density images. The presentation addressed why real-time images should be run. These reasons include the ability to pick dips in real-time; structural information in real time allows for better well placement; it is easier to find and stay in producing areas; reduced non-productive time and probability of sidetracks; and elimination of pipe conveys logs. Applications in the Alberta Foothills such as the commercial run for GVR4 were also offered. Among the operational issues and lessons learned, it was determined that the reservoir thickness to measurement point distance ratio is too great to avoid exiting the sweet spot and that the survey calculation error cause image offset. It was concluded that GVR is a drillers tool for well placement. figs.
The FERMI-Elettra distributed real-time framework
International Nuclear Information System (INIS)
Pivetta, L.; Gaio, G.; Passuello, R.; Scalamera, G.
2012-01-01
FERMI-Elettra is a Free Electron Laser (FEL) based on a 1.5 GeV linac. The pulsed operation of the accelerator and the necessity to characterize and control each electron bunch requires synchronous acquisition of the beam diagnostics together with the ability to drive actuators in real-time at the linac repetition rate. The Adeos/Xenomai real-time extensions have been adopted in order to add real-time capabilities to the Linux based control system computers running the Tango software. A software communication protocol based on Gigabit Ethernet and known as Network Reflective Memory (NRM) has been developed to implement a shared memory across the whole control system, allowing computers to communicate in real-time. The NRM architecture, the real-time performance and the integration in the control system are described. (authors)
Reparametrization in the path integral over finite dimensional manifold with a time-dependent metric
International Nuclear Information System (INIS)
Storchak, S.N.
1988-01-01
The path reparametrization procedure in the path integral is considered using the methods of stochastic processes for diffusion on finite dimensional manifold with a time-dependent metric. the reparametrization Jacobian has been obtained. The formulas of reparametrization for a symbolic presentation of the path integral have been derived
Development of real-time tumor tracking system for stereotactic radiotherapy
International Nuclear Information System (INIS)
Yamanaka, Seiji; Sasagawa, Tsuyoshi; Uno, Yukimichi
2011-01-01
We are now developing the real-time tumor tracking system for stereotactic radiotherapy (SRT) to provide precise information on the location of a tumor and to reduce the irradiation to healthy tissue in a patient. The system has the following features: A motion tracking and processing unit recognizes a gold marker inserted in or near a tumor in real time by the pattern matching of a predetermined template image and acquired X-ray fluoroscopic images. When the gold marker is within a planned area, that is to say, when a tumor enters a target irradiation area, a gate signal is sent to a linear accelerator. A railway unit is equipped with two X-ray tubes and two detectors, which are controlled separately with their own drive mechanism. They travel with high accuracy and reproducibility to the best position for monitoring the gold marker. A synchronization controller controls the timing for X-ray fluoroscopy and the gate signals to the linear accelerator. The controller works for two types of detectors: a color X-ray detector and a flat panel detector (FPD). (author)
Heterogeneous Embedded Real-Time Systems Environment
2003-12-01
AFRL-IF-RS-TR-2003-290 Final Technical Report December 2003 HETEROGENEOUS EMBEDDED REAL - TIME SYSTEMS ENVIRONMENT Integrated...HETEROGENEOUS EMBEDDED REAL - TIME SYSTEMS ENVIRONMENT 6. AUTHOR(S) Cosmo Castellano and James Graham 5. FUNDING NUMBERS C - F30602-97-C-0259
Real-time 3D-surface-guided head refixation useful for fractionated stereotactic radiotherapy
International Nuclear Information System (INIS)
Li Shidong; Liu Dezhi; Yin Gongjie; Zhuang Ping; Geng, Jason
2006-01-01
Accurate and precise head refixation in fractionated stereotactic radiotherapy has been achieved through alignment of real-time 3D-surface images with a reference surface image. The reference surface image is either a 3D optical surface image taken at simulation with the desired treatment position, or a CT/MRI-surface rendering in the treatment plan with corrections for patient motion during CT/MRI scans and partial volume effects. The real-time 3D surface images are rapidly captured by using a 3D video camera mounted on the ceiling of the treatment vault. Any facial expression such as mouth opening that affects surface shape and location can be avoided using a new facial monitoring technique. The image artifacts on the real-time surface can generally be removed by setting a threshold of jumps at the neighboring points while preserving detailed features of the surface of interest. Such a real-time surface image, registered in the treatment machine coordinate system, provides a reliable representation of the patient head position during the treatment. A fast automatic alignment between the real-time surface and the reference surface using a modified iterative-closest-point method leads to an efficient and robust surface-guided target refixation. Experimental and clinical results demonstrate the excellent efficacy of <2 min set-up time, the desired accuracy and precision of <1 mm in isocenter shifts, and <1 deg. in rotation
Temporal Proof Methodologies for Real-Time Systems,
1990-09-01
real time systems that communicate either through shared variables or by message passing and real time issues such as time-outs, process priorities (interrupts) and process scheduling. The authors exhibit two styles for the specification of real - time systems . While the first approach uses bounded versions of temporal operators the second approach allows explicit references to time through a special clock variable. Corresponding to two styles of specification the authors present and compare two fundamentally different proof
Real-time communication protocols: an overview
Hanssen, F.T.Y.; Jansen, P.G.
2003-01-01
This paper describes several existing data link layer protocols that provide real-time capabilities on wired networks, focusing on token-ring and Carrier Sense Multiple Access based networks. Existing modifications to provide better real-time capabilities and performance are also described. Finally
Self-Organization in Embedded Real-Time Systems
Brinkschulte, Uwe; Rettberg, Achim
2013-01-01
This book describes the emerging field of self-organizing, multicore, distributed and real-time embedded systems. Self-organization of both hardware and software can be a key technique to handle the growing complexity of modern computing systems. Distributed systems running hundreds of tasks on dozens of processors, each equipped with multiple cores, requires self-organization principles to ensure efficient and reliable operation. This book addresses various, so-called Self-X features such as self-configuration, self-optimization, self-adaptation, self-healing and self-protection. Presents open components for embedded real-time adaptive and self-organizing applications; Describes innovative techniques in: scheduling, memory management, quality of service, communications supporting organic real-time applications; Covers multi-/many-core embedded systems supporting real-time adaptive systems and power-aware, adaptive hardware and software systems; Includes case studies of open embedded real-time self-organizi...
Real-time systems scheduling fundamentals
Chetto, Maryline
2014-01-01
Real-time systems are used in a wide range of applications, including control, sensing, multimedia, etc. Scheduling is a central problem for these computing/communication systems since responsible of software execution in a timely manner. This book provides state of knowledge in this domain with special emphasis on the key results obtained within the last decade. This book addresses foundations as well as the latest advances and findings in Real-Time Scheduling, giving all references to important papers. But nevertheless the chapters will be short and not overloaded with confusing details.
Couture, Shannon M; Granholm, Eric L; Fish, Scott C
2011-02-01
Problems in real-world functioning are pervasive in schizophrenia and much recent effort has been devoted to uncovering factors which contribute to poor functioning. The goal of this study was to examine the role of four such factors: social cognition (theory of mind), neurocognition, negative symptoms, and functional capacity (social competence). 178 individuals with schizophrenia or schizoaffective disorder completed measures of theory of mind, neurocognition, negative symptoms, social competence, and self-reported functioning. Path models sought to determine the relationships among these variables. Theory of mind as indexed by the Hinting Task partially mediated the relationship between neurocognition and social competence, and negative symptoms and social competence demonstrated significant direct paths with self-reported functioning. Study results suggest theory of mind serves as an important mediator in addition to previously investigated social cognitive domains of emotional and social perception. The current study also highlights the need to determine variables which mediate the relationship between functional capacity and real-world functioning. Copyright © 2010 Elsevier B.V. All rights reserved.
Bridging the Gap - Networking Educators using Real-Time Seismic Data
Ortiz, A. M.; Renwald, M. D.; Baldwin, T. K.; Hall, M. K.
2004-12-01
After nearly a decade, the seismology community has made critical advances in identifying what is effective and what is needed for success in incorporating real-time seismic data in the classroom. Today's K-16 classroom teachers have many options and opportunities for incorporating short- and long-term inquiry activities for monitoring earthquakes and analyzing seismic data in their daily instruction. Through the SpiNet program, we are providing web-based tools that support educators working with real-time seismic data (http://www.scieds.com/spinet/). Our site includes a Recent Seismicity section, which allows users to share seismic data in real-time, and provides near real-time information about global seismicity. Our Activities section provides data and lessons to assist educators who wish to integrate seismology into their classroom. The Research section, currently under development, will allow educators to share general information about how they teach seismology in their classroom through a discussion board and by posting lesson plans. In addition, we are developing a user-friendly tool for students to post results of their research projects. Designing a website which targets a range of users requires a working knowledge of both user needs and website programming and design. User needs include providing a logical navigational structure and accounting for differences in browser functionality, internet access, and users' abilities. Using website development tools, such as PHP, MySQL, RDF feeds, and specialized geoscience applications, we are automating site maintenance; incorporating databases for information storage and retrieval; and providing accessibility for users with a range of skills and physical limitations. By incorporating these features, we have built a dynamic interface for a broad range of users interested in educational seismology.
DEFF Research Database (Denmark)
David, A.; Larsen, K.G.; Legay, A.
2015-01-01
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation, and a set of operators supporting stepwise design. We develop a specification framework for real-time systems using Timed I/O Automata as the specification formalism......, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications-all indispensable ingredients of a compositional design methodology. The theory is implemented in the new tool Ecdar...
Simon, Donald L.
2010-01-01
Aircraft engine performance trend monitoring and gas path fault diagnostics are closely related technologies that assist operators in managing the health of their gas turbine engine assets. Trend monitoring is the process of monitoring the gradual performance change that an aircraft engine will naturally incur over time due to turbomachinery deterioration, while gas path diagnostics is the process of detecting and isolating the occurrence of any faults impacting engine flow-path performance. Today, performance trend monitoring and gas path fault diagnostic functions are performed by a combination of on-board and off-board strategies. On-board engine control computers contain logic that monitors for anomalous engine operation in real-time. Off-board ground stations are used to conduct fleet-wide engine trend monitoring and fault diagnostics based on data collected from each engine each flight. Continuing advances in avionics are enabling the migration of portions of the ground-based functionality on-board, giving rise to more sophisticated on-board engine health management capabilities. This paper reviews the conventional engine performance trend monitoring and gas path fault diagnostic architecture commonly applied today, and presents a proposed enhanced on-board architecture for future applications. The enhanced architecture gains real-time access to an expanded quantity of engine parameters, and provides advanced on-board model-based estimation capabilities. The benefits of the enhanced architecture include the real-time continuous monitoring of engine health, the early diagnosis of fault conditions, and the estimation of unmeasured engine performance parameters. A future vision to advance the enhanced architecture is also presented and discussed
Accelerating cleanup. Paths to closure Hanford Site
International Nuclear Information System (INIS)
Edwards, C.
1998-01-01
This document was previously referred to as the Draft 2006 Plan. As part of the DOE's national strategy, the Richland Operations Office's Paths to Closure summarizes an integrated path forward for environmental cleanup at the Hanford Site. The Hanford Site underwent a concerted effort between 1994 and 1996 to accelerate the cleanup of the Site. These efforts are reflected in the current Site Baseline. This document describes the current Site Baseline and suggests strategies for further improvements in scope, schedule and cost. The Environmental Management program decided to change the name of the draft strategy and the document describing it in response to a series of stakeholder concerns, including the practicality of achieving widespread cleanup by 2006. Also, EM was concerned that calling the document a plan could be misconstrued to be a proposal by DOE or a decision-making document. The change in name, however, does not diminish the 2006 vision. To that end, Paths to Closure retains a focus on 2006, which serves as a point in time around which objectives and goals are established
Two dimensional simplicial paths
International Nuclear Information System (INIS)
Piso, M.I.
1994-07-01
Paths on the R 3 real Euclidean manifold are defined as 2-dimensional simplicial strips which are orbits of the action of a discrete one-parameter group. It is proven that there exists at least one embedding of R 3 in the free Z-module generated by S 2 (x 0 ). The speed is defined as the simplicial derivative of the path. If mass is attached to the simplex, the free Lagrangian is proportional to the width of the path. In the continuum limit, the relativistic form of the Lagrangian is recovered. (author). 7 refs
Chen, M-J; Duh, J-M; Shie, R-H; Weng, J-H; Hsu, H-T
2016-06-01
This study used open-path Fourier transform infrared (OP-FTIR) spectroscopy to continuously assess the variation in chloroform concentrations in the air of an indoor swimming pool. Variables affecting the concentrations of chloroform in air were also monitored. The results showed that chloroform concentrations in air varied significantly during the time of operation of the swimming pool and that there were two peaks in chloroform concentration during the time of operation of the pool. The highest concentration was at 17:30, which is coincident with the time with the highest number of swimmers in the pool in a day. The swimmer load was one of the most important factors influencing the chloroform concentration in the air. When the number of swimmers surpassed 40, the concentrations of chloroform were on average 4.4 times higher than the concentration measured without swimmers in the pool. According to the results of this study, we suggest that those who swim regularly should avoid times with highest number of swimmers, in order to decrease the risk of exposure to high concentrations of chloroform. It is also recommended that an automatic mechanical ventilation system is installed to increase the ventilation rate during times of high swimmer load. © 2015 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.
Real Time Space Weather Support for Chandra X-ray Observatory Operations
O'Dell, S. L.; Miller, S.; Minow, J. I.; Wolk, S.; Aldcroft, T. L.; Spitzbart, B. D.; Swartz, D. A.
2012-12-01
NASA launched the Chandra X-ray Observatory in July 1999. Soon after first light in August 1999, however, degradation in the energy resolution and charge transfer efficiency of the Advanced CCD Imaging Spectrometer (ACIS) x-ray detectors was observed. The source of the degradation was quickly identified as radiation damage in the charge-transfer channel of the front-illuminated CCDs, by weakly penetrating ("soft", 100-500 keV) protons as Chandra passed through the Earth's radiation belts and ring currents. As soft protons were not considered a risk to spacecraft health before launch, the only on-board radiation monitoring system is the Electron, Proton, and Helium Instrument (EPHIN) which was included on Chandra with the primary purpose of monitoring energetic solar particle events. Further damage to the ACIS detector has been successfully mitigated through a combination of careful mission planning, autonomous on-board radiation protection, and manual intervention based upon real-time monitoring of the soft-proton environment. The AE-8 and AP-8 trapped radiation models and Chandra Radiation Models are used to schedule science operations in regions of low proton flux. EPHIN has been used as the primary autonomous in-situ radiation trigger; but, it is not sensitive to the soft protons that damage the front-illuminated CCDs. Monitoring of near-real-time space weather data sources provides critical information on the proton environment outside the Earth's magnetosphere due to solar proton events and other phenomena. The operations team uses data from the Geostationary Operational Environmental Satellites (GOES) to provide near-real-time monitoring of the proton environment; however, these data do not give a representative measure of the soft-proton (real-time data provided by NOAA's Space Weather Prediction Center. This presentation will discuss radiation mitigation against proton damage, including models and real-time data sources used to protect the ACIS detector
High-Resolution Near Real-Time Drought Monitoring in South Asia
Aadhar, S.; Mishra, V.
2017-12-01
Drought in South Asia affect food and water security and pose challenges for millions of people. For policy-making, planning and management of water resources at the sub-basin or administrative levels, high-resolution datasets of precipitation and air temperature are required in near-real time. Here we develop a high resolution (0.05 degree) bias-corrected precipitation and temperature data that can be used to monitor near real-time drought conditions over South Asia. Moreover, the dataset can be used to monitor climatic extremes (heat waves, cold waves, dry and wet anomalies) in South Asia. A distribution mapping method was applied to correct bias in precipitation and air temperature (maximum and minimum), which performed well compared to the other bias correction method based on linear scaling. Bias-corrected precipitation and temperature data were used to estimate Standardized precipitation index (SPI) and Standardized Precipitation Evapotranspiration Index (SPEI) to assess the historical and current drought conditions in South Asia. We evaluated drought severity and extent against the satellite-based Normalized Difference Vegetation Index (NDVI) anomalies and satellite-driven Drought Severity Index (DSI) at 0.05˚. We find that the bias-corrected high-resolution data can effectively capture observed drought conditions as shown by the satellite-based drought estimates. High resolution near real-time dataset can provide valuable information for decision-making at district and sub- basin levels.
On Real-Time Systems Using Local Area Networks.
1987-07-01
87-35 July, 1987 CS-TR-1892 On Real - Time Systems Using Local Area Networks*I VShem-Tov Levi Department of Computer Science Satish K. Tripathit...1892 On Real - Time Systems Using Local Area Networks* Shem-Tov Levi Department of Computer Science Satish K. Tripathit Department of Computer Science...constraints and the clock systems that feed the time to real - time systems . A model for real-time system based on LAN communication is presented in
Cohen, Noa; Sabhachandani, Pooja; Golberg, Alexander; Konry, Tania
2015-04-15
In this study we describe a simple lab-on-a-chip (LOC) biosensor approach utilizing well mixed microfluidic device and a microsphere-based assay capable of performing near real-time diagnostics of clinically relevant analytes such cytokines and antibodies. We were able to overcome the adsorption kinetics reaction rate-limiting mechanism, which is diffusion-controlled in standard immunoassays, by introducing the microsphere-based assay into well-mixed yet simple microfluidic device with turbulent flow profiles in the reaction regions. The integrated microsphere-based LOC device performs dynamic detection of the analyte in minimal amount of biological specimen by continuously sampling micro-liter volumes of sample per minute to detect dynamic changes in target analyte concentration. Furthermore we developed a mathematical model for the well-mixed reaction to describe the near real time detection mechanism observed in the developed LOC method. To demonstrate the specificity and sensitivity of the developed real time monitoring LOC approach, we applied the device for clinically relevant analytes: Tumor Necrosis Factor (TNF)-α cytokine and its clinically used inhibitor, anti-TNF-α antibody. Based on the reported results herein, the developed LOC device provides continuous sensitive and specific near real-time monitoring method for analytes such as cytokines and antibodies, reduces reagent volumes by nearly three orders of magnitude as well as eliminates the washing steps required by standard immunoassays. Copyright © 2014 Elsevier B.V. All rights reserved.
Mixed-mode Operating System for Real-time Performance
M.M. Hasan; S. Sultana; C.K. Foo
2017-01-01
The purpose of the mixed-mode system research is to handle devices with the accuracy of real-time systems and at the same time, having all the benefits and facilities of a matured Graphic User Interface (GUI) operating system which is typically nonreal-time. This mixed-mode operating system comprising of a real-time portion and a non-real-time portion was studied and implemented to identify the feasibilities and performances in practical applications (in the context of scheduled the real-time...
Ratanawongsa, Neda; Handley, Margaret A; Quan, Judy; Sarkar, Urmimala; Pfeifer, Kelly; Soria, Catalina; Schillinger, Dean
2012-01-26
Health information technology can enhance self-management and quality of life for patients with chronic disease and overcome healthcare barriers for patients with limited English proficiency. After a randomized controlled trial of a multilingual automated telephone self-management support program (ATSM) improved patient-centered dimensions of diabetes care in safety net clinics, we collaborated with a nonprofit Medicaid managed care plan to translate research into practice, offering ATSM as a covered benefit and augmenting ATSM to promote medication activation. This paper describes the protocol of the Self-Management Automated and Real-Time Telephonic Support Project (SMARTSteps). This controlled quasi-experimental trial used a wait-list variant of a stepped wedge design to enroll 362 adult health plan members with diabetes who speak English, Cantonese, or Spanish and receive care at 4 publicly-funded clinics. Through language-stratified randomization, participants were assigned to four intervention statuses: SMARTSteps-ONLY, SMARTSteps-PLUS, or wait-list for either intervention. In addition to usual primary care, intervention participants received 27 weekly calls in their preferred language with rotating queries and response-triggered education about self-care, medication adherence, safety concerns, psychological issues, and preventive services. Health coaches from the health plan called patients with out-of-range responses for collaborative goal setting and action planning. SMARTSteps-PLUS also included health coach calls to promote medication activation, adherence and intensification, if triggered by ATSM-reported non-adherence, refill non-adherence from pharmacy claims, or suboptimal cardiometabolic indicators. Wait-list patients crossed-over to SMARTSteps-ONLY or -PLUS at 6 months. For participants who agreed to structured telephone interviews at baseline and 6 months (n = 252), primary outcomes will be changes in quality of life and functional status with
Linux real-time framework for fusion devices
Energy Technology Data Exchange (ETDEWEB)
Neto, Andre [Associacao Euratom-IST, Instituto de Plasmas e Fusao Nuclear, Av. Rovisco Pais, 1049-001 Lisboa (Portugal)], E-mail: andre.neto@cfn.ist.utl.pt; Sartori, Filippo; Piccolo, Fabio [Euratom-UKAEA, Culham Science Centre, Abingdon, Oxon OX14 3DB (United Kingdom); Barbalace, Antonio [Euratom-ENEA Association, Consorzio RFX, 35127 Padova (Italy); Vitelli, Riccardo [Dipartimento di Informatica, Sistemi e Produzione, Universita di Roma, Tor Vergata, Via del Politecnico 1-00133, Roma (Italy); Fernandes, Horacio [Associacao Euratom-IST, Instituto de Plasmas e Fusao Nuclear, Av. Rovisco Pais, 1049-001 Lisboa (Portugal)
2009-06-15
A new framework for the development and execution of real-time codes is currently being developed and commissioned at JET. The foundations of the system are Linux, the Real Time Application Interface (RTAI) and a wise exploitation of the new i386 multi-core processors technology. The driving motivation was the need to find a real-time operating system for the i386 platform able to satisfy JET Vertical Stabilisation Enhancement project requirements: 50 {mu}s cycle time. Even if the initial choice was the VxWorks operating system, it was decided to explore an open source alternative, mostly because of the costs involved in the commercial product. The work started with the definition of a precise set of requirements and milestones to achieve: Linux distribution and kernel versions to be used for the real-time operating system; complete characterization of the Linux/RTAI real-time capabilities; exploitation of the multi-core technology; implementation of all the required and missing features; commissioning of the system. Latency and jitter measurements were compared for Linux and RTAI in both user and kernel-space. The best results were attained using the RTAI kernel solution where the time to reschedule a real-time task after an external interrupt is of 2.35 {+-} 0.35 {mu}s. In order to run the real-time codes in the kernel-space, a solution to provide user-space functionalities to the kernel modules had to be designed. This novel work provided the most common functions from the standard C library and transparent interaction with files and sockets to the kernel real-time modules. Kernel C++ support was also tested, further developed and integrated in the framework. The work has produced very convincing results so far: complete isolation of the processors assigned to real-time from the Linux non real-time activities, high level of stability over several days of benchmarking operations and values well below 3 {mu}s for task rescheduling after external interrupt. From
Linux real-time framework for fusion devices
International Nuclear Information System (INIS)
Neto, Andre; Sartori, Filippo; Piccolo, Fabio; Barbalace, Antonio; Vitelli, Riccardo; Fernandes, Horacio
2009-01-01
A new framework for the development and execution of real-time codes is currently being developed and commissioned at JET. The foundations of the system are Linux, the Real Time Application Interface (RTAI) and a wise exploitation of the new i386 multi-core processors technology. The driving motivation was the need to find a real-time operating system for the i386 platform able to satisfy JET Vertical Stabilisation Enhancement project requirements: 50 μs cycle time. Even if the initial choice was the VxWorks operating system, it was decided to explore an open source alternative, mostly because of the costs involved in the commercial product. The work started with the definition of a precise set of requirements and milestones to achieve: Linux distribution and kernel versions to be used for the real-time operating system; complete characterization of the Linux/RTAI real-time capabilities; exploitation of the multi-core technology; implementation of all the required and missing features; commissioning of the system. Latency and jitter measurements were compared for Linux and RTAI in both user and kernel-space. The best results were attained using the RTAI kernel solution where the time to reschedule a real-time task after an external interrupt is of 2.35 ± 0.35 μs. In order to run the real-time codes in the kernel-space, a solution to provide user-space functionalities to the kernel modules had to be designed. This novel work provided the most common functions from the standard C library and transparent interaction with files and sockets to the kernel real-time modules. Kernel C++ support was also tested, further developed and integrated in the framework. The work has produced very convincing results so far: complete isolation of the processors assigned to real-time from the Linux non real-time activities, high level of stability over several days of benchmarking operations and values well below 3 μs for task rescheduling after external interrupt. From being the
Static Schedulers for Embedded Real-Time Systems
1989-12-01
Because of the need for having efficient scheduling algorithms in large scale real time systems , software engineers put a lot of effort on developing...provide static schedulers for he Embedded Real Time Systems with single processor using Ada programming language. The independent nonpreemptable...support the Computer Aided Rapid Prototyping for Embedded Real Time Systems so that we determine whether the system, as designed, meets the required
DEFF Research Database (Denmark)
Schoeberl, Martin
2015-01-01
Java served well as a general-purpose language. However, during its two decades of constant change it has gotten some weight and legacy in the language syntax and the libraries. Furthermore, Java's success for real-time systems is mediocre. Scala is a modern object-oriented and functional language...... with interesting new features. Although a new language, it executes on a Java virtual machine, reusing that technology. This paper explores Scala as language for future real-time systems....
Li, Bai; Gong, Li-gang; Yang, Wen-lun
2014-01-01
Unmanned combat aerial vehicles (UCAVs) have been of great interest to military organizations throughout the world due to their outstanding capabilities to operate in dangerous or hazardous environments. UCAV path planning aims to obtain an optimal flight route with the threats and constraints in the combat field well considered. In this work, a novel artificial bee colony (ABC) algorithm improved by a balance-evolution strategy (BES) is applied in this optimization scheme. In this new algorithm, convergence information during the iteration is fully utilized to manipulate the exploration/exploitation accuracy and to pursue a balance between local exploitation and global exploration capabilities. Simulation results confirm that BE-ABC algorithm is more competent for the UCAV path planning scheme than the conventional ABC algorithm and two other state-of-the-art modified ABC algorithms.
Towards exascale real-time RFI mitigation
van Nieuwpoort, R.V.
2016-01-01
We describe the design and implementation of an extremely scalable real-time RFI mitigation method, based on the offline AOFlagger. All algorithms scale linearly in the number of samples. We describe how we implemented the flagger in the LOFAR real-time pipeline, on both CPUs and GPUs. Additionally,
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...
Toward Real-Time Infoveillance of Twitter Health Messages.
Colditz, Jason B; Chu, Kar-Hai; Emery, Sherry L; Larkin, Chandler R; James, A Everette; Welling, Joel; Primack, Brian A
2018-06-21
There is growing interest in conducting public health research using data from social media. In particular, Twitter "infoveillance" has demonstrated utility across health contexts. However, rigorous and reproducible methodologies for using Twitter data in public health are not yet well articulated, particularly those related to content analysis, which is a highly popular approach. In 2014, we gathered an interdisciplinary team of health science researchers, computer scientists, and methodologists to begin implementing an open-source framework for real-time infoveillance of Twitter health messages (RITHM). Through this process, we documented common challenges and novel solutions to inform future work in real-time Twitter data collection and subsequent human coding. The RITHM framework allows researchers and practitioners to use well-planned and reproducible processes in retrieving, storing, filtering, subsampling, and formatting data for health topics of interest. Further considerations for human coding of Twitter data include coder selection and training, data representation, codebook development and refinement, and monitoring coding accuracy and productivity. We illustrate methodological considerations through practical examples from formative work related to hookah tobacco smoking, and we reference essential methods literature related to understanding and using Twitter data. (Am J Public Health. Published online ahead of print June 21, 2018: e1-e6. doi:10.2105/AJPH.2018.304497).
Real-Time Track Reallocation for Emergency Incidents at Large Railway Stations
Directory of Open Access Journals (Sweden)
Wei Liu
2015-01-01
Full Text Available After track capacity breakdowns at a railway station, train dispatchers need to generate appropriate track reallocation plans to recover the impacted train schedule and minimize the expected total train delay time under stochastic scenarios. This paper focuses on the real-time track reallocation problem when tracks break down at large railway stations. To represent these cases, virtual trains are introduced and activated to occupy the accident tracks. A mathematical programming model is developed, which aims at minimizing the total occupation time of station bottleneck sections to avoid train delays. In addition, a hybrid algorithm between the genetic algorithm and the simulated annealing algorithm is designed. The case study from the Baoji railway station in China verifies the efficiency of the proposed model and the algorithm. Numerical results indicate that, during a daily and shift transport plan from 8:00 to 8:30, if five tracks break down simultaneously, this will disturb train schedules (result in train arrival and departure delays.
Performance evaluation of near-real-time accounting systems
International Nuclear Information System (INIS)
Anon.
1981-01-01
Examples are given illustrating the application of near-real-time accounting concepts and principles to actual nuclear facilities. Experience with prototypical systems at the AGNS reprocessing plant and the Los Alamos plutonium facility is described using examples of actual data to illustrate the performance and effectiveness of near-real-time systems. The purpose of the session is to enable participants to: (1) identify the major components of near-real-time accounting systems; (2) describe qualitatively the advantages, limitations, and performance of such systems in real nuclear facilities; (3) identify process and facility design characteristics that affect the performance of near-real-time systems; and (4) describe qualitatively the steps necessary to implement a near-real-time accounting and control system in a nuclear facility
Real-Time Tariffs for Electric Vehicles in Wind Power based Power Systems
DEFF Research Database (Denmark)
Morais, Hugo; Sousa, Tiago; Silva, Marco
2013-01-01
’ behaviour and also the impact in load diagram. The paper proposes the energy price variation according to the relation between wind generation and power consumption. The proposed strategy was tested in two different days in the Danish power system. January 31st and August 13th 2013 were selected because......The use of Electric Vehicles (EVs) will change significantly the planning and management of power systems in a near future. This paper proposes a real-time tariff strategy for the charge process of the EVs. The main objective is to evaluate the influence of real-time tariffs in the EVs owners...... of the high quantities of wind generation. The main goal is to evaluate the changes in the EVs charging diagram with the energy price preventing wind curtailment....
CamOn: A Real-Time Autonomous Camera Control System
DEFF Research Database (Denmark)
Burelli, Paolo; Jhala, Arnav Harish
2009-01-01
This demonstration presents CamOn, an autonomous cam- era control system for real-time 3D games. CamOn employs multiple Artificial Potential Fields (APFs), a robot motion planning technique, to control both the location and orienta- tion of the camera. Scene geometry from the 3D environment...... contributes to the potential field that is used to determine po- sition and movement of the camera. Composition constraints for the camera are modelled as potential fields for controlling the view target of the camera. CamOn combines the compositional benefits of constraint- based camera systems, and improves...
Tool path in torus tool CNC machining
Directory of Open Access Journals (Sweden)
XU Ying
2016-10-01
Full Text Available This paper is about tool path in torus tool CNC machining.The mathematical model of torus tool is established.The tool path planning algorithm is determined through calculation of the cutter location,boundary discretization,calculation of adjacent tool path and so on,according to the conversion formula,the cutter contact point will be converted to the cutter location point and then these points fit a toolpath.Lastly,the path planning algorithm is implemented by using Matlab programming.The cutter location points for torus tool are calculated by Matlab,and then fit these points to a toolpath.While using UG software,another tool path of free surface is simulated of the same data.It is drew compared the two tool paths that using torus tool is more efficient.
Distributed Issues for Ada Real-Time Systems
1990-07-23
NUMBERS Distributed Issues for Ada Real - Time Systems MDA 903-87- C- 0056 S. AUTHOR(S) Thomas E. Griest 7. PERFORMING ORGANiZATION NAME(S) AND ADORESS(ES) 8...considerations. I Adding to the problem of distributed real - time systems is the issue of maintaining a common sense of time among all of the processors...because -omeone is waiting for the final output of a very large set of computations. However in real - time systems , consistent meeting of short-term
Design Specifications for Adaptive Real-Time Systems
1991-12-01
TICfl \\ E CT E Design Specifications for JAN’\\ 1992 Adaptive Real - Time Systems fl Randall W. Lichota U, Alice H. Muntz - December 1991 \\ \\\\/ 0 / r...268-2056 Technical Report CMU/SEI-91-TR-20 ESD-91-TR-20 December 1991 Design Specifications for Adaptive Real - Time Systems Randall W. Lichota Hughes...Design Specifications for Adaptive Real - Time Systems Abstract: The design specification method described in this report treats a software
Design Recovery Technology for Real-Time Systems.
1995-10-01
RL-TR-95-208 Final Technical Report October 1995 DESIGN RECOVERY TECHNOLOGY FOR REAL TIME SYSTEMS The MITRE Corporation Lester J. Holtzblatt...92 - Jan 95 4. TTTLE AND SUBTITLE DESIGN RECOVERY TECHNOLOGY FOR REAL - TIME SYSTEMS 6. AUTHOR(S) Lester J. Holtzblatt, Richard Piazza, and Susan...behavior of real - time systems in general, our initial efforts have centered on recovering this information from one system in particular, the Modular
[Real time 3D echocardiography
Bauer, F.; Shiota, T.; Thomas, J. D.
2001-01-01
Three-dimensional representation of the heart is an old concern. Usually, 3D reconstruction of the cardiac mass is made by successive acquisition of 2D sections, the spatial localisation and orientation of which require complex guiding systems. More recently, the concept of volumetric acquisition has been introduced. A matricial emitter-receiver probe complex with parallel data processing provides instantaneous of a pyramidal 64 degrees x 64 degrees volume. The image is restituted in real time and is composed of 3 planes (planes B and C) which can be displaced in all spatial directions at any time during acquisition. The flexibility of this system of acquisition allows volume and mass measurement with greater accuracy and reproducibility, limiting inter-observer variability. Free navigation of the planes of investigation allows reconstruction for qualitative and quantitative analysis of valvular heart disease and other pathologies. Although real time 3D echocardiography is ready for clinical usage, some improvements are still necessary to improve its conviviality. Then real time 3D echocardiography could be the essential tool for understanding, diagnosis and management of patients.
Directory of Open Access Journals (Sweden)
Hongzhe Jin
2017-01-01
Full Text Available This paper presents a synthetic algorithm for tracking a moving object in a multiple-dynamic obstacles environment based on kinematically planar manipulators. By observing the motions of the object and obstacles, Spline filter associated with polynomial fitting is utilized to predict their moving paths for a period of time in the future. Several feasible paths for the manipulator in Cartesian space can be planned according to the predicted moving paths and the defined feasibility criterion. The shortest one among these feasible paths is selected as the optimized path. Then the real-time path along the optimized path is planned for the manipulator to track the moving object in real-time. To improve the convergence rate of tracking, a virtual controller based on PD controller is designed to adaptively adjust the real-time path. In the process of tracking, the null space of inverse kinematic and the local rotation coordinate method (LRCM are utilized for the arms and the end-effector to avoid obstacles, respectively. Finally, the moving object in a multiple-dynamic obstacles environment is thus tracked via real-time updating the joint angles of manipulator according to the iterative method. Simulation results show that the proposed algorithm is feasible to track a moving object in a multiple-dynamic obstacles environment.
Real-time communication for distributed plasma control systems
Energy Technology Data Exchange (ETDEWEB)
Luchetta, A. [Consorzio RFX, Associazione Euratom-ENEA sulla Fusione, Corso Stati Uniti 4, Padova 35127 (Italy)], E-mail: adriano.luchetta@igi.cnr.it; Barbalace, A.; Manduchi, G.; Soppelsa, A.; Taliercio, C. [Consorzio RFX, Associazione Euratom-ENEA sulla Fusione, Corso Stati Uniti 4, Padova 35127 (Italy)
2008-04-15
Real-time control applications will benefit in the near future from the enhanced performance provided by multi-core processor architectures. Nevertheless real-time communication will continue to be critical in distributed plasma control systems where the plant under control typically is distributed over a wide area. At RFX-mod real-time communication is crucial for hard real-time plasma control, due to the distributed architecture of the system, which consists of several VMEbus stations. The system runs under VxWorks and uses Gigabit Ethernet for sub-millisecond real-time communication. To optimize communication in the system, a set of detailed measurements has been carried out on the target platforms (Motorola MVME5100 and MVME5500) using either the VxWorks User Datagram Protocol (UDP) stack or raw communication based on the data link layer. Measurements have been carried out also under Linux, using its UDP stack or, in alternative, RTnet, an open source hard real-time network protocol stack. RTnet runs under Xenomai or RTAI, two popular real-time extensions based on the Linux kernel. The paper reports on the measurements carried out and compares the results, showing that the performance obtained by using open source code is suitable for sub-millisecond real-time communication in plasma control.
Incentive-Compatible Robust Line Planning
Bessas, Apostolos; Kontogiannis, Spyros; Zaroliagis, Christos
The problem of robust line planning requests for a set of origin-destination paths (lines) along with their frequencies in an underlying railway network infrastructure, which are robust to fluctuations of real-time parameters of the solution. In this work, we investigate a variant of robust line planning stemming from recent regulations in the railway sector that introduce competition and free railway markets, and set up a new application scenario: there is a (potentially large) number of line operators that have their lines fixed and operate as competing entities issuing frequency requests, while the management of the infrastructure itself remains the responsibility of a single entity, the network operator. The line operators are typically unwilling to reveal their true incentives, while the network operator strives to ensure a fair (or socially optimal) usage of the infrastructure, e.g., by maximizing the (unknown to him) aggregate incentives of the line operators.
Real-Time Joint Streaming Data Processing from Social and Physical Sensors
Kropivnitskaya, Y. Y.; Qin, J.; Tiampo, K. F.; Bauer, M.
2014-12-01
The results of the technological breakthroughs in computing that have taken place over the last few decades makes it possible to achieve emergency management objectives that focus on saving human lives and decreasing economic effects. In particular, the integration of a wide variety of information sources, including observations from spatially-referenced physical sensors and new social media sources, enables better real-time seismic hazard analysis through distributed computing networks. The main goal of this work is to utilize innovative computational algorithms for better real-time seismic risk analysis by integrating different data sources and processing tools into streaming and cloud computing applications. The Geological Survey of Canada operates the Canadian National Seismograph Network (CNSN) with over 100 high-gain instruments and 60 low-gain or strong motion seismographs. The processing of the continuous data streams from each station of the CNSN provides the opportunity to detect possible earthquakes in near real-time. The information from physical sources is combined to calculate a location and magnitude for an earthquake. The automatically calculated results are not always sufficiently precise and prompt that can significantly reduce the response time to a felt or damaging earthquake. Social sensors, here represented as Twitter users, can provide information earlier to the general public and more rapidly to the emergency planning and disaster relief agencies. We introduce joint streaming data processing from social and physical sensors in real-time based on the idea that social media observations serve as proxies for physical sensors. By using the streams of data in the form of Twitter messages, each of which has an associated time and location, we can extract information related to a target event and perform enhanced analysis by combining it with physical sensor data. Results of this work suggest that the use of data from social media, in conjunction
Complex Langevin simulation of real time quantum evolution
International Nuclear Information System (INIS)
Ilgenfritz, E.M.; Kripfganz, J.
1986-07-01
Complex Langevin methods are used to study the time evolution of quantum mechanical wave packets. We do not need any Feynman ε regularization for the numerical evaluation of the double time path integral. (author)
ICARES: a real-time automated detection tool for clusters of infectious diseases in the Netherlands.
Groeneveld, Geert H; Dalhuijsen, Anton; Kara-Zaïtri, Chakib; Hamilton, Bob; de Waal, Margot W; van Dissel, Jaap T; van Steenbergen, Jim E
2017-01-01
Clusters of infectious diseases are frequently detected late. Real-time, detailed information about an evolving cluster and possible associated conditions is essential for local policy makers, travelers planning to visit the area, and the local population. This is currently illustrated in the Zika