Relevant bibliographies by topics / Backward Reachable Sets

Academic literature on the topic 'Backward Reachable Sets'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Backward Reachable Sets.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Backward Reachable Sets"

1

Xue, Bai, Zhikun She, and Arvind Easwaran. "Underapproximating Backward Reachable Sets by Semialgebraic Sets." IEEE Transactions on Automatic Control 62, no. 10 (October 2017): 5185–97. http://dx.doi.org/10.1109/tac.2017.2694351.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Grande, Nicholas, Shane Tierney, Joseph F. Horn, and Jack W. Langelaan. "Safe Autorotation through Wind Shear via Backward Reachable Sets." Journal of the American Helicopter Society 61, no. 2 (April 1, 2016): 1–11. http://dx.doi.org/10.4050/jahs.61.022006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Yang, Liren, and Necmiye Ozay. "Scalable Zonotopic Under-Approximation of Backward Reachable Sets for Uncertain Linear Systems." IEEE Control Systems Letters 6 (2022): 1555–60. http://dx.doi.org/10.1109/lcsys.2021.3123228.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Park, Jaeyong, Arda Kurt, and Ümit Özgüner. "Hybrid Systems Modeling and Reachability-Based Controller Design Methods for Vehicular Automation." Unmanned Systems 02, no. 02 (April 2014): 101–19. http://dx.doi.org/10.1142/s2301385014500071.

Full text
Abstract:
In this study, applicability of verification and correct-by-design hybrid systems modeling and reachability-based controllers for vehicular automation are investigated. Two perspectives in hybrid systems modeling will be introduced, and then reachability analysis techniques will be developed to compute exact reachable sets from a specified unsafe set. Using level set methods, a Hamilton–Jacobi–Isaacs equation is derived whose solutions describe the boundaries of the finite time backward reachable set, which will be manipulated to design a safe controller that guarantees the safety of a given system. An automated longitudinal controller with a fully integrated collision avoidance functionality will be designed as a hybrid system and validated through simulations with a number of different scenarios in order to illustrate the potential of verification methods in automated vehicles.
APA, Harvard, Vancouver, ISO, and other styles
5

Edelkamp, Stefan, Peter Kissmann, and Martha Rohte. "Symbolic and Explicit Search Hybrid through Perfect Hash Functions — A Case Study in Connect Four." Proceedings of the International Conference on Automated Planning and Scheduling 24 (May 10, 2014): 101–10. http://dx.doi.org/10.1609/icaps.v24i1.13637.

Full text
Abstract:
This work combines recent advances in AI planning under memory limitation, namely bitvector and symbolic search. Bitvector search assumes a bijective mapping between state and memory addresses, while symbolic search compactly represents state sets. The memory requirements vary with the structure of the problem to be solved. The integration of the two algorithms into one hybrid algorithm for strongly solving general games initiates a BDD-based solving algorithm, which consists of a forward computation of the reachable state set, possibly followed by a layered backward retrograde analysis. If the main memory becomes exhausted, it switches to explicit-state two-bit retrograde search. We use the classical game of Connect Four as a case study, and solve some instances of the problem space-efficiently with the proposed hybrid search algorithm.
APA, Harvard, Vancouver, ISO, and other styles
6

Fisher, Colby K., Ming Pan, and Eric F. Wood. "Spatiotemporal assimilation–interpolation of discharge records through inverse streamflow routing." Hydrology and Earth System Sciences 24, no. 1 (January 21, 2020): 293–305. http://dx.doi.org/10.5194/hess-24-293-2020.

Full text
Abstract:
Abstract. Poorly monitored river flows in many regions of the world have been hindering our ability to accurately estimate global water budgets as well as the variability of the global water cycle. In situ gauging sites, as well as a number of satellite-based systems, make observations of river discharge throughout the globe; however, these observations are often sparse due to, for example, the sampling frequencies of sensors or a lack of reporting. Recently, efforts have been made to develop methods to integrate these discrete observations to gain a better understanding of the underlying processes. This paper presents an application of a fixed interval Kalman smoother-based model, called inverse streamflow routing (ISR), to generate spatially and temporally continuous river discharge fields from discrete observations. The method propagates the observed information across all reachable parts of the river network (up/downstream from gauging point) and all reachable times (before/after observation time) using a two-sweep procedure that first propagates information backward in time to the furthest upstream locations (inverse routing) and then propagates it forward in time to the furthest downstream locations (forward routing). The ISR methodology advances prediction of streamflow in ungauged basins by accounting for a physical representation of the river system that is not generally handled explicitly in more-commonly applied statistically based models. The key advantages of this approach are that it (1) maintains all the physical consistencies embodied by a diffusive wave routing model (flow confluence relationships on the river network and the resulting mass balance, wave velocity, and diffusivity), (2) updates the lateral influx (runoff) at the pixel level (furthest upstream) to guarantee exhaustive propagation of observed information, and (3) works both with a first guess of initial river discharge conditions from a routing model (assimilation) and without a first guess (pure interpolation of observations). Two sets of experiments are carried out under idealized conditions and under real-world conditions provided by United States Geological Survey (USGS) observations. Results show that the method can effectively reproduce the spatial and temporal dynamics of river discharge in each of the experiments presented. The performance is driven by the density of the gauge network as well as the quality of the data being assimilated. We find that when assimilating the actual USGS observations, the performance decreases relative to our idealized scenario; however, we are still able to produce an improved discharge product at each validation site. With further testing, as well as global application, ISR may prove to be a useful method for extending our current network of global river discharge observations.
APA, Harvard, Vancouver, ISO, and other styles
7

Trinh, H., Phan T. Nam, Pubudu N. Pathirana, and H. P. Le. "On backwards and forwards reachable sets bounding for perturbed time-delay systems." Applied Mathematics and Computation 269 (October 2015): 664–73. http://dx.doi.org/10.1016/j.amc.2015.07.116.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Moon, Jun. "Backward reachability approach to state-constrained stochastic optimal control problem for jump-diffusion models." Advances in Continuous and Discrete Models 2022, no. 1 (December 8, 2022). http://dx.doi.org/10.1186/s13662-022-03747-z.

Full text
Abstract:
AbstractIn this paper, we consider the stochastic optimal control problem for jump-diffusion models with state constraints. In general, the value function of such problems is the discontinuous viscosity solution of the associated Hamilton-Jacobi-Bellman (HJB) equation since the regularity cannot be guaranteed at the boundary of the state constraint. By adapting the stochastic target theory, we obtain an equivalent representation of the original value function by means of the backward reachable set. We then show that this backward reachable can be characterized by the zero-level set of the auxiliary value function for the unconstrained stochastic control problem, which includes two additional unbounded controls as a consequence of the martingale representation theorem. We prove that the auxiliary value function is the unique continuous viscosity solution of the associated HJB equation, which is the second-order nonlinear partial integro-differential equation (PIDE). Our paper provides an explicit way to characterize the original (possibly discontinuous) value function as a zero-level set of the continuous solution of the auxiliary HJB equation. The proof of the existence and uniqueness requires a new technique due to the unbounded control sets and the presence of the singularity of the corresponding Lévy measure in the nonlocal operator of the HJB equation.
APA, Harvard, Vancouver, ISO, and other styles
9

Köcher, Chris. "Reachability Problems on Reliable and Lossy Queue Automata." Theory of Computing Systems, June 19, 2021. http://dx.doi.org/10.1007/s00224-021-10031-2.

Full text
Abstract:
AbstractWe study the reachability problem for queue automata and lossy queue automata. Concretely, we consider the set of queue contents which are forwards resp. backwards reachable from a given set of queue contents. Here, we prove the preservation of regularity if the queue automaton loops through some special sets of transformation sequences. This is a generalization of the results by Boigelot et al. and Abdulla et al. regarding queue automata looping through a single sequence of transformations. We also prove that our construction is possible in polynomial time.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Backward Reachable Sets"

1

Xue, Bai, Zhikun She, and Arvind Easwaran. "Under-Approximating Backward Reachable Sets by Polytopes." In Computer Aided Verification, 457–76. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-41528-4_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Backward Reachable Sets"

1

Han, Dongkun, Albert Rizaldi, Ahmed El-Guindy, and Matthias Althoff. "On enlarging backward reachable sets via Zonotopic set membership." In 2016 IEEE International Symposium on Intelligent Control (ISIC). IEEE, 2016. http://dx.doi.org/10.1109/isic.2016.7579990.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Liu, Zexiang, and Necmiye Ozay. "On the Convergence of the Backward Reachable Sets of Robust Controlled Invariant Sets For Discrete-time Linear Systems." In 2022 IEEE 61st Conference on Decision and Control (CDC). IEEE, 2022. http://dx.doi.org/10.1109/cdc51059.2022.9993110.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chakrabarty, Ankush, Arvind Raghunathan, Stefano Di Cairano, and Claus Danielson. "Data-Driven Estimation of Backward Reachable and Invariant Sets for Unmodeled Systems via Active Learning." In 2018 IEEE Conference on Decision and Control (CDC). IEEE, 2018. http://dx.doi.org/10.1109/cdc.2018.8619646.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lee, Myoung Hoon, Jae Hwa Lee, and Jun Moon. "A Characterization of Backward Reachable Sets for Nonlinear Dynamical Systems via the Pseudospectral Legendre Method." In 2019 18th European Control Conference (ECC). IEEE, 2019. http://dx.doi.org/10.23919/ecc.2019.8795886.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kojchev, Stefan, Ankit Gupta, Robert Hult, and Jonas Fredriksson. "An iterative algorithm for volume maximization of N-step backward reachable sets for constrained linear time-varying systems." In 2021 60th IEEE Conference on Decision and Control (CDC). IEEE, 2021. http://dx.doi.org/10.1109/cdc45484.2021.9683221.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Persson, Linnea, and Bo Wahlberg. "Verification of Cooperative Maneuvers in FlightGear using MPC and Backwards Reachable Sets." In 2018 17th European Control Conference (ECC). IEEE, 2018. http://dx.doi.org/10.23919/ecc.2018.8550247.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography