H∞ Controller design for spectral MIMO models by convex optimization

A new method for robust fixed-order H_∞ controller design by convex optimization for multivariable systems is investigated. Linear Time-Invariant Multi-Input Multi-Output (LTI-MIMO) systems represented by a set of complex values in the frequency domain are considered. It is shown that the Generalized Nyquist Stability criterion can be approximated by a set of convex constraints with respect to the parameters of a multivariable linearly parameterized controller in the Nyquist diagram. The diagonal elements of the controller are tuned to satisfy the desired performances, while simultaneously, the off-diagonal elements are designed to decouple the system. Multimodel uncertainty can be directly considered in the proposed approach by increasing the number of constraints. The simulation examples illustrate the effectiveness of the proposed approach.     

An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints

A table constraint is explicitly represented as its set of solutions or non-solutions. This ad hoc (or extensional) representation may require space exponential to the arity of the constraint, making enforcing GAC expensive. In this paper, we address the space and time inefficiencies simultaneously by presenting the mddc constraint. mddc is a global constraint that represents its (non-)solutions with a multi-valued decision diagram (MDD). The MDD-based representation has the advantage that it can be exponentially smaller than a table. The associated GAC algorithm (called mddc) has time complexity linear to the size of the MDD, and achieves full incrementality in constant time. In addition, we show how to convert a positive or negative table constraint into an mddc constraint in time linear to the size of the table. Our experiments on structured problems, car sequencing and still-life, show that mddc is also a fast GAC algorithm for some global constraints such as sequence and regular. We also show that mddc is faster than the state-of-the-art generic GAC algorithms in Gent et al. (2007), Lecoutre and Szymanek (2006), Lhomme and Régin (2005) for table constraint.     

Modelling water dynamics with DNDC and DAISY in a soil of the North China Plain: A comparative study

The performance of the DNDC and Daisy model to simulate the water dynamics in a floodplain soil of the North China Plain was tested and compared. While the DNDC model uses a simple cascade approach, the Daisy model applies the physically based Richard's equation for simulating water movement in soil. For model testing a three years record of the soil water content from the Dong Bei Wang experimental station near Beijing was used. There, the effect of nitrogen fertilization, irrigation and straw removal on soil water and nitrogen dynamics was investigated in a three factorial field experiment applying a split-split-plot design with 4 replications. The dataset of one treatment was used for model testing and calibration. Two other independent datasets from further treatments were employed for validating the models. For both models, the simulation results were not satisfying using default parameters. After parameter optimisation and the use of site-specific van Genuchten parameters, however, the Daisy model performed well. But, for the DNDC model, parameter optimisation failed to improve the simulation result. Owing to the fact that many biological processes such as plant growth, nitrification or denitrification depend strongly on the soil water content, our findings bring us to the conclusion that the site-specific suitability of the DNDC model for simulating the soil water dynamics should be tested before further simulation of other processes.     

Robust anti-sliding control of autonomous vehicles in presence of lateral disturbances

Path following control problem of autonomous vehicles is investigated, concerning both unmeasurable sliding effects and lateral disturbances which lead to some difficulties in designing autonomous control under complex environment. To deal with the sliding effects, sideslip angles are modeled and reconstructed by estimating the tire cornering stiffness, which plays important role in analyzing the sliding effects. To this end, a Luenberger-type observer is designed, which is able to identify the tire cornering stiffness adaptively even in presence of time-varying lateral disturbances. Furthermore, to guarantee high-precision guidance, a sliding mode controller is designed based on chained system theory, and this controller is shown to be robust to both the lateral disturbances and the inaccuracy of the sliding reconstruction. Simulations illustrate that the proposed methods can reconstruct the sliding angles and provide high-accuracy anti-sliding control even in presence of the time-varying lateral disturbances.     

A dialectical based model coherent with inventive and optimization problems

In an array of problem solving methods, one can traditionally distinguish two kinds of problems: one is a problem that has solutions in a search space and the other is a problem that does not have solutions in a given space. The later problem so called solutionless problem or inventive problem requires an inventive approach to reformulate the problem and dialectical thinking brings benefits in the process. The framework used to formulate problems in a dialectical approach is contradiction. Identification of contradictions plays an important role in distinguishing solutionless problems: a contradiction exists when no solution can be found, and a solution exists when no contradiction can be found. In this article, the inadequacy of existing frameworks in satisfying this requirement is demonstrated and a framework that fits this requirement is proposed.     

Integrated Data Management for a Fleet of Search‐and‐rescue Robots

Search‐and‐rescue operations have recently been confronted with the introduction of robotic tools that assist the human search‐and‐rescue workers in their dangerous but life‐saving job of searching for human survivors after major catastrophes. However, the world of search and rescue is highly reliant on strict procedures for the transfer of messages, alarms, data, and command and control over the deployed assets. The introduction of robotic tools into this world causes an important structural change in this procedural toolchain. Moreover, the introduction of search‐and‐rescue robots acting as data gatherers could potentially lead to an information overload toward the human search‐and‐rescue workers, if the data acquired by these robotic tools are not managed in an intelligent way. With that in mind, we present in this paper an integrated data combination and data management architecture that is able to accommodate real‐time data gathered by a fleet of robotic vehicles on a crisis site, and we present and publish these data in a way that is easy to understand by end‐users. In the scope of this paper, a fleet of unmanned ground and aerial search‐and‐rescue vehicles is considered, developed within the scope of the European ICARUS project. As a first step toward the integrated data‐management methodology, the different robotic systems require an interoperable framework in order to pass data from one to another and toward the unified command and control station. As a second step, a data fusion methodology will be presented, combining the data acquired by the different heterogenic robotic systems. The computation needed for this process is done in a novel mobile data center and then (as a third step) published in a software as a service (SaaS) model. The SaaS model helps in providing access to robotic data over ubiquitous Ethernet connections. As a final step, we show how the presented data‐management architecture allows for reusing recorded exercises with real robots and rescue teams for training purposes and teaching search‐and‐rescue personnel how to handle the different robotic tools. The system was validated in two experiments. First, in the controlled environment of a military testing base, a fleet of unmanned ground and aerial vehicles was deployed in an earthquake‐response scenario. The data gathered by the different interoperable robotic systems were combined by a novel mobile data center and presented to the end‐user public. Second, an unmanned aerial system was deployed on an actual mission with an international relief team to help with the relief operations after major flooding in Bosnia in the spring of 2014. Due to the nature of the event (floods), no ground vehicles were deployed here, but all data acquired by the aerial system (mainly three‐dimensional maps) were stored in the ICARUS data center, where they were securely published for authorized personnel all over the world. This mission (which is, to our knowledge, the first recorded deployment of an unmanned aerial system by an official governmental international search‐and‐rescue team in another country) proved also the concept of the procedural integration of the ICARUS data management system into the existing procedural toolchain of the search and rescue workers, and this in an international context (deployment from Belgium to Bosnia). The feedback received from the search‐and‐rescue personnel on both validation exercises was highly positive, proving that the ICARUS data management system can efficiently increase the situational awareness of the search‐and‐rescue personnel.     

Adaptive continuous‐space informative path planning for online environmental monitoring

Autonomous mobile robots are increasingly employed to take measurements for environmental monitoring, but planning informative, measurement‐rich paths through large three‐dimensional environments is still challenging. Designing such paths, known as the informative path planning (IPP) problem, has been shown to be NP‐hard. Existing algorithms focus on providing guarantees on suboptimal solutions, but do not scale well to large problems. In this paper, we introduce a novel IPP algorithm that uses an evolutionary strategy to optimize a parameterized path in continuous space, which is subject to various constraints regarding path budgets and motion capabilities of an autonomous mobile robot. Moreover, we introduce a replanning scheme to adapt the planned paths according to the measurements taken in situ during data collection. When compared to two state‐of‐the‐art solutions, our method provides competitive results at significantly lower computation times and memory requirements. The proposed replanning scheme enables to build models with up to 25% lower uncertainty within an initially unknown area of interest. Besides presenting theoretical results, we tailored the proposed algorithms for data collection using an autonomous surface vessel for an ecological study, during which the method was validated through three field deployments on Lake Zurich, Switzerland. Spatiotemporal variations are shown over a period of three months and in an area of 350 m × 350 m × 13 m. Whereas our theoretical solution can be applied to multiple applications, our field results specifically highlight the effectiveness of our planner for monitoring toxic microorganisms in a pre‐alpine lake, and for identifying hot‐spots within their distribution.     

Computational performance of a parallelized three-dimensional high-order spectral element toolbox

In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance evaluation of several aspects with a particular emphasis on the parallel efficiency. The performance evaluation is analyzed with the help of a time prediction model based on a parameterization of the application and the hardware resources. Two tailor-made benchmark cases in computational fluid dynamics (CFD) are introduced and used to carry out this review, stressing the particular interest for clusters with up to thousands of cores. Some problems in the parallel implementation have been detected and corrected. The theoretical complexities with respect to the number of elements, to the polynomial degree, and to communication needs are correctly reproduced. It is concluded that this type of code has a nearly perfect speedup on machines with thousands of cores, and is ready to make the step to next-generation petaFLOP machines.     

Parametric Sequence Alignment with Constraints

Approximate matching techniques based on string alignment are important tools for investigating similarities between strings, such as those representing DNA and protein sequences. We propose a constraint based approach for parametric sequence alignment which allows for more general string alignment queries where the alignment cost can itself be parameterized as a query with some initial constraints. Thus, the costs need not be fixed in a parametric alignment query unlike the case in normal alignment. The basic dynamic programming string edit distance algorithm is generalized to a naive algorithm which uses inequalities to represent the alignment score. The naive algorithm is rather costly and the remainder of the paper develops an improvement which prunes alternatives where it can and approximates the alternatives otherwise. This reduces the number of inequalities significantly and strengthens the constraint representation with equalities. We present some preliminary results using parametric alignment on some general alignment queries.