Various planning problems for robotic systems are of considerable interest. One of such problems is the problem of task sequencing. In this paper, we consider the problem of task sequencing for autonomous vacuum floor cleaning robots. We consider a graph model for the problem. We propose an efficient approach to solve the problem. In particular, we use an explicit reduction from the decision version of the problem to the satisfiability problem. We present the results of computational experiments for different satisfiability algorithms.
REFERENCES
1.
T.
Fong
, I.
Nourbakhsh
, and K.
Dautenhahn
, Robot. Auton. Syst.
42
, 143
–166
(2003
).2.
J.
Kramer
, and M.
Scheutz
, Auton. Robot.
22
, 101
–132
(2007
).3.
J.
Fink
, V.
Bauwens
, F.
Kaplan
, and P.
Dillenbourg
, Int. J. Soc. Robot.
5
, 389
–408
(2013
).4.
P.
Fiorini
, and E.
Prassler
, Auton. Robot.
9
, 227
–235
(2000
).5.
B.
Hendriks
, B.
Meerbeek
, S.
Boess
, S.
Pauws
, and M.
Sonneveld
, Int. J. Soc. Robot.
3
, 187
–195
(2010
).6.
F.
Vaussard
, J.
Fink
, V.
Bauwens
, P.
Retornaz
, D.
Hamel
, P.
Dillenbourg
, and F.
Mondada
, Robot. Auton. Syst.
62
, 376
–391
(2014
).7.
J.
Kober
, and J.
Peters
, Learning motor skills: from algorithms to robot experiments
, vol. 97
of Springer Tracts in Advanced Robotics, Springer-Verlag
, Cham
, 2014
, ISBN 978-3-319-03194-1.8.
S. M.
LaValle
, Planning Algorithms
, Cambridge University Press
, Cambridge
, 2006
, ISBN 0-521-86205-1.9.
J.
Lunenburg
, Context-Aware Design and Motion Planning for Autonomous Service Robots
, Ipskamp Drukkers B.V.
, Enschede, the Netherlands
, 2015
, ISBN 978-90-386-3870-6.10.
A.
Gorbenko
, M.
Mornev
, and V.
Popov
, IAENG IJCS
38
, 176
–182
(2011
).11.
A.
Gorbenko
, and V.
Popov
, Journal of Ambient Intelligence and Smart Environments
7
, 835
–847
(2015
).12.
V.
Popov
, AIP Conference Proceedings
1558
, 2083
–2086
(2013
).13.
F.
Vaussard
, P.
Retornaz
, D.
Hamel
, and F.
Mondada
, “Cutting Down the Energy Consumed by Domestic Robots: Insights from Robotic Vacuum Cleaners
,” in Advances in Autonomous Robotics
, edited by G. H. et al, Lecture Notes in Computer Science 7429
, Springer-Verlag
, Heidelberg
, 2012
, pp. 128
–139
.14.
A.
Itai
, C.
Papadimitriou
, and J.
Szwarcfite
, SlAM J. Comput.
11
, 676
–686
(1982
).15.
R.
Diestel
, Graph Theory, vol. 173
of Graduate Texts in Mathematics
, Springer-Verlag
, Heidelberg
, 2005
, ISBN .16.
C. H.
Papadimitriou
, Computational Complexity
, Addison Wesley Longman, Reading
, Massachusetts
, 1994
, ISBN 0-201-53082-1.17.
J.
Gu
, P.
Purdom
, J.
Franco
, and B.
Wah
, “Algorithms for the Satisfiability (SAT) Problem: A Survey,” in Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge
, edited by D. J. et al, ACM Press
, Providence, Rhode Island
, 1996
, pp. 19
–152
.18.
Y.
Kilani
, M.
Bsoul
, A.
Alsarhan
, and A.
Al-Khasawneh
, IJAIP
5
, 233
–256
(2013
).19.
M.
Garey
, and D.
Johnson
, Computers and Intractability: A Guide to the Theory of NP-Completeness
, W.H. Freeman and Company
, New York
, 1990
, 2 edn., ISBN 0-716-71045-5.20.
A.
Kovács
, International Journal of Production Research
54
, 1210
–1224
(2016
).21.
G.
Reinhart
, U.
Munzert
, and W.
Vogl
, CIRP Annals - Manufacturing Technology
57
, 37
–40
(2008
).22.
23.
A.
Gorbenko
, and V.
Popov
, Applied Mechanics and Materials
365
, 190
–193
(2013
).24.
V.
Popov
, Adv. Studies Theor. Phys.
7
, 355
–358
(2013
).25.
A.
Gorbenko
, Int. Journal of Math. Analysis
7
, 2317
–2331
(2013
).
This content is only available via PDF.
© 2017 Author(s).
2017
Author(s)
You do not currently have access to this content.
