159 research outputs found
LIPIcs, Volume 251, ITCS 2023, Complete Volume
LIPIcs, Volume 251, ITCS 2023, Complete Volum
Aerial Drone-based System for Wildfire Monitoring and Suppression
Wildfire, also known as forest fire or bushfire, being an uncontrolled fire crossing an area of combustible vegetation, has become an inherent natural feature of the landscape in many regions of the world. From local to global scales, wildfire has caused substantial social, economic and environmental consequences. Given the hazardous nature of wildfire, developing automated and safe means to monitor and fight the wildfire is of special interest. Unmanned aerial vehicles (UAVs), equipped with appropriate sensors and fire retardants, are available to remotely monitor and fight the area undergoing wildfires, thus helping fire brigades in mitigating the influence of wildfires. This thesis is dedicated to utilizing UAVs to provide automated surveillance, tracking and fire suppression services on an active wildfire event. Considering the requirement of collecting the latest information of a region prone to wildfires, we presented a strategy to deploy the estimated minimum number of UAVs over the target space with nonuniform importance, such that they can persistently monitor the target space to provide a complete area coverage whilst keeping a desired frequency of visits to areas of interest within a predefined time period. Considering the existence of occlusions on partial segments of the sensed wildfire boundary, we processed both contour and flame surface features of wildfires with a proposed numerical algorithm to quickly estimate the occluded wildfire boundary. To provide real-time situational awareness of the propagated wildfire boundary, according to the prior knowledge of the whole wildfire boundary is available or not, we used the principle of vector field to design a model-based guidance law and a model-free guidance law. The former is derived from the radial basis function approximated wildfire boundary while the later is based on the distance between the UAV and the sensed wildfire boundary. Both vector field based guidance laws can drive the UAV to converge to and patrol along the dynamic wildfire boundary. To effectively mitigate the impacts of wildfires, we analyzed the advancement based activeness of the wildfire boundary with a signal prominence based algorithm, and designed a preferential firefighting strategy to guide the UAV to suppress fires along the highly active segments of the wildfire boundary
LIPIcs, Volume 261, ICALP 2023, Complete Volume
LIPIcs, Volume 261, ICALP 2023, Complete Volum
IASCAR: Incremental Answer Set Counting by Anytime Refinement
Answer set programming (ASP) is a popular declarative programming paradigm
with various applications. Programs can easily have many answer sets that
cannot be enumerated in practice, but counting still allows quantifying
solution spaces. If one counts under assumptions on literals, one obtains a
tool to comprehend parts of the solution space, so-called answer set
navigation. However, navigating through parts of the solution space requires
counting many times, which is expensive in theory. Knowledge compilation
compiles instances into representations on which counting works in polynomial
time. However, these techniques exist only for CNF formulas, and compiling ASP
programs into CNF formulas can introduce an exponential overhead. This paper
introduces a technique to iteratively count answer sets under assumptions on
knowledge compilations of CNFs that encode supported models. Our anytime
technique uses the inclusion-exclusion principle to improve bounds by over- and
undercounting systematically. In a preliminary empirical analysis, we
demonstrate promising results. After compiling the input (offline phase), our
approach quickly (re)counts.Comment: Under consideration in Theory and Practice of Logic Programming
(TPLP
Deep learning applied to computational mechanics: A comprehensive review, state of the art, and the classics
Three recent breakthroughs due to AI in arts and science serve as motivation:
An award winning digital image, protein folding, fast matrix multiplication.
Many recent developments in artificial neural networks, particularly deep
learning (DL), applied and relevant to computational mechanics (solid, fluids,
finite-element technology) are reviewed in detail. Both hybrid and pure machine
learning (ML) methods are discussed. Hybrid methods combine traditional PDE
discretizations with ML methods either (1) to help model complex nonlinear
constitutive relations, (2) to nonlinearly reduce the model order for efficient
simulation (turbulence), or (3) to accelerate the simulation by predicting
certain components in the traditional integration methods. Here, methods (1)
and (2) relied on Long-Short-Term Memory (LSTM) architecture, with method (3)
relying on convolutional neural networks. Pure ML methods to solve (nonlinear)
PDEs are represented by Physics-Informed Neural network (PINN) methods, which
could be combined with attention mechanism to address discontinuous solutions.
Both LSTM and attention architectures, together with modern and generalized
classic optimizers to include stochasticity for DL networks, are extensively
reviewed. Kernel machines, including Gaussian processes, are provided to
sufficient depth for more advanced works such as shallow networks with infinite
width. Not only addressing experts, readers are assumed familiar with
computational mechanics, but not with DL, whose concepts and applications are
built up from the basics, aiming at bringing first-time learners quickly to the
forefront of research. History and limitations of AI are recounted and
discussed, with particular attention at pointing out misstatements or
misconceptions of the classics, even in well-known references. Positioning and
pointing control of a large-deformable beam is given as an example.Comment: 275 pages, 158 figures. Appeared online on 2023.03.01 at
CMES-Computer Modeling in Engineering & Science
Recommended from our members
A Digital Twin Framework for Production Planning Optimization: Applications for Make-To-Order Manufacturers
In this dissertation, we develop a Digital Twin framework for manufacturing systems and apply it to various production planning and scheduling problems faced by Make-To-Order (MTO) firms. While this framework can be used to digitally represent a particular manufacturing environment with high fidelity, our focus is in using it to generate realistic settings to test production planning and scheduling algorithms in practice. These algorithms have traditionally been tested by either translating a practical situation into the necessary modeling constructs, without discussion of the assumptions and inaccuracies underlying this translation, or by generating random instances of the modeling constructs, without assessing the limitations in accurately representing production environments. The consequence has been a serious gap between theory advancement and industry practice. The major goal of this dissertation is to develop a framework that allows for practical testing, evaluation, and implementation of new approaches for seamless industry adoption. We develop this framework as a modular software package and emphasize the practicality and configurability of the framework, such that minimal modelling effort is required to apply the framework to a multitude of optimization problems and manufacturing systems. Throughout this dissertation, we emphasize the importance of the underlying scheduling problems which provide the basis for additional operational decision making. We focus on the computational evaluation and comparisons of various modeling choices within the developed frameworks, with the objective of identifying models which are both effective and computationally efficient. In Part 1 of this dissertation, we consider a class of Production Planning and Execution problems faced by job shop manufacturing systems. In Part 2 of this dissertation, we consider a class of scheduling problems faced by manufacturers whose production system is dominated by a single operation
Parameterised Counting in Logspace
Logarithmic space-bounded complexity classes such as L and NL play a central role in space-bounded computation. The study of counting versions of these complexity classes have lead to several interesting insights into the structure of computational problems such as computing the determinant and counting paths in directed acyclic graphs. Though parameterised complexity theory was initiated roughly three decades ago by Downey and Fellows, a satisfactory study of parameterised logarithmic space-bounded computation was developed only in the last decade by Elberfeld, Stockhusen and Tantau (IPEC 2013, Algorithmica 2015). In this paper, we introduce a new framework for parameterised counting in logspace, inspired by the parameterised space-bounded models developed by Elberfeld, Stockhusen and Tantau. They defined the operators paraW and paraβ for parameterised space complexity classes by allowing bounded nondeterminism with multiple-read and read-once access, respectively. Using these operators, they characterised the parameterised complexity of natural problems on graphs. In the spirit of the operators paraW and paraβ by Stockhusen and Tantau, we introduce variants based on tail-nondeterminism, paraW[1] and paraβtail. Then, we consider counting versions of all four operators and apply them to the class L. We obtain several natural complete problems for the resulting classes: counting of paths in digraphs, counting first-order models for formulas, and counting graph homomorphisms. Furthermore, we show that the complexity of a parameterised variant of the determinant function for (0, 1)-matrices is # paraβtailL-hard and can be written as the difference of two functions in # paraβtailL. These problems exhibit the richness of the introduced counting classes. Our results further indicate interesting structural characteristics of these classes. For example, we show that the closure of # paraβtailL under parameterised logspace parsimonious reductions coincides with # paraβL. In other words, in the setting of read-once access to nondeterministic bits, tail-nondeterminism coincides with unbounded nondeterminism modulo parameterised reductions. Initiating the study of closure properties of these parameterised logspace counting classes, we show that all introduced classes are closed under addition and multiplication, and those without tail-nondeterminism are closed under parameterised logspace parsimonious reductions. Finally, we want to emphasise the significance of this topic by providing a promising outlook highlighting several open problems and directions for further research
Computer Aided Verification
This open access two-volume set LNCS 13371 and 13372 constitutes the refereed proceedings of the 34rd International Conference on Computer Aided Verification, CAV 2022, which was held in Haifa, Israel, in August 2022. The 40 full papers presented together with 9 tool papers and 2 case studies were carefully reviewed and selected from 209 submissions. The papers were organized in the following topical sections: Part I: Invited papers; formal methods for probabilistic programs; formal methods for neural networks; software Verification and model checking; hyperproperties and security; formal methods for hardware, cyber-physical, and hybrid systems. Part II: Probabilistic techniques; automata and logic; deductive verification and decision procedures; machine learning; synthesis and concurrency. This is an open access book
- …