Frederic V. G. Guinand

Prof. Dr. Frederic V. G. Guinand

Computer Science, University of Le Havre, Le Havre, Normandie, France
+1
orcid

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2015
Verified
Conference Paper
Closed access
El Houssein Chouaib HarikEl Houssein Chouaib Harik
El Houssein Chouaib Harik
FGFrancois Guerin
Francois Guerin
Frederic V. G. GuinandFrederic V. G. Guinand
Frederic V. G. Guinand
JBJean-Francois Brethe
Jean-Francois Brethe
HPHerve Pelvillain
Herve Pelvillain
We present in this paper a decentralized multirobot (aerial and ground) cooperation scheme for objects transportation. A team of ground mobile robots guided by a drone and a human operator moves in a coordinated way keeping a predefined formation in order to carry objects (tools, gas masks,...) in unsafe industrial areas. One ground mobile robot (leader) navigates among obstacles thanks to the waypoints provided by the drone and the human operator. The other ground mobile robots (followers) use a predictive vision based target tracking controller to keep a certain distance and bearing to the leader.

1 March 2006 in Electronic Notes in Theoretical Computer Science
Verified
Journal Article
Open access
LHLuc Hogie
Luc Hogie
Pascal BouvryPascal Bouvry
Pascal Bouvry
Frederic V. G. GuinandFrederic V. G. Guinand
Frederic V. G. Guinand
Mobile Ad hoc NETworks (MANETs) are dynamic networks populated by mobile stations. Stations in MANETs are usually laptops, PDAs or mobile phones. These devices feature Bluetooth and/or IEEE 802.11 (WiFi) network interfaces and communicate in a decentralized manner. Mobility is a key feature of MANETs. Because of their high cost and their lack of flexibility of such networks, experimentation is mostly achievable through simulation. Numerous tools exist for MANETs simulation, including ns-2 and GloMoSim which are the two most popular ones. This paper provides a State of the Art of MANETs simulators and associated simulation techniques. First it gives an overview of the domain. Then it provides a map of the main characteristics that MANETs simulation tools should feature and the current support of these. Finally, a description for each simulator is provided, including an explanation of what make them appealing solutions

1 May 2019 in Ad Hoc Networks
Verified
Journal Article
Closed access
JEJean-Matthieu Etancelin
Jean-Matthieu Etancelin
AFAndré Fabbri
André Fabbri
Frederic V. G. GuinandFrederic V. G. Guinand
Frederic V. G. Guinand
MRMartin Rosalie
Martin Rosalie

13 February 2017
Verified
Conference Paper
Closed access
El Houssein Chouaib HarikEl Houssein Chouaib Harik
El Houssein Chouaib Harik
FGFrancois Guerin
Francois Guerin
Frederic V. G. GuinandFrederic V. G. Guinand
Frederic V. G. Guinand
JBJean-Francois Brethe
Jean-Francois Brethe
HPHerve Pelvillain
Herve Pelvillain
We present in this paper a novel warehouse inventory scheme. The main purpose of this work is to make the inventory process completely autonomous. To this end, an Unmanned Ground Vehicle (UGV) and an Unmanned Aerial Vehicle (UAV) work cooperatively. The UGV is used as the carrying platform, and considered as a ground reference for the indoor flight of the UAV. While the UAV is used as the mobile scanner. The UGV navigates among rows of racks carrying the UAV. At each rack to be scanned, the UGV stops, and the UAV takes off to fly vertically scanning goods in that rack. Once the UAV at the top, the UGV moves to the next rack, and since the UAV takes the UGV as the ground reference, it will follow it autonomously, this results in placing the UAV at the top of the second rack, and scanning goods from top to bottom starts. the process is repeated until the row of racks is fully scanned. The UAV then lands on the UGV, and recharge its batteries while the UGV moves to the next row of racks. We present in this paper the proposed architecture, as well as the first experimental results of the proposed scheme

1 May 1999 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
JBJacek Blazewicz
Jacek Blazewicz
MDMaciej Drozdowski
Maciej Drozdowski
Frederic V. G. GuinandFrederic V. G. Guinand
Frederic V. G. Guinand
DTDenis Trystram
Denis Trystram

24 March 2015 in Journal of Scheduling
Verified
Journal Article
Open access
PDF file
IBIwo Błądek
Iwo Błądek
MDMaciej Drozdowski
Maciej Drozdowski
Frederic V. G. GuinandFrederic V. G. Guinand
Frederic V. G. Guinand
XSXavier Schepler
Xavier Schepler
In this paper we study differences between contiguous and non-contiguous parallel task schedules. Parallel tasks can be executed on more than one processor simultaneously. In the contiguous schedules, indices of the processors assigned to a task must be a sequence of consecutive numbers. In the non-contiguous schedules, processor indices may be arbitrary. Optimum non-preemptive schedules are considered. Given a parallel task instance, the optimum contiguous and non-contiguous schedules can be of different lengths. We analyze minimal instances where such a difference may arise, provide bounds on the difference of the two schedules lengths, and prove that deciding whether the difference in schedule length exists is NP-complete.