检索结果-内蒙古大学图书馆

A Unifying Complexity-Certification Framework for Branch-and-Bound Algorithms for Mixed-Integer Linear and Quadratic Programming

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Shoja, Shamisa Arnström, Daniel Axehill, Daniel Division of Automatic Control Department of Electrical Engineering Linköping University Sweden Division of Systems and Control Department of Information Technology Uppsala University Sweden

In model predictive control (MPC) for hybrid systems, solving optimization problems efficiently and with guarantees on worst-case computational complexity is critical, particularly in real-time applications. These optimization problems often take the form of mixed-integer linear programs (MILPs) or mixed-integer quadratic programs (MIQPs) that depend on system parameters. A common approach for solving such problems is the branch-and-bound (B&B) method. This paper extends existing complexity certification methods by presenting a unified complexity-certification framework for B&B-based MILP and MIQP solvers, specifically for the family of multi-parametric MILP and MIQP problems that arise in, e.g., hybrid MPC applications. The framework provides guarantees on worst-case computational metrics, including the maximum number of iterations or relaxations B&B algorithms require to reach optimality. It systematically accounts for different branching and node selection strategies, as well as heuristics integrated into B&B, ensuring a comprehensive certification framework. By offering theoretical guarantees and practical insights for solver customization, the proposed framework enhances the reliability of B&B for real-time application. The usefulness of the proposed framework is demonstrated through numerical experiments on both random MILPs and MIQPs, as well as on MIQPs arising from a hybrid MPC problem. © 2025, CC BY.

关键词： Mixed-integer linear programming

Parallel Domain-Decomposition Algorithms for Complexity Certification of Branch-and-Bound Algorithms for Mixed-Integer Linear and Quadratic Programming

学校读者我要写书评

暂无评论

arXiv 2025年

When implementing model predictive control (MPC) for hybrid systems with a linear or a quadratic performance measure, a mixed-integer linear program (MILP) or a mixed-integer quadratic program (MIQP) needs to be solved, respectively, at each sampling instant. Recent work has introduced the possibility to certify the computational complexity of branch-and-bound (B&B) algorithms when solving MILP and MIQP problems formulated as multi-parametric MILPs (mp-MILPs) and mp-MIQPs. Such a framework allows for computing the worst-case computational complexity of standard B&B-based MILP and MIQP solvers, quantified by metrics such as the total number of LP/QP iterations and B&B nodes. These results are highly relevant for real-time hybrid MPC applications. In this paper, we extend this framework by developing parallel, domain-decomposition versions of the previously proposed algorithm, allowing it to scale to larger problem sizes and enable the use of high-performance computing (HPC) resources. Furthermore, to reduce peak memory consumption, we introduce two modifications to the existing (serial) complexity certification framework, integrating them into the proposed parallel algorithms. Numerical experiments show that the parallel algorithms significantly reduce computation time while maintaining the correctness of the original framework. © 2025, CC BY.

关键词： Mixed-integer linear programming

Driver Behaviour Soft-Sensor based on Neurofuzzy systems and Weighted Projection on Principal Components

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Escaño, Juan Manuel Ridao-Olivar, Miguel A. Ierardi, Carmelina Sánchez, Adolfo J. Rouzbehi, Kumars Department of Systems Engineering and Automatic Control Universidad de Sevilla Sevilla41092 Spain Department of Engineering Universidad Loyola Andalucía Sevilla41704 Spain

This work has as main objective the development of a soft-sensor to classify, in real time, the behaviors of drivers when they are at the controls of a vehicle. Efficient classification of drivers’ behavior while driving, using only the measurements of the sensors already incorporated in the vehicles and without the need to add extra hardware (smart phones, cameras, etc.), is a challenge. The main advantage of using only the data center signals of modern vehicles is economical. The classification of the driving behavior and the warning to the driver of dangerous behaviors without the need to add extra hardware (and their software) to the vehicle, would allow the direct integration of these classifiers into the current vehicles without incurring a greater cost in the manufacture of the vehicles and therefore be an added value. In this work, the classification is obtained based only on speed, acceleration and inertial measurements which are already present in many modern vehicles. The proposed algorithm is based on a structure made by several Neurofuzzy systems with the combination of projected data in components of various Principal Component Analysis. A comparison with several types of classical classifying algorithms has been made. © 2025, CC BY.

关键词： Smartphones

A Fallback Localization Algorithm for Automated Vehicles Based on Object Detection and Tracking

学校读者我要写书评

暂无评论

IEEE Open Journal of Vehicular Technology

IEEE Open Journal of Vehicular Technology 2025年 6卷 1085-1099页

作者： Rodriguez-Arozamena, Mario Matute, Jose Araluce, Javier Kuschnig, Lukas Pilz, Christoph Schratter, Markus Rastelli, Joshue Perez Zubizarreta, Asier TECNALIA Derio48160 Spain University of the Basque Country UPV/EHU Department of Automatic Control and Systems Engineering Bilbao48013 Spain Virginia Tech Transportation Institute 3500 Transportation Research Plaza BlacksburgVA24061 United States Virtual Vehicle Research GmbH Department of Electrics Electronics and Software Graz8010 Austria CEIT-Basque Research and Technology Alliance Donostia-San Sebastián San Sebastián20009 Spain

Integrating Automated Vehicles (AVs) into everyday traffic is an ongoing challenge. Ensuring the safety of all involved agents, even in the presence of system failures, is crucial, especially in urban environments. This paper introduces a fallback-oriented localization algorithm for AVs designed to operate during main localization source failures. The method leverages stationary vehicles as dynamic landmarks, identified through the perception module, despite their initially unknown positions. By tracking relative positions before failure and applying trilateration, the algorithm estimates the ego vehicle's position. The proposed algorithm is evaluated through simulations, a real-world dataset, and practical tests on two vehicle models. The results include an average trajectory error of 0.62 m and 1.58 deg compared to the ground truth over different fallback maneuvers. This translates into an average relative translational error of 1.65% and a relative rotational error of 0.05 deg/m, improving the performance of an IMU-based dead reckoning and, hence, providing localization for performing safe stop maneuvers. © 2020 IEEE.

关键词： Tracking (position)

Development of automatic Cartesian Robot Cannabis Seeder using LabVIEW

学校读者我要写书评

暂无评论

Development of Automatic Cartesian Robot Cannabis Seeder usi...

International ECTI Northern Section Conference on Electrical, Electronics, Computer and Telecommunications engineering (ECTI-NCON)

作者： Rujipan Kosarat Keattipoom Sangwai Anan Wongjan Department of Software Engineering Faculty of Engineering Rajamangala University of Technology Lanna Chiangmai Thailand Department of Electronic Engineering and Automatic Control Systems Faculty of Engineering Rajamangala University of Technology Lanna Chiangmai Thailand

ISBN: (数字)9798331543273

ISBN: (纸本)9798331543280

This article describes the invention of autonomous cannabis seeding equipment to reduce contamination and planting time. The automated cannabis seeder employs an NI myRIO control board to operate a y-axis stepper motor attached to a ball screw to move along the breadth of each row of 14 seed trays. Soil drilling and burial Drill all holes at the same depth. This promotes seed germination and lowers human-seed germ contamination. These 7 soil drill heads and 7 seeders use 3D printers to design and shape the workpiece. An 800-watt air pump smokes the cannabis seeds. Linear electric motors function in two rows in the z-axis. The buffer reverses the drowning process from row 14 to the first row, starting from the 3rd row and continuing through the final series of steps until 14 rows in the y-axis are complete. The hardware controls all program activities in LabVIEW. We tested the automated cannabis seeding machine 100 times on average, sowing cannabis seeds into 98 seed trays and dropping 93 seeds at 94.80% efficiency in 10.38 minutes. A 16 percent faster machine than human work is available.

关键词： Technological innovation Motor drives Shape Soil Pulse width modulation Three-dimensional printing Seeds (agriculture) Printers Robots Contamination

CONVERGENCE ANALYSIS OF LINEARIZED q PENALTY METHODS FOR NONCONVEX OPTIMIZATION WITH NONLINEAR EQUALITY CONSTRAINTS

学校读者我要写书评

暂无评论

arXiv 2025年

作者： El Bourkhissi, Lahcen Necoara, Ion Department of Automatic Control and Systems Engineering National University of Science and Technology Politehnica Bucharest Romania Department of Automatic Control and Systems Engineering National University of Science and Technology Politehnica Bucharest Bucharest060042 Romania Gheorghe Mihoc-Caius Iacob Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy Bucharest050711 Romania

In this paper, we consider nonconvex optimization problems with nonlinear equality constraints. We assume that the objective function and the functional constraints are locally smooth. To solve this problem, we introduce a linearized q penalty based method, where q ∈ (1, 2] is the parameter defining the norm used in the construction of the penalty function. Our method involves linearizing the objective function and functional constraints in a Gauss-Newton fashion at the current iteration in the penalty formulation and introduces a quadratic regularization. This approach yields an easily solvable subproblem, whose solution becomes the next iterate. By using a novel dynamic rule for the choice of the regularization parameter, we establish that the iterates of our method converge to an ǫ-first-order solution in O(1/ǫ2+(q−1)/q) outer iterations. Finally, we put theory into practice and evaluate the performance of the proposed algorithm by making numerical comparisons with existing methods from literature. © 2025, CC BY.

关键词： Numerical methods

Design of a Navigation Function for a Polyhedral World 16th

学校读者我要写书评

暂无评论

Design of a Navigation Function for a Polyhedral World

16th APCA International Conference on automatic control and Soft Computing, controlO 2024

作者： Nicu, Theodor-Gabriel Stoican, Florin Ioan, Daniel Prodan, Ionela Department of Automatic Control and Systems Engineering Romania National University of Science and Technology "Politehnica" Bucharest 313 Splaiul Independenţei Bucharest060042 Romania Univ. Grenoble Alpes Grenoble INP Institute of Engineering and Management LCIS Valence26000 France

ISBN: (纸本)9783031817236

This work pertains to the generation of navigation functions for obstacle avoidance and target tracking. One initially defines a so-called spherical world which can be further mapped into many other different topologies using a series of diffeomorphic transformations. This specific configuration further allows one to exploit the main advantages of the sum function approach with respect to the obstacle collision avoidance capabilities of an agent, sum function which is used in order to induce an effective navigation function judging not only from computational perspective, but also from the local minima point of view. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Topology

Pose-graph optimization for efficient tie-point matching and 3D scene reconstruction from oblique UAV images

学校读者我要写书评

暂无评论

ISPRS Journal of Photogrammetry and Remote Sensing 2025年 225卷 461-491页

作者： Xu, Zhihua Niu, Yongze Jiang, Jincheng Qin, Rongjun Cui, Ximin College of Geoscience and Surveying Engineering China University of Mining and Technology-Beijing Beijing100083 China North Automatic Control Technology Institute Shanxi Taiyuan030006 China School of Intelligent Systems Engineering Sun Yat-sen University Guangdong Shenzhen518107 China Department of Civil Environmental and Geodetic Engineering The Ohio State University 2036 Neil Avenue ColumbusOH43210 United States Department of Electrical and Computer Engineering The Ohio State University Dreese Laboratories 205 2015 Neil Ave ColumbusOH43210 United States Translational Data Analytics Institute The Ohio State University 1760 Neil Ave ColumbusOH43210 United States

Oblique photogrammetry using unmanned aerial vehicles (UAV) is crucial to 3D scene reconstruction. Nevertheless, oblique images are generally acquired with large overlaps, and sometimes with multiple views. Although this increases the level of data completeness, it introduces additional and sometimes redundant computations in tie-point matching, creating overly dense camera connections in the pose graph for bundle adjustment (BA). This study optimizes the pose graph of oblique UAV images by removing redundant image connections to guide tie-point matching. Assuming a five-camera system for oblique image collection, a pose graph called a topologically connected camera network (TCN) was initially constructed using position and orientation system (POS) data to determine the spatial connectivity among oblique images. Second, five geometric meta-parameters of overlapping images were constructed, and their influence on tie-point matching was analyzed using a data-driven approach to generate a weighted pose graph. Third, the weighted pose graph was simplified to a degree-bounded skeletal camera network (D-SCN) using the proposed two-stage multi-objective graph optimization approach. Finally, the D-SCN was embedded into a structure from motion (SfM) pipeline to produce a novel D-SCN–SfM method to reduce the required computations for tie-point matching. The proposed D-SCN-SfM method was tested using data from three large sites, each containing over 5,000 images. In addition, the D-SCN-SfM method was compared with three state-of-the-art methods. The experimental results indicate that our method can significantly reduce the required computations for tie-point matching to 1/14–1/20 as compared to a method that uses only topological constraints, that is, TCN, saving 89–92% of the time expenditure. Furthermore, the accuracy and completeness of the 3D geometry produced by the proposed method were comparable to those produced by standard SfM methods. The source code of our approach

关键词： Drones

Enhancing Thin-Film Wafer Inspection With A Multi-Sensor Array And Robot Constraint Maintenance

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Sánchez-Arriaga, Néstor Eduardo Canzini, Ethan Espley-Plumb, Nathan John Farnsworth, Michael Pope, Simon Leyland, Adrian Tiwari, Ashutosh Department of Automatic Control & Systems Engineering University of Sheffield Sheffield United Kingdom Department of Materials Science & Engineering University of Sheffield Sheffield United Kingdom Airbus Robotics Airbus UK Chester United Kingdom

Thin-film inspection on large-area substrates in coating manufacture remains a critical parameter to ensure product quality;however, extending the inspection process precisely over a large area presents major challenges, due to the limitations of the available inspection equipment. An additional manipulation problem arises when automating the inspection process, as the silicon wafer requires movement constraints to ensure accurate measurements and to prevent damage. Furthermore, there are other increasingly important large-area industrial applications, such as Roll-to-Roll (R2R) manufacturing where coating thickness inspection introduces additional challenges. This paper presents an autonomous inspection system using a robotic manipulator with a novel learned constraint manifold to control a wafer to its calibration point, and a novel multi-sensor array with high potential for scalability into large substrate areas. We demonstrate that the manipulator can perform required motions whilst adhering to movement constraints. We further demonstrate that the sensor array can perform thickness measurements statically with an error of 0.5◦ from the calibration point whilst monitoring the RMSE and R2 over 1406 data points. These features are potentially useful for detecting displacement variations in R2R manufacturing processes. © 2025, CC BY-NC-ND.

关键词： Silicon wafers