Factor graphs for robot perception

F Dellaert, M Kaess - Foundations and Trends® in Robotics, 2017 - nowpublishers.com
We review the use of factor graphs for the modeling and solving of large-scale inference
problems in robotics. Factor graphs are a family of probabilistic graphical models, other …

[HTML][HTML] Evaluation and intelligent deployment of coal and coalbed methane coupling coordinated exploitation based on Bayesian network and cuckoo search

Q Zou, Z Chen, Z Cheng, Y Liang, W Xu, P Wen… - International Journal of …, 2022 - Elsevier
Coal and coalbed methane (CBM) coordinated exploitation is a key technology for the safe
exploitation of both resources. However, existing studies lack the quantification and …

Continuous and interval constraints

F Benhamou, L Granvilliers - Foundations of Artificial Intelligence, 2006 - Elsevier
Publisher Summary This chapter reviews that continuous constraint solving has been widely
studied in several fields of applied mathematics and computer science. In computer algebra …

[書籍][B] Probabilistic reasoning in intelligent systems: networks of plausible inference

J Pearl - 2014 - books.google.com
Probabilistic Reasoning in Intelligent Systems is a complete and accessible account of the
theoretical foundations and computational methods that underlie plausible reasoning under …

[書籍][B] Handbook of constraint programming

F Rossi, P Van Beek, T Walsh - 2006 - books.google.com
Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

Temporal constraint networks

R Dechter, I Meiri, J Pearl - Artificial intelligence, 1991 - Elsevier
This paper extends network-based methods of constraint satisfaction to include continuous
variables, thus providing a framework for processing temporal constraints. In this framework …

[書籍][B] Constraint processing

R Dechter - 2003 - books.google.com
Constraint satisfaction is a simple but powerful tool. Constraints identify the impossible and
reduce the realm of possibilities to effectively focus on the possible, allowing for a natural …

Metaheuristics: A bibliography

IH Osman, G Laporte - Annals of Operations research, 1996 - Springer
Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …

[書籍][B] Foundations of constraint satisfaction: the classic text

E Tsang - 2014 - books.google.com
This seminal text of Computer Science, the most cited book on the subject, is now available
for the first time in paperback. Constraint satisfaction is a decision problem that involves …

Algorithms for constraint-satisfaction problems: A survey

V Kumar - AI magazine, 1992 - ojs.aaai.org
A large number of problems in AI and other areas of computer science can be viewed as
special cases of the constraint-satisfaction problem. Some examples are machine vision …