Parametric algorithms for cyclic scheduling problems with applications to robotics

Vladimir Kats, Eugene Levner

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

The paper considers cyclic scheduling problems arising in planning of robotic flowlines and logistics. The problems are reduced to finding the minimum (or maximum) cost-to-time ratio in doubly weighted graphs. New combinatorial algorithms are developed extending the cyclic project scheduling algorithm by Romanovskii (1967) and the minimum-cost-to-time-ratio algorithm by Dantzig, Blattner and Rao (1967). Whereas Romanovskii's and Dantzig-Blattner-Rao's algorithms are restricted to solving problems with fixed numerical data, the new algorithms can treat input data that are varied at prescribed intervals. Several special cases are solved in strongly polynomial time.

Original languageEnglish
Title of host publicationMICAI 2008
Subtitle of host publicationAdvances in Artificial Intelligence - 7th Mexican International Conference on Artificial Intelligence, Proceedings
Pages653-663
Number of pages11
DOIs
StatePublished - 2008
Event7th Mexican International Conference on Artificial Intelligence, MICAI 2008 - Atizapan de Zaragoza, Mexico
Duration: 27 Oct 200831 Oct 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5317 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th Mexican International Conference on Artificial Intelligence, MICAI 2008
Country/TerritoryMexico
CityAtizapan de Zaragoza
Period27/10/0831/10/08

Keywords

  • Cyclic scheduling
  • Intersection of polygons
  • Polynomial time algorithm
  • Robotic scheduling

Fingerprint

Dive into the research topics of 'Parametric algorithms for cyclic scheduling problems with applications to robotics'. Together they form a unique fingerprint.

Cite this