To see the other types of publications on this topic, follow the link: Multiple constraints.

Journal articles on the topic 'Multiple constraints'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Multiple constraints.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

TYAN, CHING-YU, PAUL P. WANG, and DENNIS R. BAHLER. "THE DESIGN OF AN ADAPTIVE MULTIPLE AGENT FUZZY CONSTRAINT-BASED CONTROLLER (MAFCC) FOR A COMPLEX HYDRAULIC SYSTEM." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 04, no. 06 (1996): 537–51. http://dx.doi.org/10.1142/s0218488596000299.

Full text
Abstract:
In this paper, we present a complete design framework for an adaptive multiple agent fuzzy constraint-based controller (MAFCC) based on fuzzy penumbra constraint processing in each fuzzy constraint subnetwork collaborating with a connected constraint network and its corresponding semantic modeling in a first-order predicate calculus (FOPC) language, with application to a complex hydraulic system. The concept of “multiple agent” and “fuzzy constraint subnetwork” in a complex control system is introduced and some basic definitions of penumbra fuzzy constraint processing in a constraint subnetwor
APA, Harvard, Vancouver, ISO, and other styles
2

Yu, Chun-Mei, Dang-Jun Zhao, and Ye Yang. "Efficient Convex Optimization of Reentry Trajectory via the Chebyshev Pseudospectral Method." International Journal of Aerospace Engineering 2019 (May 2, 2019): 1–9. http://dx.doi.org/10.1155/2019/1414279.

Full text
Abstract:
A novel sequential convex (SCvx) optimization scheme via the Chebyshev pseudospectral method is proposed for efficiently solving the hypersonic reentry trajectory optimization problem which is highly constrained by heat flux, dynamic pressure, normal load, and multiple no-fly zones. The Chebyshev-Gauss Legend (CGL) node points are used to transcribe the original dynamic constraint into algebraic equality constraint; therefore, a nonlinear programming (NLP) problem is concave and time-consuming to be solved. The iterative linearization and convexification techniques are proposed to convert the
APA, Harvard, Vancouver, ISO, and other styles
3

Huang, C. W., and K. W. Chou. "Volume Adjustable Topology Optimization with Multiple Displacement Constraints." Journal of Mechanics 34, no. 6 (2017): 759–70. http://dx.doi.org/10.1017/jmech.2017.68.

Full text
Abstract:
AbstractMost topology optimization methods seek optimal topologies that satisfy a minimum compliance with a pre-specified volume constraint in the design domain. However, practical designs often include various functional constraints and the optimal solid volume ratios are unknown a priori, which implies a gap between topology optimization methods and practical designs in industries. This paper studies the performance-based topology optimization (PTO) problem that searches for the optimal topology with minimum compliance to satisfy the pre-specified functional constraints without a pre-specifi
APA, Harvard, Vancouver, ISO, and other styles
4

Huang, Gang, Min Hu, Xueying Yang, Xun Wang, Yijun Wang, and Feiyao Huang. "A Review of Constrained Multi-Objective Evolutionary Algorithm-Based Unmanned Aerial Vehicle Mission Planning: Key Techniques and Challenges." Drones 8, no. 7 (2024): 316. http://dx.doi.org/10.3390/drones8070316.

Full text
Abstract:
UAV mission planning is one of the core problems in the field of UAV applications. Currently, mission planning needs to simultaneously optimize multiple conflicting objectives and take into account multiple mutually coupled constraints, and traditional optimization algorithms struggle to effectively address these difficulties. Constrained multi-objective evolutionary algorithms have been proven to be effective methods for solving complex constrained multi-objective optimization problems and have been gradually applied to UAV mission planning. However, recent advances in this area have not been
APA, Harvard, Vancouver, ISO, and other styles
5

Huang, Yue. "Heterogeneous Data Clustering Considering Multiple User-provided Constraints." International Journal of Computers Communications & Control 14, no. 2 (2019): 170–82. http://dx.doi.org/10.15837/ijccc.2019.2.3419.

Full text
Abstract:
Clustering on heterogeneous networks which consist of multi-typed objects and links has proved to be a useful technique in many scenarios. Although numerous clustering methods have achieved remarkable success, current clustering methods for heterogeneous networks tend to consider only internal information of the dataset. In order to utilize background domain knowledge, we propose a general framework for clustering heterogeneous data considering multiple user-provided constrains. Specifically, we summarize that three types of manual constraints on the object can be used to guide the clustering
APA, Harvard, Vancouver, ISO, and other styles
6

Srivatsan, R., D. A. Hoeltzel, and A. Das. "An Analytical Method for the Identification of Redundant Constraints in Multiple-Loop Spatial Mechanisms." Journal of Mechanical Design 115, no. 2 (1993): 324–31. http://dx.doi.org/10.1115/1.2919195.

Full text
Abstract:
An analytical method for the explicit identification of redundant constraints in multiple-loop spatial mechanisms is presented. The kinematic constraint equations for each independent loop of multiple-loop mechanisms are developed. The independence of these equations is established and used to detect the presence of redundant constraints. The nature of the redundant constraints present is indicated by the type of redundant kinematic constraint equations present. Interaction of the constraints of adjacent loops in a multiple-loop mechanism also has to be taken into account. An example which ill
APA, Harvard, Vancouver, ISO, and other styles
7

Barhorst, A. A., and L. J. Everett. "Contact/Impact in Hybrid Parameter Multiple Body Mechanical Systems." Journal of Dynamic Systems, Measurement, and Control 117, no. 4 (1995): 559–69. http://dx.doi.org/10.1115/1.2801115.

Full text
Abstract:
The multiple motion regime (free/constrained) dynamics of hybrid parameter multiple body (HPMB) systems is addressed. Impact response has characteristically been analyzed using impulse-momentum techniques. Unfortunately, the classical methods for modeling complex HPMB systems are energy based and have proven ineffectual at modeling impact. The problems are exacerbated by the problematic nature of time varying constraint conditions. This paper outlines the reformulation of a recently developed HPMB system modeling methodology into an impulse-momentum formulation, which systematically handles th
APA, Harvard, Vancouver, ISO, and other styles
8

Coroianu, Lucian, Robert Fullér, Marek Gagolewski, and Simon James. "Constrained ordered weighted averaging aggregation with multiple comonotone constraints." Fuzzy Sets and Systems 395 (September 2020): 21–39. http://dx.doi.org/10.1016/j.fss.2019.09.006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kong, Feng, and Dong Dou. "Resource-Constrained Project Scheduling Problem under Multiple Time Constraints." Journal of Construction Engineering and Management 147, no. 2 (2021): 04020170. http://dx.doi.org/10.1061/(asce)co.1943-7862.0001990.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Plenert, Gerhard. "Optimizing theory of constraints when multiple constrained resources exist." European Journal of Operational Research 70, no. 1 (1993): 126–33. http://dx.doi.org/10.1016/0377-2217(93)90237-h.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Galison, Peter. "Multiple Constraints, Simultaneous Solutions." PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988, no. 2 (1988): 157–63. http://dx.doi.org/10.1086/psaprocbienmeetp.1988.2.192880.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Li, Chengming, Li Liu, Zhaoxin Dai, and Xiaoli Liu. "Different Sourcing Point of Interest Matching Method Considering Multiple Constraints." ISPRS International Journal of Geo-Information 9, no. 4 (2020): 214. http://dx.doi.org/10.3390/ijgi9040214.

Full text
Abstract:
Point of interest (POI) matching is critical but is the most technically difficult part of multi-source POI fusion. The accurate matching of POIs from different sources is important for the effective reuse of POI data. However, the existing research on POI matching usually adopts weak constraints, which leads to a low POI matching accuracy. To address the shortcomings of previous studies, this paper proposes a POI matching method with multiple determination constraints. First, according to various attributes (name, class, and spatial location), a new calculation model considering spatial topol
APA, Harvard, Vancouver, ISO, and other styles
13

Yu, Haidong, Jian Zhang, and Hao Wang. "Dynamic performance of over-constrained planar mechanisms with multiple revolute clearance joints." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 232, no. 19 (2017): 3524–37. http://dx.doi.org/10.1177/0954406217738032.

Full text
Abstract:
The clearances of joints in a rigid multibody system may deteriorate the motion accuracy and even cause vibrations, noise and fatigue failure of structures. In over-constrained mechanisms, the number of degree-of-freedoms is more than that of independent coordinates which leads to numerical challenges in solving the underdetermined force equilibrium equations. A comprehensive study on the dynamic model and the performance of an over-constrained planar parallelogram mechanism with multiple clearance joints is presented in this paper. Since a common angular coordinate exists in the clearance joi
APA, Harvard, Vancouver, ISO, and other styles
14

Jiang, Hao, Tien Mai, Pradeep Varakantham, and Huy Hoang. "Reward Penalties on Augmented States for Solving Richly Constrained RL Effectively." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 18 (2024): 19867–75. http://dx.doi.org/10.1609/aaai.v38i18.29962.

Full text
Abstract:
Constrained Reinforcement Learning employs trajectory-based cost constraints (such as expected cost, Value at Risk, or Conditional VaR cost) to compute safe policies. The challenge lies in handling these constraints effectively while optimizing expected reward. Existing methods convert such trajectory-based constraints into local cost constraints, but they rely on cost estimates, leading to either aggressive or conservative solutions with regards to cost. We propose an unconstrained formulation that employs reward penalties over states augmented with costs to compute safe policies. Unlike stan
APA, Harvard, Vancouver, ISO, and other styles
15

Nilasari, Laylatul Febriana, Kiswara Agung Santoso, and Abduh Riski. "PENERAPAN DRAGONFLY OPTIMIZATION ALGORITHM (DOA) PADA PERMASALAHAN MULTIPLE CONSTRAINTS BOUNDED KNAPSACK." Majalah Ilmiah Matematika dan Statistika 19, no. 1 (2019): 39. http://dx.doi.org/10.19184/mims.v19i1.17264.

Full text
Abstract:
Optimization is very useful in almost all fields in running a business effectively and efficiently to achieve the desired results. This study solves the problem of multiple constraints bounded knapsack by implementing DOA. The problem of multiple constraints bounded knapsack has more than ones constraint with objects that are entered into the storage media, the dimensions can be partially or completely included, but the number of objects is limited. The purpose of this study is to determine the results of using DOA to solve multiple constraits bounded knapsack and the effectiveness of DOA comp
APA, Harvard, Vancouver, ISO, and other styles
16

Brosowsky, Mathis, Florian Keck, Olaf Dünkel, and Marius Zöllner. "Sample-Specific Output Constraints for Neural Networks." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 8 (2021): 6812–21. http://dx.doi.org/10.1609/aaai.v35i8.16841.

Full text
Abstract:
It is common practice to constrain the output space of a neural network with the final layer to a problem-specific value range. However, for many tasks it is desired to restrict the output space for each input independently to a different subdomain with a non-trivial geometry, e.g. in safety-critical applications, to exclude hazardous outputs sample-wise. We propose ConstraintNet—a scalable neural network architecture which constrains the output space in each forward pass independently. Contrary to prior approaches, which perform a projection in the final layer, ConstraintNet applies an input-
APA, Harvard, Vancouver, ISO, and other styles
17

Chen, Zhiping, Shen Peng, and Abdel Lisser. "A sparse chance constrained portfolio selection model with multiple constraints." Journal of Global Optimization 77, no. 4 (2020): 825–52. http://dx.doi.org/10.1007/s10898-020-00901-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Fan, Yafeng, Jing Jiang, and Zuohao Hu. "More or less? The effects of financial constraints on variety-seeking behavior." Journal of Contemporary Marketing Science 3, no. 2 (2020): 195–205. http://dx.doi.org/10.1108/jcmars-01-2020-0004.

Full text
Abstract:
PurposeIn daily life, consumers usually experience economic limitations on their consumption, which in turn results in experiencing financial constraints. The purpose of this article is to examine how feeling financially constrained influences variety seeking in consumption.Design/methodology/approachThe authors conducted three experiments to test the proposed hypotheses by applying multiple methods of manipulation of financial constraints and different measures of variety seeking.FindingsThe authors found that feeling financially constrained increases consumers’ insecurity, which in turn decr
APA, Harvard, Vancouver, ISO, and other styles
19

Pan, Yiyong. "Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem." Mathematical Problems in Engineering 2019 (June 27, 2019): 1–13. http://dx.doi.org/10.1155/2019/3987278.

Full text
Abstract:
The study focuses on a multiple constrained reliable path problem in which travel time reliability and resource constraints are collectively considered. Nonlinear optimization model is developed to model constrained robust shortest path problem. The dual nature of the proposed problem is deduced based on the Lagrangian duality theory. An efficient algorithm based on Lagrangian dual relaxation is designed to solve constrained robust shortest path problem. An extension problem that considers multiple constraints is discussed. Numerical studies indicate that the proposed algorithm is efficient in
APA, Harvard, Vancouver, ISO, and other styles
20

Li, Dong, Suping Peng, Rui Zhang, Yinling Guo, Yongxu Lu, and Xiaoqin Cui. "Prestack seismic inversion with structural constraints." Interpretation 9, no. 2 (2021): T495—T506. http://dx.doi.org/10.1190/int-2020-0209.1.

Full text
Abstract:
Prestack seismic inversion usually suffers from a lower signal-to-noise ratio, which could result in unstable inversion results. The conventional multitrace lateral constrained inversion blurs steeply dipping layers, whereas the simple structural constrained inversion is affected by noise. To solve this issue, an inversion method with multiple constraints is proposed, which include (1) a local smoothing operator is used to suppress the inversion anomalies caused by data noise, (2) a difference operator is used to protect the stratum boundary, and (3) a structural dipping constraint is used to
APA, Harvard, Vancouver, ISO, and other styles
21

Chawak, Chaitanya, Francisco Villaescusa-Navarro, Nicolás Echeverri-Rojas, Yueying Ni, ChangHoon Hahn, and Daniel Anglés-Alcázar. "Cosmology with Multiple Galaxies." Astrophysical Journal 969, no. 2 (2024): 105. http://dx.doi.org/10.3847/1538-4357/ad4969.

Full text
Abstract:
Abstract Recent works have discovered a relatively tight correlation between Ωm and the properties of individual simulated galaxies. Because of this, it has been shown that constraints on Ωm can be placed using the properties of individual galaxies while accounting for uncertainties in astrophysical processes such as feedback from supernovae and active galactic nuclei. In this work, we quantify whether using the properties of multiple galaxies simultaneously can tighten those constraints. For this, we train neural networks to perform likelihood-free inference on the value of two cosmological p
APA, Harvard, Vancouver, ISO, and other styles
22

MYERS, GENE, SANFORD SELZNICK, ZHENG ZHANG, and WEBB MILLER. "Progressive Multiple Alignment with Constraints." Journal of Computational Biology 3, no. 4 (1996): 563–72. http://dx.doi.org/10.1089/cmb.1996.3.563.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Kurlander, David, and Steven Feiner. "Inferring constraints from multiple snapshots." ACM Transactions on Graphics 12, no. 4 (1993): 277–304. http://dx.doi.org/10.1145/159730.159731.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Trommer, Jochen. "Constraints on multiple-feature mutation." Lingua 122, no. 11 (2012): 1182–92. http://dx.doi.org/10.1016/j.lingua.2012.05.007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Jiao, Ying, Olivier Klopfenstein, and Peter Tankov. "Hedging under multiple risk constraints." Finance and Stochastics 21, no. 2 (2017): 361–96. http://dx.doi.org/10.1007/s00780-017-0326-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Prasanth, Ravi K., and Mario A. Rotea. "Interpolation with multiple norm constraints." Mathematics of Control, Signals, and Systems 10, no. 2 (1997): 165–87. http://dx.doi.org/10.1007/bf01213384.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Bauer, Mark. "Multiple Realizability, Constraints, and Identity." Pacific Philosophical Quarterly 94, no. 4 (2013): 446–64. http://dx.doi.org/10.1111/papq.12008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Patt-Shamir, Boaz, and Dror Rawitz. "Video distribution under multiple constraints." Theoretical Computer Science 412, no. 29 (2011): 3717–30. http://dx.doi.org/10.1016/j.tcs.2011.03.031.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Williams, Carmen Braun. "Counseling African American Women: Multiple Identities-Multiple Constraints." Journal of Counseling & Development 83, no. 3 (2005): 278–83. http://dx.doi.org/10.1002/j.1556-6678.2005.tb00343.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Zheng, Xiaobo, Feiran Xia, Defu Lin, Tianyu Jin, Wenshan Su, and Shaoming He. "Constrained Parameterized Differential Dynamic Programming for Waypoint-Trajectory Optimization." Aerospace 11, no. 6 (2024): 420. http://dx.doi.org/10.3390/aerospace11060420.

Full text
Abstract:
Unmanned aerial vehicles (UAVs) are required to pass through multiple important waypoints as quickly as possible in courier delivery, enemy reconnaissance and other tasks to eventually reach the target position. There are two important problems to be solved in such tasks: constraining the trajectory to pass through intermediate waypoints and optimizing the flight time between these waypoints. A constrained parameterized differential dynamic programming (C-PDDP) algorithm is proposed for meeting multiple waypoint constraints and free-time constraints between waypoints to deal with these two iss
APA, Harvard, Vancouver, ISO, and other styles
31

Chevalier, Aline, and Julien Cegarra. "A Constraint-Satisfaction Approach to Studying the Management of Multiple Objectives in Design Problem-Solving." Psychological Reports 99, no. 2 (2006): 488–93. http://dx.doi.org/10.2466/pr0.99.2.488-493.

Full text
Abstract:
How professional and novice designers manage multiple objectives through constraint satisfaction was studied. An objective is defined as a network of constraints; a constraint is characterized as related to a source (internal or external) and an addressee (e.g., client or user). It has been shown that designers favour objectives related to external constraint (e.g., data from the task) and to the client. Generally, client and external constraints are identical. To study the management of multiple objectives, fifteen web site designers were instructed to design a site according to user's object
APA, Harvard, Vancouver, ISO, and other styles
32

Zhuang, Yongjie, and Yangfan Liu. "A constrained adaptive active noise control filter design method via online convex optimization." Journal of the Acoustical Society of America 152, no. 4 (2022): A98. http://dx.doi.org/10.1121/10.0015669.

Full text
Abstract:
In practical active noise control (ANC) applications, various types of constraints may need to be satisfied, e.g., robust stability, disturbance enhancement, and filter output power constraint. Some adaptive filters such as leaky LMS have been developed to apply required constraints indirectly. However, when multiple constraints are required simultaneously, satisfactory noise performance is difficult to achieve by tuning only one leaky factor. Another filter design approach that may achieve better noise control performance is to solve a constrained optimization problem. But the computational c
APA, Harvard, Vancouver, ISO, and other styles
33

Naderiparizi, Saeid, Xiaoxuan Liang, Berend Zwartsenberg, and Frank Wood. "Constrained Generative Modeling with Manually Bridged Diffusion Models." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 18 (2025): 19607–15. https://doi.org/10.1609/aaai.v39i18.34159.

Full text
Abstract:
In this paper we describe a novel framework for diffusion-based generative modeling on constrained spaces. In particular, we introduce manual bridges, a framework that expands the kinds of constraints that can be practically used to form so-called diffusion bridges. We develop a mechanism for combining multiple such constraints so that the resulting multiply-constrained model remains a manual bridge that respects all constraints. We also develop a mechanism for training a diffusion model that respects such multiple constraints while also adapting it to match a data distribution. We develop and
APA, Harvard, Vancouver, ISO, and other styles
34

Karlsson, Fred. "Constraints on multiple initial embedding of clauses." International Journal of Corpus Linguistics 12, no. 1 (2007): 107–18. http://dx.doi.org/10.1075/ijcl.12.1.07kar.

Full text
Abstract:
The received view is that there are no constraints on clausal embedding complexity in sentences. This hypothesis will be challenged here on empirical grounds from the viewpoint of multiple initial embedding of clauses. The data come from the British National Corpus, Brown, LOB, and philological scholarship. The results extend to several other ‘Standard Average European’ (SAE) languages like Finnish, German, Latin, and Swedish. There is a precise quantitative constraint on the degree of initial clausal embedding, and that limit is two. In double initial embeddings, a qualitative constraint pres
APA, Harvard, Vancouver, ISO, and other styles
35

Zhang, Man, Ru Chang, and Ying Wang. "Prescribed Performance Tracking Control for Nonlinear Stochastic Time-Delay Systems with Multiple Constraints." Actuators 14, no. 1 (2025): 19. https://doi.org/10.3390/act14010019.

Full text
Abstract:
This paper proposes a prescribed performance tracking control scheme for a category of nonlinear stochastic time-delay systems with input saturation and state asymmetric time-varying constraints. First, to solve the non-differentiable problem caused by input saturation, a smooth nonlinear function was utilized to approximate the saturation function. A nonlinear mapping technique was employed to transform the constrained problem into a bounded convergence problem. The time-delay problem was then solved by constructing the corresponding Lyapunov–Krasovskii function. The error feedback controller
APA, Harvard, Vancouver, ISO, and other styles
36

Tan, Onur, Deniz Gündüz, and Vilardebó Jesús Gómez. "Linear Transmission of Composite Gaussian Measurements over a Fading Channel under Delay Constraints." IEEE Transactions on Wireless Communications 15, no. 6 (2016): 4335–47. https://doi.org/10.1109/TWC.2016.2539961.

Full text
Abstract:
Delay constrained linear transmission (LT) strategies are considered for the transmission of composite Gaussian measurements over an additive white Gaussian noise fading channel under an average power constraint. If the channel state information (CSI) is known by both the encoder and decoder, the optimal LT scheme in terms of the average mean-square error distortion is characterized under a strict delay constraint, and a graphical interpretation of the optimal power allocation strategy is presented. Then, for general delay constraints, two LT strategies are proposed based on the solution to a
APA, Harvard, Vancouver, ISO, and other styles
37

Yang, Yandi, and Naser El-Sheimy. "M-GCLO: Multiple Ground Constrained LiDAR Odometry." ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences X-1-2024 (May 9, 2024): 283–88. http://dx.doi.org/10.5194/isprs-annals-x-1-2024-283-2024.

Full text
Abstract:
Abstract. Accurate LiDAR odometry results contribute directly to high-quality point cloud maps. However, traditional LiDAR odometry methods drift easily upward, leading to inaccuracies and inconsistencies in the point cloud maps. Considering abundant and reliable ground points in the Mobile Mapping System(MMS), ground points can be extracted, and constraints can be built to eliminate pose drifts. However, existing LiDAR-based odometry methods either do not use ground point cloud constraints or consider the ground plane as an infinite plane (i.e., single ground constraint), making pose estimati
APA, Harvard, Vancouver, ISO, and other styles
38

Pankayaraj, Pathmanathan, and Pradeep Varakantham. "Constrained Reinforcement Learning in Hard Exploration Problems." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 12 (2023): 15055–63. http://dx.doi.org/10.1609/aaai.v37i12.26757.

Full text
Abstract:
One approach to guaranteeing safety in Reinforcement Learning is through cost constraints that are dependent on the policy. Recent works in constrained RL have developed methods that ensure constraints are enforced even at learning time while maximizing the overall value of the policy. Unfortunately, as demonstrated in our experimental results, such approaches do not perform well on complex multi-level tasks, with longer episode lengths or sparse rewards. To that end, we propose a scalable hierarchical approach for constrained RL problems that employs backward cost value functions in the conte
APA, Harvard, Vancouver, ISO, and other styles
39

Yu, Hao, and Vincent K. N. Lau. "Rank-Constrained Schur-Convex Optimization With Multiple Trace/Log-Det Constraints." IEEE Transactions on Signal Processing 59, no. 1 (2011): 304–14. http://dx.doi.org/10.1109/tsp.2010.2084997.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Mensah, Joseph Agyapong, Louis Asiedu, Felix O. Mettle, and Samuel Iddi. "Assessing the Performance of DWT-PCA/SVD Face Recognition Algorithm under Multiple Constraints." Journal of Applied Mathematics 2021 (September 20, 2021): 1–12. http://dx.doi.org/10.1155/2021/7060270.

Full text
Abstract:
Many architectures of face recognition modules have been developed to tackle the challenges posed by varying environmental constraints such as illumination, occlusions, pose, and expressions. These recognition systems have mainly focused on a single constraint at a time and have achieved remarkable successes. However, the presence of multiple constraints may deteriorate the performance of these face recognition systems. In this study, we assessed the performance of Principal Component Analysis and Singular Value Decomposition using Discrete Wavelet Transform (DWT-PCA/SVD) for preprocessing fac
APA, Harvard, Vancouver, ISO, and other styles
41

Xue, Kai, Zeyu Xu, Ping Wang, Qiuhong Li, Zhiqin Huang, and Decheng Kong. "Optimized Multiple Unmanned Surface Vehicle Strategies for Target Tracking with Field of View Constraints." Journal of Marine Science and Engineering 13, no. 5 (2025): 889. https://doi.org/10.3390/jmse13050889.

Full text
Abstract:
Unmanned surface vehicles (USVs) have garnered significant interest due to their potential in various maritime applications, particularly target tracking. However, when USVs perform rotational motion around a target, their operations are often hindered by limited fields of view (FOVs) within formations. In this paper, we establish a constraint propagation model to integrate formation constraints, motion constraints, and FOV constraints. Then, we propose four strategies to enforce FOV constraints. The proposed strategies are divided into two categories: those that adjust formation radius and th
APA, Harvard, Vancouver, ISO, and other styles
42

Ge, Dongming, Guanghui Sun, and Hamid Reza Karimi. "Robust Anti-Windup Control Considering Multiple Design Objectives." Mathematical Problems in Engineering 2012 (2012): 1–13. http://dx.doi.org/10.1155/2012/586279.

Full text
Abstract:
A new saturation control technique is proposed to design multiobjective and robust anti-windup controllers for linear systems with input saturations. Based on the characterization of saturation nonlinearities and modeling uncertainties via integral quadratic constraints (IQCs), this method considers a mixedH2/H∞performance indexes while maintaining dynamic constraints on the controller. The analysis and synthesis conditions are presented in terms of scaled linear matrix inequalities (LMIs). The proposed control algorithm can improve the performance of the input-constrained system while also gu
APA, Harvard, Vancouver, ISO, and other styles
43

Baheri, Ali. "Multilevel Constrained Bandits: A Hierarchical Upper Confidence Bound Approach with Safety Guarantees." Mathematics 13, no. 1 (2025): 149. https://doi.org/10.3390/math13010149.

Full text
Abstract:
The multi-armed bandit (MAB) problem is a foundational model for sequential decision-making under uncertainty. While MAB has proven valuable in applications such as clinical trials and online advertising, traditional formulations have limitations; specifically, they struggle to handle three key real-world scenarios: (1) when decisions must follow a hierarchical structure (as in autonomous systems where high-level strategy guides low-level actions); (2) when there are constraints at multiple levels of decision-making (such as both system-wide and component-level resource limits); and (3) when a
APA, Harvard, Vancouver, ISO, and other styles
44

Yang, Bin, Zeyu Yang, and Ding Wang. "A Lagrangian Multiplier Method for TDOA and FDOA Positioning of Multiple Disjoint Sources with Distance and Velocity Correlation Constraints." Mathematical Problems in Engineering 2020 (June 16, 2020): 1–23. http://dx.doi.org/10.1155/2020/1382321.

Full text
Abstract:
This paper considers the source localization problem using time differences of arrival (TDOA) and frequency differences of arrival (FDOA) for multiple disjoint sources moving together with constraints on their distances and velocity correlation. To make full use of the synergistic improvement of multiple source localization, the constraints on all sources are combined together to obtain the optimal result. Unlike the existing methods that can achieve the normal Cramér-Rao lower bound (CRLB), our object is to further improve the accuracy of the estimation with constraints. On the basis of maxim
APA, Harvard, Vancouver, ISO, and other styles
45

Ye, Tie Li, Lu Ling An, Li Gao, and Qing Liang Zeng. "Constraint-Based Synchronous Fitting of Surfaces." Key Engineering Materials 419-420 (October 2009): 437–40. http://dx.doi.org/10.4028/www.scientific.net/kem.419-420.437.

Full text
Abstract:
Constraint-based model reconstruction is one of the key research problems in recent reverse engineering. Surfaces of structural parts are mostly quadratic and have mutual constraints. Aiming at this feature, the paper proposes a method for conducting constraint-based synchronous fitting on multiple surfaces. Synchronous fitting is carried out through constraint optimization method, the constraints among surfaces can be maintained and the original design intents incarnated.
APA, Harvard, Vancouver, ISO, and other styles
46

Duan, Jianqiao, Yuchun Huang, Yuyan Wang, Xi Ye, and He Yang. "Multipath-Closure Calibration of Stereo Camera and 3D LiDAR Combined with Multiple Constraints." Remote Sensing 16, no. 2 (2024): 258. http://dx.doi.org/10.3390/rs16020258.

Full text
Abstract:
Stereo cameras can capture the rich image textures of a scene, while LiDAR can obtain accurate 3D coordinates of point clouds of a scene. They complement each other and can achieve comprehensive and accurate environment perception through data fusion. The primary step in data fusion is to establish the relative positional relationship between the stereo cameras and the 3D LiDAR, known as extrinsic calibration. Existing methods establish the camera–LiDAR relationship by constraints of the correspondence between different planes in the images and point clouds. However, these methods depend on th
APA, Harvard, Vancouver, ISO, and other styles
47

Do, Anh Viet, and Frank Neumann. "Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 14 (2021): 12284–92. http://dx.doi.org/10.1609/aaai.v35i14.17458.

Full text
Abstract:
In this study, we consider the subset selection problems with submodular or monotone discrete objective functions under partition matroid constraints where the thresholds are dynamic. We focus on POMC, a simple Pareto optimization approach that has been shown to be effective on such problems. Our analysis departs from singular constraint problems and extends to problems of multiple constraints. We show that previous results of POMC's performance also hold for multiple constraints. Our experimental investigations on random undirected maxcut problems demonstrate POMC's competitiveness against th
APA, Harvard, Vancouver, ISO, and other styles
48

Gong, Yue, and Jia Nan Wang. "Research of Multiple Constrained Qos Routing Based on Improved Ant Colony Algorithm." Applied Mechanics and Materials 513-517 (February 2014): 994–98. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.994.

Full text
Abstract:
This paper mainly discusses the Multiple Constrained Qos Routing Algorithm, in the analysis of the basic on the basis of mathematical model of Qos routing. It has proposed a routing model with an objective function, integrated optimization of multiple Qos constraints. Finally, the optimization of ant colony algorithm applied to solve the problem of multiple constraints Qos. Through simulation experiments proved that the algorithm to find the path to maximum degree meets Qos requirements.
APA, Harvard, Vancouver, ISO, and other styles
49

Moorthy, Yamuna K., Sakuntala S. Pillai, and G. Shiny. "Energy-Efficient Multiple Relay Selection in Cognitive Radio Networks." Defence Science Journal 68, no. 3 (2018): 295. http://dx.doi.org/10.14429/dsj.68.11758.

Full text
Abstract:
Cognitive Radios play very important role in military applications due to their capability to adapt intelligently according to the prevailing environmental conditions. Relays form the main communication enablers in infrastructure-less networks. In this paper, relay selection for increasing the energy efficiency of a cognitive radio network is considered. The proposed approach considers the multiple - relay selection scheme with strict outage probability constraints. Energy maximisation is posed as an optimisation problem, the solution to which shows that relay selection under outage constraint
APA, Harvard, Vancouver, ISO, and other styles
50

Miguel de Almeida Areias, Pedro, Timon Rabczuk, and Joaquim Infante Barbosa. "The extended unsymmetric frontal solution for multiple-point constraints." Engineering Computations 31, no. 7 (2014): 1582–607. http://dx.doi.org/10.1108/ec-10-2013-0263.

Full text
Abstract:
Purpose – The purpose of this paper is to discuss the linear solution of equality constrained problems by using the Frontal solution method without explicit assembling. Design/methodology/approach – Re-written frontal solution method with a priori pivot and front sequence. OpenMP parallelization, nearly linear (in elimination and substitution) up to 40 threads. Constraints enforced at the local assembling stage. Findings – When compared with both standard sparse solvers and classical frontal implementations, memory requirements and code size are significantly reduced. Research limitations/impl
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!