Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 7 of 7

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

Modeling Method Based On Reachable Set For Safety Path In Autonomous Vehicle Obstacle Avoidance, Cao Kai, Xiaoxiao Huang, Yu Yun, Liu Chun Jul 2020

Modeling Method Based On Reachable Set For Safety Path In Autonomous Vehicle Obstacle Avoidance, Cao Kai, Xiaoxiao Huang, Yu Yun, Liu Chun

Journal of System Simulation

Abstract: In view of problem in all possible uncertain behavior of vehicle unable existed by the traditional path planning algorithm, a modeling method was proposed which deemed a moving vehicle as a hybrid system switching dynamically between continuous and discrete mode, modeled an optimal trajectory for vehicle obstacle avoidance by using a single security target location, and built a safe state reachable set based on the trajectory beam of multiple security target locations. On this basis, the condition of the inevitable collision of vehicle was analyzed, and the optimal control problem with loose constraints for the vehicle obstacle avoidance was …


Digital Design Of Intralogistics Systems: Flexible And Agile Solution To Short-Cyclic Fluctuations, Anike Murrenhoff, Christoph Pott, Moritz Wernecke, Philipp-Akira Burger Jan 2018

Digital Design Of Intralogistics Systems: Flexible And Agile Solution To Short-Cyclic Fluctuations, Anike Murrenhoff, Christoph Pott, Moritz Wernecke, Philipp-Akira Burger

15th IMHRC Proceedings (Savannah, Georgia. USA – 2018)

In times of fast-paced, fluctuating and individual markets, intralogistics systems, such as warehouses, have to adapt to the resulting volatile performance demands dynamically. Hybrid systems, in which humans and machines work together efficiently and communicate in socio-technical networks, can be the answer to manage these high-frequency markets. Hybrid systems of the future need to adapt frequently and permanent change becomes the “new normal”. A one-time planning of warehousing systems upon first installation becomes obsolete. This results in the question of how to design and implement processes for future logistics systems in an agile way in order to exploit the flexibility …


Optimal Paths In Weighted Timed Automata, Rajeev Alur, Salvatore La Torre, George J. Pappas Mar 2012

Optimal Paths In Weighted Timed Automata, Rajeev Alur, Salvatore La Torre, George J. Pappas

George J. Pappas

We consider the optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to computing (parametric) shortest paths in a finite weighted directed graph. We call this graph a parametric sub-region graph. It refines the region graph, a standard tool for the analysis of timed automata, by adding the information which is relevant to solving the optimal-reachability problem. We present an algorithm to solve the optimal-reachability problem for weighted timed automata that takes time exponential in O(n (|δ(A)|+|wmax|)), where n …


Optimal Paths In Weighted Timed Automata, Rajeev Alur, Salvatore La Torre, George J. Pappas Mar 2012

Optimal Paths In Weighted Timed Automata, Rajeev Alur, Salvatore La Torre, George J. Pappas

George J. Pappas

We consider the optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to computing (parametric) shortest paths in a finite weighted directed graph. We call this graph a parametric sub-region graph. It refines the region graph, a standard tool for the analysis of timed automata, by adding the information which is relevant to solving the optimal-reachability problem. We present an algorithm to solve the optimal-reachability problem for weighted timed automata that takes time exponential in O(n (|δ(A)|+|wmax|)), where n …


Optimal Paths In Weighted Timed Automata, Rajeev Alur, Salvatore La Torre, George J. Pappas Mar 2012

Optimal Paths In Weighted Timed Automata, Rajeev Alur, Salvatore La Torre, George J. Pappas

George J. Pappas

We consider the optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to computing (parametric) shortest paths in a finite weighted directed graph. We call this graph a parametric sub-region graph. It refines the region graph, a standard tool for the analysis of timed automata, by adding the information which is relevant to solving the optimal-reachability problem. We present an algorithm to solve the optimal-reachability problem for weighted timed automata that takes time exponential in O(n (|δ(A)|+|wmax|)), where n …


Cyber Physical Complex Networks, Modeling, Analysis, And Control, Neveen Shlayan Aug 2011

Cyber Physical Complex Networks, Modeling, Analysis, And Control, Neveen Shlayan

UNLV Theses, Dissertations, Professional Papers, and Capstones

This research scrutinize various attributes of complex networks; mainly, modeling, sensing, estimation, safety analysis, and control. In this study, formal languages and finite automata are used for modeling incident management processes. Safety properties are checked in order to verify the system. This method introduces a systematic approach to incident management protocols that are governed by mostly unsystematic algorithms. A portion of the used data in this study is collected by means of radar and loop detectors. A weighted t-statistics methodology is developed in order to validate these detectors. The detector data is then used to extract travel time information where …


A Hybrid Templated-Based Composite Classification System, Michael A. Turnbaugh Mar 2009

A Hybrid Templated-Based Composite Classification System, Michael A. Turnbaugh

Theses and Dissertations

An automatic target classification system contains a classifier which reads a feature as an input and outputs a class label. Typically, the feature is a vector of real numbers. Other features can be non-numeric, such as a string of symbols or alphabets. One method of improving the performance of an automatic classification system is through combining two or more independent classifiers that are complementary in nature. Complementary classifiers are observed by finding an optimal method for partitioning the problem space. For example, the individual classifiers may operate to identify specific objects. Another method may be to use classifiers that operate …