A Sampling-Based Method to Estimate the Volume of Solution Space for Linear Arithmetic Constraints

被引:0
|
作者
Xie, Yan-Feng [1 ,2 ]
Yuan, Chun-Ming [1 ,2 ]
Jing, Rui-Juan [3 ]
机构
[1] Chinese Acad Sci, KLMM, Acad Math & Syst Sci, Beijing 100190, Peoples R China
[2] Univ Chinese Acad Sci, Sch Math Sci, Beijing 100049, Peoples R China
[3] Jiangsu Univ, Sch Math Sci, Zhenjiang 212023, Peoples R China
基金
中国国家自然科学基金;
关键词
Linear arithmetic constraints; oblique cones; polytope; volume estimation;
D O I
10.1007/s11424-024-3425-4
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The linear arithmetic constraints play important roles in many research fields. Estimating the volume of their solution spaces has specific applications, such as programming verification, linear programming, polyhedral optimization, and so on. In this paper, the authors provide an efficient estimation for the volume of the solution space for linear arithmetic constraints. This method sums up the estimations for volumes of oblique cones centered along randomly generated rays. The error analysis is provided to improve the accuracy.
引用
收藏
页数:23
相关论文
共 50 条
  • [41] A scalable method for parallelizing sampling-based motion planning algorithms
    Jacobs, Sam Ade
    Manavi, Kasra
    Burgos, Juan
    Denny, Jory
    Thomas, Shawna
    Amato, Nancy M.
    [J]. Proceedings - IEEE International Conference on Robotics and Automation, 2012, : 2529 - 2536
  • [42] DESIGN SENSITIVITY METHOD FOR SAMPLING-BASED RBDO WITH FIXED COV
    Cho, Hyunkyoo
    Choi, K. K.
    Lee, Ikjin
    Lamb, David
    [J]. INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2015, VOL 2B, 2016,
  • [43] A Scalable Method for Parallelizing Sampling-Based Motion Planning Algorithms
    Jacobs, Sam Ade
    Manavi, Kasra
    Burgos, Juan
    Denny, Jory
    Thomas, Shawna
    Amato, Nancy M.
    [J]. 2012 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2012, : 2529 - 2536
  • [44] Multiple Sampling and Cooperative Search Strategy on Sampling-Based Distributed Constraint Optimization Method
    Matsui, Toshihiro
    Matsuo, Hiroshi
    [J]. 2015 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY (WI-IAT), VOL 2, 2015, : 277 - 282
  • [45] An Optimal Sampling-Based Path Planning under Uncertainty Based on Linear Quadratic Regulator
    Li, Junxiang
    Dai, Bin
    Liu, Daxue
    Zhao, Zhe
    Ren, Jun
    [J]. 2017 2ND INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION ENGINEERING (ICRAE), 2017, : 84 - 88
  • [46] Computing and estimating the volume of the solution space of SMT(LA) constraints
    Ge, Cunjing
    Ma, Feifei
    Zhang, Peng
    Zhang, Jian
    [J]. THEORETICAL COMPUTER SCIENCE, 2018, 743 : 110 - 129
  • [47] Sampling-based time-optimal path parameterization with jerk constraints for robotic manipulation
    Huang, Huanhuan
    Liu, Houde
    Xia, Chongkun
    Mei, Hongwei
    Gao, Xuehai
    Liang, Bin
    [J]. ROBOTICS AND AUTONOMOUS SYSTEMS, 2023, 170
  • [48] Using motion primitives to enforce vehicle motion constraints in sampling-based optimal planners
    Sakcak, Basak
    Bascetta, Luca
    Ferretti, Gianni
    Prandini, Maria
    [J]. 2018 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2018,
  • [49] Sampling-Based Reactive Motion Planning with Temporal Logic Constraints and Imperfect State Information
    Montana, Felipe J.
    Liu, Jun
    Dodd, Tony J.
    [J]. CRITICAL SYSTEMS: FORMAL METHODS AND AUTOMATED VERIFICATION (FMICS-AVOCS 2017), 2017, 10471 : 134 - 149
  • [50] Sampling-based resolution-complete algorithms for safety falsification of linear systems
    Bhatia, Amit
    Frazzoli, Emilio
    [J]. HYBRID SYSTEMS: COMPUTATION AND CONTROL, 2008, 4981 : 606 - +