Pose consensus in networks of heterogeneous robots with variable time delays

This paper proposes a novel pose (position and orientation) consensus controller for networks of heterogeneous robots modeled in the operational space. The proposed controller is a distributed proportional plus damping scheme that, with a slight modification, solves both the leader–follower and leaderless consensus problems. A singularity‐free representation, unit quaternion, is used to describe the robots orientation, and the network is represented by an undirected and connected interconnection graph. Furthermore, it is shown that the controller is robust to interconnection variable time delays. Experiments with a network of two 6‐degrees‐of‐freedom robots are presented to illustrate the performance of the proposed scheme. Copyright © 2014 John Wiley & Sons, Ltd.     

A two‐step control approach for docking of autonomous underwater vehicles

This paper presents a novel integrated guidance and control strategy for docking of autonomous underwater vehicles. The approach to the base, and hence the control design, is divided in two steps: (i) in the first, at higher speed, the vehicle dynamics is assumed to be underactuated, and an appropriate control law is derived to steer the vehicle towards the final docking path, achieving convergence to zero of the appropriate error variables for almost all initial conditions; (ii) in the second stage, at low speed, the vehicle is assumed to be fully actuated, and a robust control law is designed that achieves convergence to zero of the appropriate error variables for all initial conditions, in the presence of parametric model uncertainty. Simulations are presented illustrating the performance of the proposed controllers, including model uncertainty and sensor noise. Copyright © 2014 John Wiley & Sons, Ltd.     

A limit set stabilization by means of the Port Hamiltonian system approach

A solution to the stabilization problem of a compact set by means of the Interconnection and Damping Assignment Passivity‐Based Control methodology, for an affine nonlinear system, was introduced. To this end, we expressed the closed‐loop system as a Port Hamiltonian system, having the property of almost all their trajectories asymptotically converge to a convenient limit set, except for a set of measure zero. It was carried out by solving a partial differential equation (PDE) or single matching condition, which allows the desired energy level or limit set E to be shaped explicitly. The control strategy was tested using the magnetic beam balance system and the pendulum actuated by a direct current motor (DC‐motor), having obtained satisfactory results. Copyright © 2014 John Wiley & Sons, Ltd.     

A globally asymptotically stabilizing trajectory tracking controller for fully actuated rigid bodies using landmark‐based information

In this paper, we address the problem of designing a control law based on sensor measurements that provides global asymptotic stabilization to a reference trajectory defined on the . The proposed control law is a function of the angular velocity, of vector measurements characterizing the position of some given landmarks, and of their rate of change. We provide sufficient conditions for the existence of synergistic potential functions on SO(3) which are pivotal in the generation of a suitable hybrid control law. We also provide sufficient conditions on the geometry of the landmarks to solve the given problem. Finally, the proposed solution is simulated and compared with a continuous feedback control law. Copyright © 2014 John Wiley & Sons, Ltd.     

Map‐based Visualizations Increase Recall Accuracy of Data

We investigate the memorability of data represented in two different visualization designs. In contrast to recent studies that examine which types of visual information make visualizations memorable, we examine the effect of different visualizations on time and accuracy of recall of the displayed data, minutes and days after interaction with the visualizations. In particular, we describe the results of an evaluation comparing the memorability of two different visualizations of the same relational data: node‐link diagrams and map‐based visualization. We find significant differences in the accuracy of the tasks performed, and these differences persist days after the original exposure to the visualizations. Specifically, participants in the study recalled the data better when exposed to map‐based visualizations as opposed to node‐link diagrams. We discuss the scope of the study and its limitations, possible implications, and future directions.     

SOA-enabled compliance management: instrumenting, assessing, and analyzing service-based business processes

Facilitating compliance management, that is, assisting a company’s management in conforming to laws, regulations, standards, contracts, and policies, is a hot but non-trivial task. The service-oriented architecture (SOA) has evolved traditional, manual business practices into modern, service-based IT practices that ease part of the problem: the systematic definition and execution of business processes. This, in turn, facilitates the online monitoring of system behaviors and the enforcement of allowed behaviors—all ingredients that can be used to assist compliance management on the fly during process execution. In this paper, instead of focusing on monitoring and runtime enforcement of rules or constraints, we strive for an alternative approach to compliance management in SOAs that aims at assessing and improving compliance. We propose two ingredients: (i) a model and tool to design compliant service-based processes and to instrument them in order to generate evidence of how they are executed and (ii) a reporting and analysis suite to create awareness of a company’s compliance state and to enable understanding why and where compliance violations have occurred. Together, these ingredients result in an approach that is close to how the real stakeholders—compliance experts and auditors—actually assess the state of compliance in practice and that is less intrusive than enforcing compliance.     

COACH: COllaborative certificate stAtus CHecking mechanism for VANETs

Vehicular Ad Hoc Networks (VANETs) require mechanisms to authenticate messages, identify valid vehicles, and remove misbehaving vehicles. A public key infrastructure (PKI) can be used to provide these functionalities using digital certificates. However, if a vehicle is no longer trusted, its certificates have to be revoked and this status information has to be made available to other vehicles as soon as possible. In this paper, we propose a collaborative certificate status checking mechanism called COACH to efficiently distribute certificate revocation information in VANETs. In COACH, we embed a hash tree in each standard Certificate Revocation List (CRL). This dual structure is called extended-CRL. A node possessing an extended-CRL can respond to certificate status requests without having to send the complete CRL. Instead, the node can send a short response (less than 1 kB) that fits in a single UDP message. Obviously, the substructures included in the short responses are authenticated. This means that any node possessing an extended-CRL can produce short responses that can be authenticated (including Road Side Units or intermediate vehicles). We also propose an extension to the COACH mechanism called EvCOACH that is more efficient than COACH in scenarios with relatively low revocation rates per CRL validity period. To build EvCOACH, we embed an additional hash chain in the extended-CRL. Finally, by conducting a detailed performance evaluation, COACH and EvCOACH are proved to be reliable, efficient, and scalable.     

On the hardness of solving edge matching puzzles as SAT or CSP problems

Edge matching puzzles have been amongst us for a long time now and traditionally they have been considered, both, a children’s game and an interesting mathematical divertimento. Their main characteristics have already been studied, and their worst-case complexity has been properly classified as a NP-complete problem. It is in recent times, specially after being used as the problem behind a money-prized contest, with a prize of 2US$ million for the first solver, that edge matching puzzles have attracted mainstream attention from wider audiences, including, of course, computer science people working on solving hard problems. We consider these competitions as an interesting opportunity to showcase SAT/CSP solving techniques when confronted to a real world problem to a broad audience, a part of the intrinsic, i.e. monetary, interest of such a contest. This article studies the NP-complete problem known as edge matching puzzle using SAT and CSP approaches for solving it. We will focus on providing, first and foremost, a theoretical framework, including a generalized definition of the problem. We will design and show algorithms for easy and fast problem instances generation, generators with easily tunable hardness. Afterwards we will provide with SAT and CSP models for the problems and we will study problem complexity, both typical case and worst-case complexity. We will also provide some specially crafted heuristics that result in a boost in solving time and study which is the effect of such heuristics.