This paper studies an approximate dynamic programming (ADP) strategy of a group of nonlinear switched systems, where the external disturbances are considered. The neural network (NN) technique is regarded to estimate the unknown part of actor as well as critic to deal with the corresponding nominal system. The training technique is simultaneously carried out based on the solution of minimizing the square error Hamilton function. The closed system’s tracking error is analyzed to converge to an...

Topics: Adaptive dynamic programming, HJB equation, Lyapunov, Neural networksstability, Nonlinear switched...

20
20

Sep 1, 2020
09/20

Sep 1, 2020
by
Dao Phuong Nam, Nguyen Hong Quang, Tran Phuong Nam, Tran Thi Hai Yen

texts

#
eye 20

#
favorite 0

#
comment 0

In this paper, the optimal control problem of a nonlinear robot manipulator in absence of holonomic constraint force based on the point of view of adaptive dynamic programming (ADP) is presented. To begin with, the manipulator was intervened by exact linearization. Then the framework of ADP and Robust Integral of the Sign of the Error (RISE) was developed. The ADP algorithm employs Neural Network technique to tune simultaneously the actor-critic network to approximate the control policy and the...

Topics: Adaptive dynamic programming (ADP), Input constraint, Neural network, Robot manipulator, Robust...

We present an algorithmc model for distributed computation of fixed points whereby several processors participate simultaneously in the calculations while exchanging information via communication links. We place essentially no assumption on the ordering of computation and communication between processors thereby allowing for completely uncoordinated execution. We find that even under these potentially chaotic circumstances it is possible to solve several important classes of problems including...

Topics: DTIC Archive, Bertsekas,Dimitri P, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND...

6,421
6.4K

2020
2020

2020
by
MIT OpenCourseWare

movies

#
eye 6,421

#
favorite 10

#
comment 0

Instructor: Prof. Erik Demaine, Dr. Jason Ku, Prof. Justin Solomon View the complete course: https://ocw.mit.edu/6-006S20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY This course is an introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems. It emphasizes the relationship between algorithms and programming and introduces basic performance...

Topics: 6.006, data structure, sorting, hashing, binary trees, breadth-first search, depth-first search,...

The U.S. Navy’s supply chain stretches globally, supporting the fleet in multiple theaters to enable sustained forward presence, security, and deterrence. However, supply chains are subject to disruptions that slow materiel movements throughout the network, and these disruptions may severely hinder the readiness of ships operating in distant theaters. A common culprit for peacetime supply chain disruptions is adverse weather, which is especially true in waters that are prone to major tropical...

Topics: optimization, supply chain disruption, stochastic optimization, linear programming, chance...

We relax the causality assumption in formulating recurrent neural networks, so that the hidden states of the network are all coupled together. This goes beyond bidirectional RNN, which consists of two explicit recurrent networks concatenated together. The motivation behind doing this is to improve performance on long-range dependencies, and to improve stability (solution drift) in NLP tasks. We choose an implicit neural network architecture, show that it can be computed reasonably efficiently,...

Topics: DTIC Archive, Kazi,Michaeel, MASSACHUSETTS INST OF TECH LEXINGTON LEXINGTON United States,...

Imagine in a social network that an agent wants to form a connection with a target user(s) by interacting with the friends of the target(s). Because forming a connection is known as following in social networks such as Twitter, we refer to this as the follow back problem. The friends of the target user(s) form a directed graph which we refer to as the friend's graph. The agents goal is to get the target to follow him, and he is allowed to interact with the target and the targets friends. To...

Topics: DTIC Archive, Rajagopalan,Krishnan, MASSACHUSETTS INST OF TECH LEXINGTON LEXINGTON United States,...

In this paper, we develop a method for solving a large class of non-convex Hamilton-Jacobi partial differential equations (HJ PDE). The method yields decoupled subproblems, which can be solved in an embarrassingly parallel fashion. The complexity of the resulting algorithm is polynomial in the problem dimension; hence, it overcomes the curse of dimensionality [1, 2]. We extend previous work in[6] and apply the Hopf formula to solve HJ PDE involving non-convex Hamiltonians. We propose an ADMM...

Topics: DTIC Archive, Chow,Yat T, University of California, Los Angeles Los Angeles United States,...

A harvest-use-store power splitting (PS) relaying strategy with distributed beam forming is proposed for wireless powered multi-relay cooperative networks in this paper. Different from the conventional battery-free PS relaying strategy, harvested energy is prioritized to power information relaying while the remainder is accumulated and stored for future usage with the help of a battery in the proposed strategy, which supports an efficient utilization of harvested energy. However, PS affects...

Topics: DTIC Archive, Zhou,Zheng, BEIJING UNIV OF POSTS AND TELECOMMUNICATIONS (CHINA) BEIJING China,...

31,565
32K

2016
2016

2016
by
MIT OpenCourseWare

movies

#
eye 31,565

#
favorite 17

#
comment 0

MIT 6.0002 Introduction to Computational Thinking and Data Science, Fall 2016 View the complete course: http://ocw.mit.edu/6-0002F16 Instructor: John Guttag This course provides students with an understanding of the role computation can play in solving problems. Student will learn to write small programs using the Python 3.5 programming language. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Topics: Python 3.5, Python, machine learning, knapsack problem, greedy algorithm, optimization, weights,...

One of the long-term goals of this project is to analyze and propose energy-efficient communication techniques for underwater acoustic sensor networks. These techniques aim at consuming as less energy as possible as well as guaranteeing a minimum quality of service. In order to do so, we assume and validate some statistics of the underwater acoustic channels and derive stochastic optimal transmission policies. Another long-term goal of this project is to investigate the possibility that these...

Topics: DTIC Archive, Tomasi,Beatrice, Woods Hole Oceanographic Institution Woods Hole United States,...

This project addresses fundamental issues that arise in information representation architectures for autonomous reasoning and learning, decentralized planning, and decision-making in multiagent systems. The overall goal of the project is to develop efficient and adaptive strategies to process, represent, exchange, and act upon relevant information from massive data collections, much of which can be irrelevant, imprecise, and contradictory. Within this context we develop results in an array of...

Topics: DTIC Archive, Voulgaris,Petros, University of Illinois at Urbana Champaign Urbana, robots,...

Bayesian Blocks are optimal piecewise linear representations (step function fits) of light-curves. The simple algorithm implementing this idea, using dynamic programming, has been extended to include more data modes and fitness metrics, multivariate analysis, and data on the circle (Studies in Astronomical Time Series Analysis. VI. Bayesian Block Representations, Scargle, Norris, Jackson and Chiang 2013, ApJ, 764, 167), as well as new results on background subtraction and refinement of the...

Topics: NASA Technical Reports Server (NTRS), BAYES THEOREM, LIGHT CURVE, DYNAMIC PROGRAMMING, ALGORITHMS,...

The United States Army uses Vendor Managed Inventory (VMI) replenishment to manage resupply operations while engaged in a combat environment; upper-echelon organizations (e.g., a brigade) maintain situational awareness regarding the inventory of lower-echelon organizations (e.g., battalions and companies). The Army is interested in using a fleet of cargo unmanned aerial vehicles (CUAVs) to perform resupply operations. We formulate an infinite horizon, discrete time stochastic Markov decision...

Topics: DTIC Archive, AIR FORCE INSTITUTE OF TECHNOLOGY WRIGHT-PATTERSON AFB OH GRADUATE SCHOOL OF...

Optimizing operations at plug-in hybrid electric vehicle (PHEV) battery swap stations is internally motivated by the movement to make transportation cleaner and more efficient. A PHEV swap station allows PHEV owners to quickly exchange their depleted PHEV battery for a fully charged battery. The PHEV-Swap Station Management Problem (PHEV-SSMP) is introduced, which models battery charging and discharging operations at a PHEV swap station facing nonstationary, stochastic demand for battery swaps,...

Topics: DTIC Archive, AIR FORCE INSTITUTE OF TECHNOLOGY WRIGHT-PATTERSON AFB OH GRADUATE SCHOOL OF...

The United States Air Force (USAF) officer sustainment system involves making accession and promotion decisions for nearly 64 thousand officers annually. We formulate a discrete time stochastic Markov decision process model to examine this military workforce planning problem. The large size of the motivating problem suggests that conventional exact dynamic programming algorithms are inappropriate. As such, we propose two approximate dynamic programming (ADP) algorithms to solve the problem. We...

Topics: DTIC Archive, AIR FORCE INSTITUTE OF TECHNOLOGY WRIGHT-PATTERSON AFB OH GRADUATE SCHOOL OF...

We develop a Markov decision process (MDP) model to examine military medical evacuation (MEDEVAC) dispatch policies. To solve our MDP, we apply an approximate dynamic programming (ADP) technique. The problem of deciding which aeromedical asset to dispatch to which service request is complicated by the service locations and the priority class of each casualty event. We assume requests for MEDEVAC arrive sequentially, with the location and the priority of each casualty known upon initiation of...

Topics: DTIC Archive, AIR FORCE INSTITUTE OF TECHNOLOGY WRIGHT-PATTERSON AFB OH GRADUATE SCHOOL OF...

This Grant addressed four focus areas toward advancing the state-of-the-art in learning control theory of robust and adaptive non-equilibrium control of highly nonlinear, higher-order, reconfigurable systems: 1. Extend Approximate Dynamic Programming (ADP) techniques to control of nonlinear, multiple time scale, non-affine systems in an Adaptive Control framework.; 2. Develop solution techniques for Markov Decision Problems (MDP) that scale to continuous state and control spaces with...

Topics: DTIC Archive, TEXAS ENGINEERING EXPERIMENT STATION COLLEGE STATION, *CONTROL, DYNAMIC PROGRAMMING,...

35,040
35K

2015
2015

2015
by
MIT OpenCourseWare

movies

#
eye 35,040

#
favorite 13

#
comment 0

View the complete course: http://ocw.mit.edu/6-046JS15 Instructors: Erik Demaine, Srinivas Devadas, Nancy Ann Lynch 6.046 introduces students to the design of computer algorithms, as well as analysis of sophisticated algorithms. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Topics: algorithm, sorting, search trees, heaps, hashing, divide and conquer, dynamic programming, greedy...

This research considers the optimal allocation of weapons to a collection of targets with the objective of maximizing the value of destroyed targets. The weapon-target assignment (WTA) problem is a classic non-linear combinatorial optimization problem with an extensive history in operations research literature. The dynamic weapon target assignment (DWTA) problem aims to assign weapons optimally over time using the information gained to improve the outcome of their engagements. This research...

Topics: DTIC Archive, AIR FORCE INSTITUTE OF TECHNOLOGY WRIGHT-PATTERSON AFB OH GRADUATE SCHOOL OF...

An inter-disciplinary team (consisting of engineers, computer scientists, and mathematicians across foundation, theory and networked systems) made significant progress in understanding real-time information transmission over a variety of communication networks. Dozens of research breakthroughs have been made, ranging from geometry and topology to signal processing and communication protocol, from network optimization to systems implementation, and from security and privacy to radio...

Topics: DTIC Archive, PRINCETON UNIV NJ, *ADAPTIVE SYSTEMS, *STOCHASTIC PROCESSES, *WIRELESS COMPUTER...

Detailed maintenance planning under uncertainty is one of the most important topics in military research and practice. As one of the fastest ways to recover failed weapon systems, cannibalization operations are commonly applied by maintenance personnel. Due to additional complexities introduced by these operations, detailed maintenance decision making with cannibalization was rarely studied in the literature. This report proposed an analytic model for making repair decisions in a multi-stage...

Topics: DTIC Archive, Zhang,R, DRDC - Centre for Operational Research and Analysis Ottawa ON Canada,...

A communication system for communicating over high-latency, low bandwidth networks includes a communications processor configured to receive a collection of data from a local system, and a transceiver in communication with the communications processor. The transceiver is configured to transmit and receive data over a network according to a plurality of communication parameters. The communications processor is configured to divide the collection of data into a plurality of data streams; assign a...

Topics: NASA Technical Reports Server (NTRS), BANDWIDTH, WIRELESS COMMUNICATION, TRANSMITTER RECEIVERS,...

153
153

Sep 30, 2014
09/14

Sep 30, 2014

texts

#
eye 153

#
favorite 0

#
comment 0

The paper evaluates the potentials for conjunctive use of surface water and groundwater resources to meet the present and future water demand of the University of Benin, Benin City, Edo state, Nigeria. A discrete dynamic model was developed and applied to predict the demand, consumption and net benefit of the conjunctive use of the two sources. In the model, allocations each user was assumed to represent a stage in the sequence of decisions. Three decision...

Topics: Discrete Dynamic Programming, Surface Water Resources, Groundwater Resources, Net Benefit

One of the long-term goals of this project is to analyze and propose energy-efficient communication techniques for underwater acoustic sensor networks. These techniques aim at consuming as less energy as possible as well as guaranteeing a minimum quality of service. In order to do so, we assume and validate some statistics of the underwater acoustic channels and derive stochastic optimal transmission policies. Another long-term goal of this project is to investigate the possibility that these...

Topics: DTIC Archive, WOODS HOLE OCEANOGRAPHIC INSTITUTION MA, *UNDERWATER COMMUNICATIONS, ACOUSTIC...

New classes of stochastic models for network systems having stochastically dependent components are studied by a combination of probabilistic analysis and efficient simulation techniques. For instance, in a model in which shocks of r different types occur, with component i failing when there have been a total of n(i) type i shocks, we give a method for studying the distribution of the the number of shocks needed to cause the system to fail.

Topics: DTIC Archive, UNIVERSITY OF SOUTHERN CALIFORNIA LOS ANGELES, *OPTIMIZATION, *STOCHASTIC PROCESSES,...

An increasingly dynamic battlefield requires increasingly faster software development. Cyber threats and Information Assurance certifications induce significant delays in software operational deployment designed to meet these emerging battlefield requirements. An alternative software development methodology for Department of Defense (DOD) acquisitions was proposed. The proposed software development methodology uses tailoring of commercial pre-approved applications such as Microsoft Office and...

Topics: DTIC Archive, NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF ELECTRICAL AND COMPUTER ENGINEERING,...

An increasingly dynamic battlefield requires increasingly faster software development. Cyber threats and Information Assurance certifications induce significant delays in software operational deployment designed to meet these emerging battlefield requirements. An alternative software development methodology for Department of Defense (DOD) acquisitions was proposed. The proposed software development methodology uses tailoring of commercial pre-approved applications such as Microsoft Office and...

Topics: Jamming, EA-18G, Linear Programming, Dynamic Programming, Microsoft Office, GPU, Radar, Bresenham...

Dynamic programming is used in many military and industrial applications to solve sequential decision making problems. This research proposes the development of a model and approach to address the application of dynamic programming in nation-building modeling. Through the creation of component indices to capture the state of operational variables: Political, Military, Economic, Social, Infrastructure, and Information (PMESII), a functional form of a system of differential equations is developed...

Topics: DTIC Archive, AIR FORCE INSTITUTE OF TECHNOLOGY WRIGHT-PATTERSON AFB OH GRADUATE SCHOOL OF...

This project developed an operator error model for improving the accuracy of the operator task of discriminating objects in multiple UAV videos on the Vigilant Spirit Control Station (VSCS) ground station. This error model is idiographic in the sense that it is tailored for a specific individual. The operator error model is used in a stochastic controller which decides, based on the model uncertainty and the operator input of target/non-target, whether to revisit the object to obtain additional...

Topics: DTIC Archive, AIR FORCE RESEARCH LAB WRIGHT-PATTERSON AFB OH POWER AND CONTROL DIV, *ALGORITHMS,...

Optimal path planning and control of vehicles becomes of greater importance as more and more tasks are transferred to autonomous agents. The concept of optimal path planning and optimal control of a generic surface vehicle in a constant current flow was investigated. This report documents the development of a three degree-of-freedom model of a generic surface vehicle and describes optimal path planning in a uniform surface current flow environment. The nominal path is derived using a two-point...

Topics: DTIC Archive, NAVAL UNDERSEA WARFARE CENTER DIV NEWPORT RI, *AUTONOMOUS NAVIGATION, BOUNDARY VALUE...

The implementation of Better Buying Power policies seeks to achieve affordability across the spectrum of major defense acquisition programs. However, the technical and programmatic challenges associated with sequential decision-making in the acquisition of large scale, increasingly interdependent defense systems prompts a need for quantitative frameworks that can better address the complexities of negotiating capability, schedule, and cost, while fulfilling target objectives of affordability....

Topics: DTIC Archive, PURDUE UNIV LAFAYETTE IN, *COSTS, *MILITARY PROCUREMENT, COMPETITION, DECISION...

The inventory routing problem coordinates inventory management and transportation policies when implementing vendor managed inventory replenishment, the business practice were a vendor monitors the inventory of its customers and determines a strategy to replenish each customer. The United States Army uses vendor managed inventory replenishment during combat situations to manage resupply. The military variant of the stochastic inventory routing problem considers delivery failure due to hostile...

Topics: DTIC Archive, AIR FORCE INSTITUTE OF TECHNOLOGY WRIGHT-PATTERSON AFB OH GRADUATE SCHOOL OF...

The goal of high level event classification from videos is to assign a single, high level event label to each query video. Traditional approaches represent each video as a set of low level features and encode it into a fixed length feature vector (e.g. Bag-of-Words), which leave a big gap between low level visual features and high level events. Our paper tries to address this problem by exploiting activity concept transitions in video events (ACTIVE). A video is treated as a sequence of short...

Topics: DTIC Archive, Sun, Chen, University of Southern California Los Angeles United States, VIDEO IMAGES,...

Identifying and quantifying factors influencing human decision making remains an outstanding challenge, impacting the performance and predictability of social and technological systems. In many cases, system failures are traced to human factors including congestion, overload, miscommunication, and delays. Here we report results of a behavioral network science experiment, targeting decision making in a natural disaster. In a controlled laboratory setting, our results quantify several key factors...

Topics: DTIC Archive, CALIFORNIA UNIV SANTA BARBARA, *BEHAVIOR, *DECISION MAKING, *GROUP DYNAMICS,...

This paper presents an algorithm for checking temporal precedence properties of nonlinear switched systems. This class of properties subsume bounded safety and capture requirements about visiting a sequence of predicates within given time intervals. The algorithm handles nonlinear predicates that arise from dynamics-based predictions used in alerting protocols for state-of-the-art transportation systems. It is sound and complete for nonlinear switch systems that robustly satisfy the given...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, NONLINEAR SYSTEMS, DYNAMIC PROGRAMMING,...

Video cameras are critical to providing persistent surveillance capabilities for situational awareness. Currently, video analysis requires significant human supervision. Even many of the routine tasks ranging from detecting, identifying, localizing/tracking interesting events, discarding irrelevant data, to providing actionable intelligence currently requires significant human supervision. Human supervision is not scalable for providing persistent wide-area monitoring and particularly for...

Topics: DTIC Archive, BOSTON UNIV MA DEPT OF ELECTRICAL COMPUTER AND SYSTEMS ENGINEERING, *VIDEO IMAGES,...

We have investigated learning algorithms for inference and decision making, by using exact and approximate optimization methods. Most of our research has been in approximate dynamic programming/reinforcement learning methods, with a focus on Markovian Decision Problems with a very large number of states. Much of our work is related to a fundamental algorithm, Q-learning, and related new methods that relate to exact and approximate policy iteration. In particular, we have investigated,...

Topics: DTIC Archive, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS,...

We consider the problem of collaborative target localization by several observers, called players, where the reliability of each player is unknown. As in our previous work [1] we formulate this problem as a 20 questions game with noise for collaborative players under a minimum entropy criterion. We extend the setting of [1] to the case where the players' error channels have unknown crossover probabilities. First, we use dynamic programming to characterize the structure of the optimal policy for...

Topics: DTIC Archive, MICHIGAN UNIV ANN ARBOR, *TARGETS, DYNAMIC PROGRAMMING, GAME THEORY, OPTIMIZATION,...

We consider the sequential allocation of differing weapons to a collection of adversarial targets with the goal of surviving to destroy a critical target within a combat simulation. The platform which carries the weapons proceeds through a set of sequential stages and at each stage potentially engages targets with available weapons. The decision space at each stage is affected by previous decisions and the probability of platform destruction. Simulation and dynamic programming are then used...

Topics: DTIC Archive, AIR FORCE INSTITUTE OF TECHNOLOGY WRIGHT-PATTERSON AFB OH, *COMBAT SIMULATION,...

This research investigated algorithms for approximately solving Markov decision processes (MDPs), a widely used model of sequential decision making. Much past work on solving MDPs in adaptive dynamic programming and reinforcement learning has assumed representations, such as basis functions, are provided by a human expert. The research investigated a variety of approaches to automatic basis construction, including reward-sensitive and reward-invariant methods, diagonalization and dilation...

Topics: DTIC Archive, MASSACHUSETTS UNIV AMHERST DEPT OF COMPUTER SCIENCE, *ALGORITHMS, *DECISION MAKING,...

126
126

Oct 15, 2013
10/13

Oct 15, 2013
by
Girish Kumar Patra ,N Venkateswarlu , B Malleshwari , B Murali Krishna

texts

#
eye 126

#
favorite 0

#
comment 0

Compound images are a combination of text, graphics and natural image. They present strong anisotropic features, especially on the text and graphics parts. These anisotropic features often render conventional compression inefficient. Thus, this paper proposes a novel coding scheme from the H.264 intraframe coding. In the scheme, two new intramodes are developed to better exploit spatial correlation in compound images. The first is the residual scalar quantization (RSQ) mode, where...

Topics: Base colors and the index map, compound image compression, dynamic programming, residual scalar...

This project focused on distributed control and information fusion/learning over communication systems. The first set of problems considered were related to distributed adaptive control. Namely, a first such decentralized learning algorithm for multi-armed bandit models was developed that achieved poly-logarithmic regret. Later another algorithm was given that achieve log regret. The second set of problems was related to decentralized control design for LQG systems with asymmetric one-step...

Topics: DTIC Archive, UNIVERSITY OF SOUTHERN CALIFORNIA LOS ANGELES, *COMMUNICATIONS NETWORKS, *DYNAMIC...

In this paper, we analyze an internal goal structure based on heuristic dynamic programming, named GrHDP, to tackle the 2-D maze navigation problem. Classical reinforcement learning approaches have been introduced to solve this problem in literature, yet no intermediate reward has been assigned before reaching the final goal. In this paper, we integrated one additional network, namely goal network, into the traditional heuristic dynamic programming (HDP)design to provide the internal...

Topics: DTIC Archive, Ni,Zhen, University of Rhode Island Kingston United States, dynamic programming,...

A chance-constrained dynamic programming algorithm was developed that is capable of making optimal sequential decisions within a user-specified risk bound. This work handles stochastic uncertainties over multiple stages in the CEMAT (Combined EDL-Mobility Analyses Tool) framework. It was demonstrated by a simulation of Mars entry, descent, and landing (EDL) using real landscape data obtained from the Mars Reconnaissance Orbiter. Although standard dynamic programming (DP) provides a general...

Topics: NASA Technical Reports Server (NTRS), MARS RECONNAISSANCE ORBITER, MARS LANDING, DESCENT, RISK,...

The lack of focus on complexity issues in System-of-Systems-related acquisitions prevents effective support for Better Buying Power (BBP) targets of affordability, innovation, increased productivity, and healthy competition in reducing costs and improving delivery of promised performance. The impetus is to provide the necessary analytical frameworks and associated tools that enable better informed decisions in support of BBP objectives. This paper extends our previous work in robust portfolio...

Topics: DTIC Archive, PURDUE UNIV LAFAYETTE IN SCHOOL OF AERONAUTICS AND ASTRONAUTICS, *DECISION MAKING,...

Conducting optimization under conditions of uncertainty has long been a very difficult problem. Thus, when analysts have done optimization under uncertainty, they have introduced severe limitations to restrict how uncertainties can be factored in. This paper describes a new approach to optimization under uncertainty that is aimed at finding the optimal solution to a problem by designing a number of search algorithms or schemes in a way that reduces the dimensionality constraints that analysts...

Topics: DTIC Archive, RAND ARROYO CENTER SANTA MONICA CA, *ALGORITHMS, *DECISION MAKING, *OPTIMIZATION,...

Topics: DTIC Archive, AIR FORCE OFFICE OF SCIENTIFIC RESEARCH ARLINGTON VA, *OPTIMIZATION, AIR FORCE...

There are many diverse numerical methods that can be applied to solving path planning problems, however, most of these are either not valid or impractical for solving anisotropic (direction-dependent) path planning problems. Ordered Upwind Methods (OUM) are a family of numerical methods for approximating the viscosity solution of static Hamilton-Jacobi-Bellman equations, and have been tailored to solve anisotropic optimal control problems. There is little information in the literature regarding...

Topics: DTIC Archive, DEFENCE SCIENCE AND TECHNOLOGY ORGANISATION VICTORIA (AUSTRALIA) AIR OPERATIONS DIV,...

This research will examine the optimal maintenance and replacement policies for a generic machine with periodic inspection intervals. The considered reliability models consist of a single machine that can fail during operation or else may be found to be inoperative during regularly-scheduled maintenance inspections. A distinction will be made between spontaneously-occurring failures during operation and those that are discovered during inspections. Since the elapsed time between inspections is...

Topics: DTIC Archive, AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH GRADUATE SCHOOL OF ENGINEERING AND...