Bibliografie tematiche / Forward reachable set

Indice

Articoli di riviste
Tesi
Capitoli di libri
Atti di convegni

Letteratura scientifica selezionata sul tema "Forward reachable set"

Autore: Grafiati

Pubblicato: 4 giugno 2021

Ultima modifica: 1 febbraio 2022

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Forward reachable set".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Articoli di riviste sul tema "Forward reachable set"

Feng, Xuhui, Mario E. Villanueva e Boris Houska. "Backward-forward reachable set splitting for state-constrained differential games". Automatica 111 (gennaio 2020): 108602. http://dx.doi.org/10.1016/j.automatica.2019.108602.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Sun, Gengxin, e Chih-Cheng Chen. "Influence Maximization Algorithm Based on Reverse Reachable Set". Mathematical Problems in Engineering 2021 (27 luglio 2021): 1–12. http://dx.doi.org/10.1155/2021/5535843.

Testo completo

Abstract (sommario):

Most of the existing influence maximization algorithms are not suitable for large-scale social networks due to their high time complexity or limited influence propagation range. Therefore, a D-RIS (dynamic-reverse reachable set) influence maximization algorithm is proposed based on the independent cascade model and combined with the reverse reachable set sampling. Under the premise that the influence propagation function satisfies monotonicity and submodularity, the D-RIS algorithm uses an automatic debugging method to determine the critical value of the number of reverse reachable sets, which not only obtains a better influence propagation range but also greatly reduces the time complexity. The experimental results on the two real datasets of Slashdot and Epinions show that D-RIS algorithm is close to the CELF (cost-effective lazy-forward) algorithm and higher than RIS algorithm, HighDegree algorithm, LIR algorithm, and pBmH (population-based metaheuristics) algorithm in influence propagation range. At the same time, it is significantly better than the CELF algorithm and RIS algorithm in running time, which indicates that D-RIS algorithm is more suitable for large-scale social network.

Gli stili APA, Harvard, Vancouver, ISO e altri

Limpiyamitr, Akarawit, e Yoshito Ohta. "On the Approximation of Maximal Output Admissible Set and Reachable Set via Forward Euler Discretization". IFAC Proceedings Volumes 37, n. 11 (luglio 2004): 395–400. http://dx.doi.org/10.1016/s1474-6670(17)31643-9.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Kim, Suseong, Davide Falanga e Davide Scaramuzza. "Computing the Forward Reachable Set for a Multirotor Under First-Order Aerodynamic Effects". IEEE Robotics and Automation Letters 3, n. 4 (ottobre 2018): 2934–41. http://dx.doi.org/10.1109/lra.2018.2848302.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Jones, Morgan, e Matthew M. Peet. "Using SOS and Sublevel Set Volume Minimization for Estimation of Forward Reachable Sets". IFAC-PapersOnLine 52, n. 16 (2019): 484–89. http://dx.doi.org/10.1016/j.ifacol.2019.12.008.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Rad, Ciprian, Calin Rusu e Radu Balan. "Kinematics Investigation, Workspace Analysis and Actuators Design for a 2-DOF Redundant Parallel Robot". Solid State Phenomena 166-167 (settembre 2010): 333–38. http://dx.doi.org/10.4028/www.scientific.net/ssp.166-167.333.

Testo completo

Abstract (sommario):

This paper discusses the inverse and forward kinematics problem for a 2-dof parallel robot with actuator redundancy. The reachable workspace of the robot is generated for a set of parameters and a solution for the actuators is proposed in the final.

Gli stili APA, Harvard, Vancouver, ISO e altri

ARMBRUSTER, BENJAMIN, LI WANG e MARTINA MORRIS. "Forward reachable sets: Analytically derived properties of connected components for dynamic networks". Network Science 5, n. 3 (29 giugno 2017): 328–54. http://dx.doi.org/10.1017/nws.2017.10.

Testo completo

Abstract (sommario):

AbstractFormal analysis of the emergent structural properties of dynamic networks is largely uncharted territory. We focus here on the properties of forward reachable sets (FRS) as a function of the underlying degree distribution and edge duration. FRS are defined as the set of nodes that can be reached from an initial seed via a path of temporally ordered edges; a natural extension of connected component measures to dynamic networks. Working in a stochastic framework, we derive closed-form expressions for the mean and variance of the exponential growth rate of the FRS for temporal networks with both edge and node dynamics. For networks with node dynamics, we calculate thresholds for the growth of the FRS. The effects of finite population size are explored via simulation and approximation. We examine how these properties vary by edge duration and different cross-sectional degree distributions that characterize a range of scientifically interesting normative outcomes (Poisson and Bernoulli). The size of the forward reachable set gives an upper bound for the epidemic size in disease transmission network models, relating this work to epidemic modeling (Ferguson, 2000; Eames, 2004).

Gli stili APA, Harvard, Vancouver, ISO e altri

Hughes Hallett, Andrew, e Nicola Acocella. "STABILIZATION AND COMMITMENT: FORWARD GUIDANCE IN ECONOMIES WITH RATIONAL EXPECTATIONS". Macroeconomic Dynamics 22, n. 1 (5 aprile 2016): 122–34. http://dx.doi.org/10.1017/s136510051600002x.

Testo completo

Abstract (sommario):

We construct a theory of forward guidance in economic policy making in order to provide a framework for explaining the role and strategic advantages of including forward guidance as an explicit part of policy design. We do this by setting up a general policy problem in which forward guidance plays a role, and then examine the consequences for performance when that guidance is withdrawn. We show that forward guidance provides enhanced controllability and stabilizability—especially where such properties may not otherwise be available. As a by-product, we find that forward guidance limits the scope and incentives for time-inconsistent behavior in an economy whose policy goals are ultimately reachable. It also adds to the credibility of a set of policies.

Gli stili APA, Harvard, Vancouver, ISO e altri

Chun, Seung Su. "Effective Extraction of State Invariant for Software Verification". Applied Mechanics and Materials 752-753 (aprile 2015): 1097–104. http://dx.doi.org/10.4028/www.scientific.net/amm.752-753.1097.

Testo completo

Abstract (sommario):

In software design of complex systems, more time and effort are spent on verification than on constructions. Model checking for software verification techniques offer a large potential to obtain and early integration of verification in the design process. This paper describes how to easily specify and the software properties and to understand the software generating automatically invariant. In this paper deal with issue that state invariant is a property that holds in every reachable state. Not only can be used in understanding and analysis of complex software systems. In addition, it can be used for system verifications such as checking safety, consistency, and completeness. For these reasons, there are many vital researches for deriving state invariant from finite state machine models. In this research was to be considered to extract state invariant. Thus it is likely to be too complex for the user to understand. This paper let the user focus on some interested parts (called scopes) rather than a whole state space in a model. Computation Tree Logic (CTL) is used to specify scopes in which he/she is interested. Given a scope in CTL, forward reachability analysis is used to find out a set of states inside it. Obviously, a set of states calculated in this way is a subset of every reachable state. Keywords: Software verification, Invariant, Scopes, Model Checking

Gli stili APA, Harvard, Vancouver, ISO e altri

Li, Hong Bing, e Ming Wei Wang. "Real-Time Embedded Software Architecture Modeling and Reliability Evaluation Based on Time-Extended Petri Net". Applied Mechanics and Materials 651-653 (settembre 2014): 1888–92. http://dx.doi.org/10.4028/www.scientific.net/amm.651-653.1888.

Testo completo

Abstract (sommario):

Software reliability is one of the most important quality indices in software quality evaluation. Reliability analysis based on software architecture has become a researching hotspot. This paper makes a review on existed architecture-based reliability evaluation models, and puts forward the shortage of these models. As petri net has a good ability of description for concurrency and asynchronism, this paper focuses on the research of petri net model. Transitions are divided into time transitions and instantaneous transitions. Time-related reliability, including time-delay reliability and temporal reliability, are added. Then the reachable state transition matrix is set up and system reliability evaluation proceeds. The method above is used into a avionics embedded software. At last we accomplish the architecture modeling, reliability evaluation, proving the effectiveness and feasibility of this method.

Gli stili APA, Harvard, Vancouver, ISO e altri

Più fonti

Tesi sul tema "Forward reachable set"

Chung, Chern Ferng Mechanical &amp Manufacturing Engineering Faculty of Engineering UNSW. "Reachable sets analysis in the cooperative control of pursuer vehicles". 2008. http://handle.unsw.edu.au/1959.4/41525.

Testo completo

Abstract (sommario):

This thesis is concerned with the Pursuit-and-Evasion (PE) problem where the pursuer aims to minimize the time to capture the evader while the evader tries to prevent capture. In the problem, the evader has two advantages: a higher manoeuvrability and that the pursuer is uncertain about the evader??s state. Cooperation among multiple pursuer vehicles can thus be used to overcome the evader??s advantages. The focus here is on the formulation and development of frameworks and algorithms for cooperation amongst pursuers, aiming at feasible implementation on real and autonomous vehicles. The thesis is split into Parts I and II. Part I considers the problem of capturing an evader of higher manoeuvrability in a deterministic PE game. The approach is the employment of Forward Reachable Set (FRS) analysis in the pursuers?? control. The analysis considers the coverage of the evader??s FRS, which is the set of reachable states at a future time, with the pursuer??s FRS and assumes that the chance of capturing the evader is dependent on the degree of the coverage. Using the union of multiple pursuers?? FRSs intuitively leads to more evader FRS coverage and this forms the mechanism of cooperation. A framework for cooperative control based on the FRS coverage, or FRS-based control, is proposed. Two control algorithms were developed within this framework. Part II additionally introduces the problem of evader state uncertainty due to noise and limited field-of-view of the pursuers?? sensors. A search-and-capture (SAC) problem is the result and a hybrid architecture, which includes multi-sensor estimation using the Particle Filter as well as FRS-based control, is proposed to accomplish the SAC task. The two control algorithms in Part I were tested in simulations against an optimal guidance algorithm. The results show that both algorithms yield a better performance in terms of time and miss distance. The results in Part II demonstrate the effectiveness of the hybrid architecture for the SAC task. The proposed frameworks and algorithms provide insights for the development of effective and more efficient control of pursuer vehicles and can be useful in the practical applications such as defence systems and civil law enforcement.

Gli stili APA, Harvard, Vancouver, ISO e altri

Capitoli di libri sul tema "Forward reachable set"

Bhattacharya, Somak, Samresh Malhotra e S. K. Ghosh. "An Attack Graph Based Approach for Threat Identification of an Enterprise Network". In Cyber Security and Global Information Assurance, 23–47. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-60566-326-5.ch002.

Testo completo

Abstract (sommario):

As networks continue to grow in size and complexity, automatic assessment of the security vulnerability becomes increasingly important. The typical means by which an attacker breaks into a network is through a series of exploits, where each exploit in the series satisfies the pre-condition for subsequent exploits and makes a causal relationship among them. Such a series of exploits constitutes an attack path where the set of all possible attack paths form an attack graph. Attack graphs reveal the threat by enumerating all possible sequences of exploits that can be followed to compromise a given critical resource. The contribution of this chapter is to identify the most probable attack path based on the attack surface measures of the individual hosts for a given network and also identify the minimum possible network securing options for a given attack graph in an automated fashion. The identified network securing options are exhaustive and the proposed approach aims at detecting cycles in forward reachable attack graphs. As a whole, the chapter deals with identification of probable attack path and risk mitigation which may facilitate in improving the overall security of an enterprise network.

Gli stili APA, Harvard, Vancouver, ISO e altri

Atti di convegni sul tema "Forward reachable set"

Kousik, Shreyas, Sean Vaskov, Matthew Johnson-Roberson e Ram Vasudevan. "Safe Trajectory Synthesis for Autonomous Driving in Unforeseen Environments". In ASME 2017 Dynamic Systems and Control Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/dscc2017-5361.

Testo completo

Abstract (sommario):

Path planning for autonomous vehicles in arbitrary environments requires a guarantee of safety, but this can be impractical to ensure in real-time when the vehicle is described with a high-fidelity model. To address this problem, this paper develops a method to perform trajectory design by considering a low-fidelity model that accounts for model mismatch. The presented method begins by computing a conservative Forward Reachable Set (FRS) of a high-fidelity model’s trajectories produced when tracking trajectories of a low-fidelity model over a finite time horizon. At runtime, the vehicle intersects this FRS with obstacles in the environment to eliminate trajectories that can lead to a collision, then selects an optimal plan from the remaining safe set. By bounding the time for this set intersection and subsequent path selection, this paper proves a lower bound for the FRS time horizon and sensing horizon to guarantee safety. This method is demonstrated in simulation using a kinematic Dubin’s car as the low-fidelity model and a dynamic unicycle as the high-fidelity model.

Gli stili APA, Harvard, Vancouver, ISO e altri

Ruan, Wenjie, Xiaowei Huang e Marta Kwiatkowska. "Reachability Analysis of Deep Neural Networks with Provable Guarantees". In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/368.

Testo completo

Abstract (sommario):

Verifying correctness for deep neural networks (DNNs) is challenging. We study a generic reachability problem for feed-forward DNNs which, for a given set of inputs to the network and a Lipschitz-continuous function over its outputs computes the lower and upper bound on the function values. Because the network and the function are Lipschitz continuous, all values in the interval between the lower and upper bound are reachable. We show how to obtain the safety verification problem, the output range analysis problem and a robustness measure by instantiating the reachability problem. We present a novel algorithm based on adaptive nested optimisation to solve the reachability problem. The technique has been implemented and evaluated on a range of DNNs, demonstrating its efficiency, scalability and ability to handle a broader class of networks than state-of-the-art verification approaches.

Gli stili APA, Harvard, Vancouver, ISO e altri

Tisdale, John, e J. Karl Hedrick. "A UAV Trajectory Planning Algorithm for Simultaneous Search and Track". In ASME 2005 International Mechanical Engineering Congress and Exposition. ASMEDC, 2005. http://dx.doi.org/10.1115/imece2005-81100.

Testo completo

Abstract (sommario):

This paper considers trajectories for an unmanned aerial vehicle (UAV) that must search an area while tracking a target. The UAV has a constrained turn rate and a constant velocity; it is assumed that there are certain areas of interest that have a higher search value than others. An algorithm is presented that seeks to maximize the value of the area searched while still maintaining the track. The problem is discretized in both time and the control; the motion of the UAV is constrained to the reachability graph, a subset of the forward reachable set. At each revisit, the target path is estimated for the next revisit. A heuristic method is used to determine the best UAV path, because the target path is not known a priori. Feasible paths are found by examining the terminating vertices of the reachability graph. A cooperative implementation, for a team of UAVs patrolling the same region, is developed. Simulation indicates the feasibility of the method for a real-time implementation. Trajectories for example scenarios are presented and discussed.

Gli stili APA, Harvard, Vancouver, ISO e altri

Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!