SciTePress - Affiliation Profile

LAAS-CRNS, France

Context (please use complete words only)

Field

Sort by

18 Papers

Multi-Mode RCPSP with Safety Margin Maximization: Models and Algorithms

Topics: Optimization; Linear Programming

Authors: Christian Artigues ¹ , Emmanuel Hebrard ¹ , Alain Quilliot ² and Helene Toussaint ²

Affiliations: ¹ LAAS Laboratory, CNRS, Toulouse, France , ² LIMOS Laboratory, CNRS, Clermont-Ferrand, France

Digital Object Identifier: 10.5220/0010190101290136

Proceedings of ICORES 2021, ISBN: 978-989-758-485-5

Quick Abstract

We study here a variant of the multimode Resource Constrained Project Scheduling problem (RCPSP), which involves continuous modes, and a notion of Safety Margin maximization. Our interest was motivated by a work package inside the GEOSAFE H2020 project, devoted to the design of evacuation plans in face of natural disasters, and more specifically wildfire.

Multi-product, Multi-supplier Order Assignment and Routing for an e-Commerce Application in the Retail Sector

Topics: Network Optimization; Routing; Logistics; OR in Transportation; New Applications of OR

Authors: Louis Rivière ¹ , Christian Artigues ¹ , Azeddine Cheref ¹ , Nicolas Jozefowiez ² , Marie-José Huguet ¹ , Sandra Ngueveu ¹ and Vincent Charvillat ^{3

;

4}

Affiliations: ¹ CNRS, LAAS-CNRS, Université de Toulouse, INSA, INP, France , ² LCOMS EA 7306, Université de Lorraine, Metz 57000, France , ³ U Devatics, Toulouse, France , ⁴ Université de Toulouse, IRIT, INP, France

Digital Object Identifier: 10.5220/0010318304380445

Proceedings of ICORES 2021, ISBN: 978-989-758-485-5

Quick Abstract

With the rise of virtualization, the share of e-commerce in the retail market continues to grow in an omnichannel context. We consider an existing software tool, developed by the Devatics company, for pooling inventories in stores to meet online orders. The problem which arises therefore consists in seeking the optimal allocation of a set of customers to stores. In this paper we consider a variant of the offline problem corresponding to an evolution of the existing software, consisting of assigning a set of predefined orders when the transportation cost depends on a delivery tour to the customer locations. We show that the problem corresponds to a vehicle routing problem with additional but standard attributes. A mixed-integer linear programming formulation is given and several heuristics are proposed : a giant tour-based genetic algorithm, a simple cluster-first, route second heuristic and an assignment-based genetic algorithm. Preliminary computational results on a set of realistic problem instances suggest that the assignment-based genetic algorithm better scales as the problem size increases.

A Heuristic Method for the Multi-skill Project Scheduling Problem with Partial Preemption

Topics: Project Management; Optimization; Scheduling

Authors: Oliver Polo-Mejía ¹ , Christian Artigues ² and Pierre Lopez ²

Affiliations: ¹ CEA, DEN, DEC, SETC, St. Paul lez Durance, France, LAAS-CNRS, Université de Toulouse, CNRS, Toulouse and France , ² LAAS-CNRS, Université de Toulouse, CNRS, Toulouse and France

Digital Object Identifier: 10.5220/0007390001110120

Proceedings of ICORES 2019, ISBN: 978-989-758-352-0

Quick Abstract

In this article we consider a new scheduling problem known as the Multi-Skill Project Scheduling Problem with Partial Preemption. The main characteristic of this problem is the way we handle the resources release during the preemption periods: only a subset of resources are released. Since this problem is NP-hard, we propose a greedy algorithm based on priority rules, modeling the subproblem of technicians allocation as a Minimum-Cost Maximum-Flow problem. In order to improve the performance of the greedy algorithm, we propose a randomized tree-based local search algorithm. Computational tests are carried out and analyzed.

Related Ontology Subjects/Areas/Topics (14)

Applications	Knowledge-Based Systems	Project Management
Artificial Intelligence	Methodologies and Technologies	Scheduling
Enterprise Information Systems	Operational Research	Software Engineering
Information Systems Analysis and Specification	Optimization	Symbolic Systems
Knowledge Discovery and Information Retrieval	Pattern Recognition

Feature Model based on Design Pattern for the Service Provider in the Service Oriented Architecture

Topics: Software Engineering; Modeling of Distributed Systems; Tools, Techniques and Methodologies for System Development; Modeling Formalisms, Languages, and Notations (e.g. UML, ER variants); EA and Service Oriented Architecture (SOA)

Authors: Akram Kamoun ¹ , Mohamed Hadj Kacem ¹ , Ahmed Hadj Kacem ¹ and Khalil Drira ²

Affiliations: ¹ National Engineering School of Sfax, Tunisia , ² Université de Toulouse, France

Digital Object Identifier: 10.5220/0006332301110120

Proceedings of ICEIS 2017, ISBN: 978-989-758-248-6

Quick Abstract

In Service Oriented Architecture (SOA), service contracts are widely used for designing and developing the features (e.g., services and capabilities) of Service Providers (SPs). Two of the most widely used traditional service contracts in SOA are: WSDL and WADL. We identify that these service contracts suffer from several problems, like: they only work for SOAP and REST communication technologies and do not rely on modeling SOA Design Patterns (DPs). One benefit of using SOA DPs is that they permit developing proven SPs for different platforms. In order to overcome these problems, we introduce a new DP-based Feature Model (FM), named FMSP, as a service contract that models the variability of SP features including 15 SOA DPs (e.g., Event-driven messaging DP) and their corresponding constraints. This permits to easily identify and develop valid SOA compound DPs. We demonstrate, through a practical case study and a developed tool, that our FMSP allows to automatically generate fully functional, valid, highly customized and DP-based SPs. We also show that our FMSP reduces the required effort and time to develop SPs.

Related Ontology Subjects/Areas/Topics (5)

Enterprise Information Systems		Modeling of Distributed Systems		Tools, Techniques and Methodologies for System Development
Information Systems Analysis and Specification		Software Engineering

Fixed-sequence Single Machine Scheduling and Outbound Delivery Problems

Topics: Optimization; Dynamic Programming; Scheduling; Logistics

Authors: Azeddine Cheref ¹ , Alessandro Agnetis ² , Christian Artigues ³ and Jean-Charles Billaut ⁴

Affiliations: ¹ Université François-Rabelais Tours / CNRS,, CNRS and Univ. de Toulouse, France , ² Universitá degli Studi di Siena, Italy , ³ CNRS and Univ. de Toulouse, France , ⁴ Université François-Rabelais Tours / CNRS and, France

Digital Object Identifier: 10.5220/0005701201450151

Proceedings of ICORES 2016, ISBN: 978-989-758-171-7

Quick Abstract

In this paper, we study an integrated production an outbound delivery scheduling problem with a predefined sequence. The manufacturer has to process a set of jobs on a single machine and deliver them in batches to multiple customers. A single vehicle with limited capacity is used for the delivery. Each job has a processing time and a specific customer location. Starting from the manufacturer location, the vehicle delivers a set of jobs which constitute a batch by taking into account the transportation times. Since the production sequence and delivery sequence are fixed and identical, the problem consists in deciding the composition of batches. We prove that for any regular sum-type objective function of the delivery times, the problem in NP-hard in the ordinary sense and can be solved in pseudopolynomial time. A dynamic programming algorithm is proposed.

Related Ontology Subjects/Areas/Topics (15)

Applications	Knowledge Discovery and Information Retrieval	Optimization
Artificial Intelligence	Knowledge-Based Systems	Pattern Recognition
Dynamic Programming	Logistics	Scheduling
e-Business	Methodologies and Technologies	Software Engineering
Enterprise Information Systems	Operational Research	Symbolic Systems

A Complete Sensor-based System to Navigate Through a Cluttered Environment

Topics: Control and Supervision Systems; Mobile Robots and Autonomous Systems; Guidance, Navigation and Control

Authors: A. Durand-Petiteville ¹ , V. Cadenat ² and N. Ouadah ³

Affiliations: ¹ University of California, United States , ² CNRS, LAAS and Univ. de Toulouse, France , ³ Centre de Développement des Technologies Avancées, Algeria

Digital Object Identifier: 10.5220/0005502201660173

Proceedings of ICINCO 2015, ISBN: 978-989-758-123-6

Quick Abstract

This article deals with the autonomous navigation problem of a mobile robot in a cluttered environment. We propose to have a different perspective than the traditional way of splitting the problem into two categories: the map-based ones and the mapless ones. Here we divide navigation systems into six processes: perception, modeling, localization, planning, action and decision. Then we present how those processes are organized into an architecture to perform a navigation. It is shown that this framework embraces any navigation system proposed in the literature and how it allows to create new combination of processes. We then detail our solution to the problem which mainly consists in coupling sensor-based controllers with a topological map. Moreover we present the used tools that we have developed over the last years as well as the ones from the literature. Finally we present experimentation results of a long-range navigation based on the proposed approach where a robot drives through an environement despite of occlusions and possible collisions due to obstacles.

Related Ontology Subjects/Areas/Topics (4)

Control and Supervision Systems		Mobile Robots and Autonomous Systems		Robotics and Automation
Informatics in Control, Automation and Robotics

A Decomposition Method for Frequency Assignment in Multibeam Satellite Systems

Topics: Optimization; Linear Programming; Resource Allocation; OR in Telecommunications

Authors: Jean-Thomas Camino ¹ , Christian Artigues ² , Laurent Houssin ² and Stéphane Mourgues ³

Affiliations: ¹ Airbus Defence and Space, Space Systems, CNRS, LAAS and Univ de Toulouse, France , ² CNRS, LAAS and Univ de Toulouse, France , ³ Univ de Toulouse, France

Digital Object Identifier: 10.5220/0005218700230033

Proceedings of ICORES 2015, ISBN: 978-989-758-075-8

Quick Abstract

To comply with the continually growing demand for multimedia content and higher throughputs, the telecom- munication industry has to keep improving the use of the bandwidth resources, leading to the well-known Frequency Assignment Problems (FAP). In this article, we present a new extension of these problems to the case of satellite systems that use a multibeam coverage. With the models we propose, we make sure that for each frequency plan produced there exists a corresponding satellite payload architecture that is cost-efficient and decently complex. Two approaches are presented and compared : a global constraint program that handles all the constraints simultaneously, and a decomposition method that involves both constraint programming and integer linear programming. For the latter approach, we show that the two identified subproblems can re- spectively be modeled as a multiprocessor scheduling problem and a path-covering problem, and this analogy is used to prove that they both belong to the category of NP-hard problems. We also show that, for the most common class of interference graphs in multibeam satellite systems, the maximal cliques can all be enumer- ated in polynomial time and their number is relatively low, therefore it is perfectly acceptable to rely on them in the scheduling model that we derived. Our experiments on realistic scenarios show that the decomposition method proposed can indeed provide a solution of the problem when the global CP model does not.

Related Ontology Subjects/Areas/Topics (13)

Applications	Methodologies and Technologies	Pattern Recognition
Artificial Intelligence	Operational Research	Resource Allocation
Knowledge Discovery and Information Retrieval	Optimization	Software Engineering
Knowledge-Based Systems	OR in Telecommunications	Symbolic Systems
Linear Programming

Dynamic Obstacle Avoidance using Online Trajectory Time-scaling and Local Replanning

Topics: Mobile Robots and Autonomous Systems; Guidance, Navigation and Control

Authors: Ran Zhao ¹ and Daniel Sidobre ²

Affiliations: ¹ CNRS and Univ. de Toulouse, France , ² Univ. de Toulouse, France

Digital Object Identifier: 10.5220/0005570204140421

Proceedings of ICINCO 2015, ISBN: 978-989-758-123-6

Quick Abstract

In various circumstances, planning at trajectory level is very useful to generate flexible collision-free motions for autonomous robots, especially when the system interacts with humans or human environment. This paper presents a simple and fast obstacle avoidance algorithm that operates at the trajectory level in real-time. The algorithm uses the Velocity Obstacle to obtain the boundary conditions required to avoid a dynamic obstacle, and then adjust the time evolution using the non-linear trajectory time-scaling scheme. A trajectory local replanning method is applied to make a detour when the static obstacles block the advance path of the robot, which leads to failure of implementing time-scaling approach. Cubic polynomial functions are used to describe trajectories, which brings sufficient flexibility in terms of providing higher order smoothness. We applied this algorithm on reaching tasks for a mobile robot. Simulation results demonstrate that the technique can generate collision-free motion in real time.

Related Ontology Subjects/Areas/Topics (3)

Informatics in Control, Automation and Robotics

Mobile Robots and Autonomous Systems

Robotics and Automation

Reactive Planning on a Collaborative Robot for Industrial Applications

Topics: Robot Design, Development and Control; Control and Supervision Systems; Collective and Social Robots

Authors: Gautier Dumonteil ¹ , Guido Manfredi ² , Michel Devy ² , Ambroise Confetti ¹ and Daniel Sidobre ³

Affiliations: ¹ Siemens Industry Software SAS, France , ² CNRS and LAAS, France , ³ CNRS, LAAS and Univ. de Toulouse, France

Digital Object Identifier: 10.5220/0005575804500457

Proceedings of ICINCO 2015, ISBN: 978-989-758-123-6

Quick Abstract

A challenge for roboticists consist in promoting collaborative robotics for industrial applications, i.e. allowing robots to be used close to humans, without barriers. Safety becomes the key issue. For manipulation tasks, a part of the problem is solved using new arms like the KUKA LWR, able to physically detect a collision from couple measurements on each joint. Nevertheless it is better to avoid collisions, overall if the obstacle is the arm or the head of an operator. This paper describes how obstacles could be detected and avoided, using a single Kinect sensor for the monitoring of the workspace and the reactive planner developped by the Blind company for the the real-time selection of an avoidance trajectory. Experimental results are provided as a proof that our dynamic obstacle avoidance strategy works properly.

Related Ontology Subjects/Areas/Topics (5)

Collective and Social Robots		Informatics in Control, Automation and Robotics		Robotics and Automation
Control and Supervision Systems		Robot Design, Development and Control

A Navigational Framework Combining Visual Servoing and Spiral Obstacle Avoidance Techniques

Topics: Vision, Recognition and Reconstruction; Robot Design, Development and Control; Control and Supervision Systems; Mobile Robots and Autonomous Systems; Engineering Applications

Authors: Marcus Futterlieb ¹ , Viviane Cadenat ² and Thierry Sentenac ³

Affiliations: ¹ CNRS, LAAS and Univ de Toulouse, France , ² CNRS, LAAS and University of Toulouse, France , ³ CNRS and LAAS, France

Digital Object Identifier: 10.5220/0005027800570064

Proceedings of ICINCO 2014, ISBN: 978-989-758-040-6

Quick Abstract

This paper presents a navigational framework which enables a robot to perform Long Range Navigation in the context of the Air-Cobot-Project in which a robot is used to execute an autonomous pre-flight inspection on an aircraft. The robot is equipped with Laser range finders and a mobile stereo camera system. The idea is to guide the robot to the pre-defined checkpoints using a Visual Servoing controller based on video data, while avoiding static and moving obstacles. The contribution of the paper is an avoidance technique derived from the spiral flight path of insects applied to the Laser range data. Simulation results validate the whole approach.

Related Ontology Subjects/Areas/Topics (9)

Control and Supervision Systems	Intelligent Control Systems and Optimization	Robotics and Automation
Engineering Applications	Mobile Robots and Autonomous Systems	Signal Processing, Sensors, Systems Modeling and Control
Informatics in Control, Automation and Robotics	Robot Design, Development and Control	Vision, Recognition and Reconstruction

Topic(s):

Title:
ISBN:
Year:
Acronym:
Subject:

Title:
Author:
Affiliation:
Subject:

Name:
Affiliation:
Country:
Conference:
Subject:

Name:
Country:
Subject:

Affiliation

Filter listed results, by