A system of intelligent algorithms for a module of onboard equipment of mobile vehicles

Gorbenko, Anna

doi:10.12988/ijma.2013.36149

Search citation statements

Order By: Relevance

Paper Sections

Select...

Computational Experiments For Satisfiability Algorithms1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2015

2017

Publication Types

Select...

Other4

Relationship

Self Cite1

Independent3

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, we have used algorithms A [1] (see [24]), A [2] (see [25]), A [3] (see [26]), A [4] (see [27]), A [5] (see [28]), A [6] (see [29]) for the satisfiability problem.…”

Section: Computational Experiments For Satisfiability Algorithmsmentioning

confidence: 99%

The discrete minimum constraint removal motion planning problem

Gorbenko

Popov

2015

AIP Conference Proceedings

Self Cite

View full text Add to dashboard Cite

A minimum time problem revisited Am.Abstract. Many planning problems for robots are of considerable interest. In this paper, we consider the discrete minimum constraint removal motion planning problem that can be used for a motion planning formulation with explanations for failure. We consider an efficient approach to solve the problem. In particular, we consider 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.

show abstract

“…In particular, we have used algorithms A [1] (see [24]), A [2] (see [25]), A [3] (see [26]), A [4] (see [27]), A [5] (see [28]), A [6] (see [29]) for the satisfiability problem.…”

Section: Computational Experiments For Satisfiability Algorithmsmentioning

confidence: 99%