oru.sePublikationer
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Towards configuration planning with partially ordered preferences: representation and results
Örebro University, School of Science and Technology, Örebro University, Sweden. (AASS)
Örebro University, School of Science and Technology, Örebro University, Sweden. (AASS)
Örebro University, School of Science and Technology, Örebro University, Sweden. (AASS)ORCID iD: 0000-0002-3122-693X
Örebro University, School of Science and Technology, Örebro University, Sweden. (AASS)ORCID iD: 0000-0002-0458-2146
2015 (English)In: Künstliche Intelligenz, ISSN 0933-1875, E-ISSN 1610-1987, Vol. 9, no 2, 173-183 p.Article in journal (Refereed) Published
Abstract [en]

Configuration planning for a distributed robotic system is the problem of how to configure the system over time in order to achieve some causal and/or information goals. A configuration plan specifies what components (sensor, actuator and computational devices), should be active at different times and how they should exchange information. However, not all plans that solve a given problem need to be equally good, and for that purpose it may be important to take preferences into account. In this paper we present an algorithm for configuration planning that incorporates general partially ordered preferences. The planner supports multiple preference categories, and hence it solves a multiple-objective optimization problem: for a given problem, it finds all possible valid, non-dominated configuration plans. The planner has been able to successfully cope with partial ordering relations between quantitative preferences in practically acceptable times, as shown in the empirical results. Preferences here are represented as c-semirings, and are used for establishing dominance of a solution over another in order to obtain a set of configuration plans that will constitute the solution of a configuration planning problem with partially ordered preferences. The dominance operators tested in this paper are Pareto and Lorenz dominance. Our solver considers one guiding heuristic for obtaining the first solution, and then switches to a dominance based monotonically decreasing heuristic used for pruning dominated partial configuration plans. In our empirical results, we perform a statistical study in the space of problem instances and establish families of problems for which our approach is computationally feasible.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2015. Vol. 9, no 2, 173-183 p.
Keyword [en]
configuration, planning, sensor network
National Category
Computer Science
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:oru:diva-44501DOI: 10.1007/s13218-015-0358-zOAI: oai:DiVA.org:oru-44501DiVA: diva2:808699
Projects
GiraffPlus
Funder
EU, FP7, Seventh Framework Programme, 288173
Available from: 2015-04-29 Created: 2015-04-29 Last updated: 2017-02-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
d. C. Silva-Lopez, Lia SusanaBroxvall, MathiasLoutfi, AmyKarlsson, Lars
By organisation
School of Science and Technology, Örebro University, Sweden
In the same journal
Künstliche Intelligenz
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 280 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf