The miniaturization of electronics, computers and sensors has created new opportunities for remote sensing applications. Despite the current restrictions on regulation, the use of unmanned aerial vehicles equipped with small thermal, laser or spectral sensors has emerged as a promising alternative for assisting modeling, mapping and monitoring applications in rangelands, forests and agricultural environments. This review provides an overview of recent research that has reported UAV flight experiments on the remote sensing of vegetated areas. To provide a differential trend to other reviews, this paper is not limited to crops and precision agriculture applications, but also includes forest and rangeland applications. This work follows a top-down categorization strategy and attempts to fill the gap between application requirements and the characteristics of selected tools, payloads and platforms. Furthermore, correlations between common requirements and the most frequently used solutions are highlighted.
This paper presents a novel analysis approach for bounded Petri nets. The net behavior is modeled by boolean functions, thus reducing reasoning about Petri nets to boolean calculation. The state explosion problem is managed by using Binary Decision Diagrams (BDDs), which are capable to represent large sets of markings in small data structures.The ability o f P etri nets to model systems, the exibility and generality of boolean algebras, and the e cient implementation of BDDs, provide a general environment to handle a large variety of problems. Examples are presented that show h o w all the reachable states (10 18 ) o f a P etri net can be e ciently calculated and represented with a small BDD (10 3 nodes). Properties requiring an exhaustive analysis of the state space can be veri ed in polynomial time in the size of the BDD. ? Supported by CYCIT TIC 91-1036 and Dept. d'Ensenyament de la Generalitat de CatalunyaPastor, E. [et al.]. Petri net analysis using boolean manipulation. Commutative Laws: a + b = b + a a b = b a 2. Distributive Laws: a + ( b c) = ( a + b) (a + c) a (b + c) = ( a b) + ( a c) 3. Identities: a + 0 = a a 1 = a 4. Complement. 8a 2 B 9a 0 2 B s u c h t h a t : a + a 0 = 1 a a 0 = 0As it is well known, the system (f0 1g + 0 1) , with + and de ned as the logic OR and logic AND operations respectively, is a boolean algebra (also known as the switching algebra). From now on, and since we will limit our scope to logic functions, w e w i l l a l w ays assume that B = f0 1g.
Opening the sky to new classes of airspace user is a political and economic imperative for the European Union. Drone industries have a significant potential for economical growth according to the latest estimations. To enable this growth safely and efficiently, the CORUS project has developed a concept of operations for drones flying in Europe in very low-level airspace, which they have to share that space with manned aviation, and quite soon with urban air mobility aircraft as well. U-space services and the development of smart, automated, interoperable, and sustainable traffic management solutions are presented as the key enabler for achieving this high level of integration. In this paper, we present the U-space concept of operations (ConOps), produced around three new types of airspace volume, called X, Y, and Z, and the relevant U-space services that will need to be supplied in each of these. The paper also describes the reference high-level U-space architecture using the European air traffic management architecture methodology. Finally, the paper proposes the basis for the aircraft separation standards applicable by each volume, to be used by the conflict detection and resolution services of U-space.
This paper presents a methodology for the veri cation of speed-independent asynchronous circuits against a Petri net speci cation. The technique is based on symbolic reachability analysis, modeling both the speci cation and the gate-level network behavior by m e a n s of boolean functions. These functions are e ciently handled by u s i n g Binary Decision Diagrams. Algorithms for verifying the correctness of designs, as well as several circuit properties are proposed. Finally, t h e applicability o f o u r v eri cation method has been proven by c hecking the correctness of di erent b e n c hmarks. ? Work supported by CYCIT TIC 94-0531-E and Departament d'Ensenyament d e l a Generalitat de Catalunya.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.