%0 Conference Paper %1 skubch2012solving %A Skubch, Hendrik %B Proceedings of the 27th Annual ACM Symposium on Applied Computing %C New York, NY, USA %D 2012 %I ACM %K acceptance adaptive alica design ubiquitous vs %P 67--73 %R 10.1145/2245276.2245293 %T Solving Non-linear Arithmetic Constraints in Soft Realtime Environments %U http://doi.acm.org/10.1145/2245276.2245293 %X In many domains, such as in multi-robot scenarios, operational instructions controlling a system are highly complex. In order to facilitate both ease of modeling and intelligent decision making, powerful reasoning techniques become available, which are able to solve complex non-linear formulae within a very small time frame. We argue that the problem class of arbitrary boolean combinations of non-linear constraints is a suitable representation for a wide range of robotic problems and present an evaluation of several state-of-the-art solving techniques, targeting problems that arise in robotic and multi-robotic domains, which need to be solved in near real-time. Additionally, we combine available techniques yielding two highly competitive solvers for non-linear continuous constraint systems. Finally, we present new results on complexity phase transition phenomena of the local searches involved. %@ 978-1-4503-0857-1

@inproceedings{skubch2012solving, abstract = {In many domains, such as in multi-robot scenarios, operational instructions controlling a system are highly complex. In order to facilitate both ease of modeling and intelligent decision making, powerful reasoning techniques become available, which are able to solve complex non-linear formulae within a very small time frame. We argue that the problem class of arbitrary boolean combinations of non-linear constraints is a suitable representation for a wide range of robotic problems and present an evaluation of several state-of-the-art solving techniques, targeting problems that arise in robotic and multi-robotic domains, which need to be solved in near real-time. Additionally, we combine available techniques yielding two highly competitive solvers for non-linear continuous constraint systems. Finally, we present new results on complexity phase transition phenomena of the local searches involved.}, acmid = {2245293}, added-at = {2014-02-19T10:10:19.000+0100}, address = {New York, NY, USA}, author = {Skubch, Hendrik}, biburl = {https://www.bibsonomy.org/bibtex/2d16336ee053af5c4faebbd130552be0c/vskassel}, booktitle = {Proceedings of the 27th Annual ACM Symposium on Applied Computing}, doi = {10.1145/2245276.2245293}, interhash = {f44a581eb9df0acd008e63323a9afd04}, intrahash = {d16336ee053af5c4faebbd130552be0c}, isbn = {978-1-4503-0857-1}, keywords = {acceptance adaptive alica design ubiquitous vs}, location = {Trento, Italy}, numpages = {7}, pages = {67--73}, publisher = {ACM}, series = {SAC '12}, timestamp = {2015-09-10T11:36:33.000+0200}, title = {Solving Non-linear Arithmetic Constraints in Soft Realtime Environments}, url = {http://doi.acm.org/10.1145/2245276.2245293}, year = 2012 }