Search results for "BST"
showing 10 items of 10311 documents
Learning of Cooperative Behaviour in Robot Populations
2016
This paper addresses convergence and equilibrium properties of game theoretic learning algorithms in robot populations using simple and broadly applicable reward/cost models of cooperation between robotic agents. New models for robot cooperation are proposed by combining regret based learning methods and network evolution models. Results of mean-field game theory are employed in order to show the asymptotic second moment boundedness in the variation of cooperative behaviour. The behaviour of the proposed models are tested in simulation results, which are based on sample networks and a single lane traffic flow case study.
A novel clustering-based algorithm for solving spatially-constrained robotic task sequencing problems
2021
The robotic task sequencing problem (RTSP) appears in various forms across many industrial applications and consists of developing an optimal sequence of motions to visit a set of target points defined in a task space. Developing solutions to problems involving complex spatial constraints remains challenging due to the existence of multiple inverse kinematic solutions and the requirements for collision avoidance. So far existing studies have been limited to relaxed RTSPs involving a small number of target points and relatively uncluttered environments. When extending existing methods to problems involving greater spatial constraints and large sets of target points, they either require subst…
Decorous combinatorial lower bounds for row layout problems
2020
Abstract In this paper we consider the Double-Row Facility Layout Problem (DRFLP). Given a set of departments and pairwise transport weights between them the DRFLP asks for a non-overlapping arrangement of the departments along both sides of a common path such that the weighted sum of the center-to-center distances between the departments is minimized. Despite its broad applicability in factory planning, only small instances can be solved to optimality in reasonable time. Apart from this even deriving good lower bounds using existing integer programming formulations and branch-and-cut methods is a challenging problem. We focus here on deriving combinatorial lower bounds which can be compute…
A decomposition approach to dual shuttle automated storage and retrieval systems
2016
[EN] Automated Storage and Retrieval Systems (AS/RS) have become vital in today¿s distribution and production environments, however it remains necessary to equip them with more efficient operational control policies. Motivated by real situations encountered by companies employing AS/RS, the present paper studies a miniload AS/RS system, with a dual shuttle crane in which a set of storage and retrieval requests must be scheduled such that the prioritized waiting time is minimized. Dual shuttle cranes have received minimal academic attention and thus continue to pose new problems that must be solved. The miniload AS/RS problem is addressed by decomposing it into a location assignment and sequ…
Interrogating witnesses for geometric constraint solving
2012
International audience; Classically, geometric constraint solvers use graph-based methods to decompose systems of geometric constraints. These methods have intrinsic limitations, which the witness method overcomes; a witness is a solution of a variant of the system. This paper details the computation of a basis of the vector space of free infinitesimal motions of a typical witness, and explains how to use this basis to interrogate the witness for dependence detection. The paper shows that the witness method detects all kinds of dependences: structural dependences already detectable by graph-based methods, but also non-structural dependences, due to known or unknown geometric theorems, which…
GRASP and tabu search for the generalized dispersion problem
2021
Abstract The problem of maximizing dispersion requires the selection of a specific number of elements from a given set, in such a way that the minimum distance between the pairs of selected elements is maximized. In recent years, this problem has received a lot of attention and has been solved with many complex heuristics. However, there is a recent variant in which the selected elements have to satisfy two realistic constraints, a minimum capacity limit and a maximum budget, which in spite of its practical significance in facility location, has received little attention. In this paper, we first propose mathematical models to obtain the optimal solution of small- and medium-size instances, …
JOINT TOPOLOGY LEARNING AND GRAPH SIGNAL RECOVERY VIA KALMAN FILTER IN CAUSAL DATA PROCESSES
2018
In this paper, a joint graph-signal recovery approach is investigated when we have a set of noisy graph signals generated based on a causal graph process. By leveraging the Kalman filter framework, a three steps iterative algorithm is utilized to predict and update signal estimation as well as graph topology learning, called Topological Kalman Filter or TKF. Similar to the regular Kalman filter, we first predict the a posterior signal state based on the prior available data and then this prediction is updated and corrected based on the recently arrived measurement. But contrary to the conventional Kalman filter algorithm, we have no information of the transition matrix and hence we relate t…
Clothoid-Based Three-Dimensional Curve for Attitude Planning
2019
Interest in flying robots, also known as unmanned aerial vehicles (UAVs), has grown during last years in both military and civil fields [1, 2]. The same happens to autonomous underwater vehicles (AUVs) [3]. These vehicles, UAVs and AUVs, offer a wide variety of possible applications and challenges, such as control, guidance or navigation [2, 3]. In this sense, heading and attitude control in UAVs is very important [4], particularly relevant in airplanes (fixed-wing flying vehicles), because they are strongly non-linear, coupled, and tend to be underactuated systems with non-holonomic constraints. Hence, designing a good attitude controller is a difficult task [5, 6, 7, 8, 9], where stabilit…
Buckling and post-buckling analysis of cracked stiffened panels via an X-Ritz method
2019
Abstract A multi-domain eXtended Ritz formulation, called X-Ritz, for the analysis of buckling and post-buckling of stiffened panels with cracks is presented. The theoretical framework is based on the First-order Shear Deformation Theory and accounts for von Karman's geometric nonlinearities. The structure is modeled as assembly of plate elements. Penalty techniques are used to fulfill the continuity condition along the edges of contiguous elements and to satisfy essential boundary conditions requirements. The use of an extended set of approximating functions allows to model through-the-thickness cracks and to capture the crack opening and tip singular fields as well as the structural behav…
Iterated greedy with variable neighborhood search for a multiobjective waste collection problem
2020
Abstract In the last few years, the application of decision making to logistic problems has become crucial for public and private organizations. Efficient decisions clearly contribute to improve operational aspects such as cost reduction or service improvement. The particular case of waste collection service considered in this paper involves a set of economic, labor and environmental issues that translate into difficult operational problems. They pose a challenge to nowadays optimization technologies since they have multiple constraints and multiple objectives that may be in conflict. We therefore need to resort to multiobjective approaches to model and solve this problem, providing efficie…