paper-with-me

Papers

Counterexample Guided Inductive Optimization Applied to Mobile Robots Path Planning (Extended Version)

2017-08-14 · Rodrigo F. Araújo, Alexandre Ribeiro, Iury V. Bessa, Lucas C. Cordeiro, João E. C. Filho

We describe and evaluate a novel optimization-based off-line path planning algorithm for mobile robots based on the Counterexample-Guided Inductive Optimization (CEGIO) technique. CEGIO iteratively employs counterexamples generated from Boolean Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) solvers, in order to guide the optimization process and to ensure global optimization. This paper marks the first application of CEGIO for planning mobile robot path. In particular, CEGIO has been successfully applied to obtain optimal two-dimensional paths for autonomous mobile robots using off-the-shelf SAT and SMT solvers.

📄 PDF Abstract BibTeX arXiv:1708.04028

Code (0)

등록된 구현이 없습니다.

Tasks

global-optimization

Similar Papers 제목 키워드 기반

Counterexample Guided Inductive Optimization

2017-04-11 · Rodrigo F. Araujo, Higo F. Albuquerque, Iury V. de Bessa, Lucas C. Cordeiro 외

This paper describes three variants of a counterexample guided inductive optimization (CEGIO) approach based on Satisfiability Modulo Theories (SMT) solvers. In particular, CEGIO relies on iterative executions to constra…

Are There Good Mistakes? A Theoretical Analysis of CEGIS

2014-07-21 · Susmit Jha, Sanjit A. Seshia

Counterexample-guided inductive synthesis CEGIS is used to synthesize programs from a candidate space of programs. The technique is guaranteed to terminate and synthesize the correct program if the space of candidate pro…

QBF Solving by Counterexample-guided Expansion

2016-11-04 · Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic

We introduce a novel generalization of Counterexample-Guided Inductive Synthesis (CEGIS) and instantiate it to yield a novel, competitive algorithm for solving Quantified Boolean Formulas (QBF). Current QBF solvers based…

A Theory of Formal Synthesis via Inductive Learning

2015-05-15 · Susmit Jha, Sanjit A. Seshia

Formal synthesis is the process of generating a program satisfying a high-level formal specification. In recent times, effective formal synthesis methods have been proposed based on the use of inductive learning. We refe…

BIG-bench Machine LearningInductive LearningLearning Theory

Counterexample-Guided Learning of Monotonic Neural Networks

2020-06-16 · NeurIPS 2020 12 · Aishwarya Sivaraman, Golnoosh Farnadi, Todd Millstein, Guy Van Den Broeck

The widespread adoption of deep learning is often attributed to its automatic feature construction with minimal inductive bias. However, in many real-world tasks, the learned function is intended to satisfy domain-specif…

Inductive Bias