WAFR'2002 First Call for Papers

[jsbm at ams.sunysb.edu]

Call for Papers (Deadline: 15 June 2002) 
  
WAFR 2002
Fifth International Workshop on
Algorithmic Foundations of Robotics
December 15-17, 2002
Hotel Westminster 
Nice, France

Robot algorithms are abstractions of computational processes that control 
or reason about motion and perception in the physical world. Because 
actions in the physical world are subject to physical laws and geometric 
constraints, the design and analysis of robot algorithms raises 
fundamental questions in computer science, computational geometry, 
mechanical modelling, operations research, control theory, and associated 
fields. 

The biennial Workshop on Algorithmic Foundations of Robotics was 
established in 1994 as a single-track meeting to focus on algorithmic 
issues related to robotics and automation. The highly selective program 
highlights significant new results such as algorithmic models and 
complexity bounds. Discussion of new areas and open problems is 
encouraged. 

WAFR 2002 will bring together approximately sixty researchers to present 
and discuss contributed and invited papers. The proceedings will be 
subsequently published in a hard-cover volume. Selected papers will also 
be published in a special issue of the International Journal of Robotics 
Research. Topics of interest include, but are not limited to: 

  geometric algorithms 
  simultaneous location and mapping 
  surgery planning and guidance 
  organ and tissue modelling 
  computational molecular and structural biology 
  simulation, animation, graphics 
  holonomic and nonholonomic motion planning 
  sensor-based planning and computer vision 
  virtual environments and gaming
  manufacturing and assembly 
  grasping and fixturing 
  manipulation planning 
  navigation and geographic information systems 
  modular and reconfigurable robots 
  distributed manipulation 
  minimalist and underactuated robots 
  controllability, complexity, and completeness 

Program Committee 
  Pankaj Agarwal, Duke U., USA 
  Nancy Amato, Texas A&M U., USA 
  Nicholas Ayache, INRIA, Sophia-Antipolis, France 
  Antonio Bicchi, U. of Pisa, Italy 
  Robert-Paul Berretty, Philips Research, Holland
  Karl Bohringer, U. of Washington, USA 
  Jean-Daniel Boissonnat, INRIA, Sophia-Antipolis, France 
  Joel Burdick, Cal Tech, USA 
  Howie Choset, Carnegie Mellon U., USA 
  Ken Goldberg, UC Berkeley, USA 
  Leonidas J. Guibas, Stanford U., USA 
  Kamal Gupta, Simon Fraser U., Canada 
  Dan Halperin, Tel Aviv U., Israel
  Hirohisa Hirukawa, Inst. of Adv. Ind. Sci. and Tech. (AIST), Japan 
  Seth Hutchinson, U. of Illinois, USA 
  Makoto Kaneko, Hiroshima University, Japan 
  Lydia Kavraki, Rice U., USA 
  Jean-Paul Laumond, LAAS-CNRS, Toulouse, France 
  Matt Mason, Carnegie Mellon U., USA 
  Joe Mitchell, SUNY Stony Brook, USA 
  Dinesh Pai, U. British Columbia, Canada 
  Jean Ponce, U. of Illinois, USA 
  Frank van der Stappen, U. Utrecht, The Netherlands

Authors are invited to submit papers in PDF format (11 pages or fewer in 
11 point font) by 15 June, 2002. 

Submission and Registration: www.wafr.org (after 15 April 2002) 

Authors will be notified of acceptance by 1 Sept, 2002. Revised papers
will be due by 15 Oct, 2002 for distribution to participants. To be
included in the bound volume, final papers will be required in
specific Latex format after the workshop (by 15 Feb 2003).

Conference Co-Chairs: 

  Jean-Daniel Boissonnat, Jean-Daniel.Boissonnat at sophia.inria.fr 
  Joel Burdick, jwb at robotics.caltech.edu 
  Ken Goldberg, goldberg at ieor.berkeley.edu 
  Seth Hutchinson,seth at uiuc.edu 

For more information, links to past WAFR conferences and papers,
submission and registration details, hotel information etc, please
visit the Conference Home Page: 

http://www.wafr.org 




-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.