Conecte-se

Bibliografias temáticas / Constraint-based method / Artigos de revistas

Artigos de revistas sobre o tema "Constraint-based method"

Siga este link para ver outros tipos de publicações sobre o tema: Constraint-based method.

Autor: Grafiati

Publicado: 25 de maio de 2024

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Veja os 50 melhores artigos de revistas para estudos sobre o assunto "Constraint-based method".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Veja os artigos de revistas das mais diversas áreas científicas e compile uma bibliografia correta.

1

Verle, A., X. Michel, P. Maurine, N. Azémard e D. Auvergne. "Delay bounds based constraint distribution method". IEE Proceedings - Computers and Digital Techniques 152, n.º 6 (2005): 765. http://dx.doi.org/10.1049/ip-cdt:20050026.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

LIU, Ying, Meiping WU, Xiaoping HU e Hongwei XIE. "Contour Constraint Based Geomagnetic Matching Method". Chinese Journal of Space Science 27, n.º 6 (2007): 505. http://dx.doi.org/10.11728/cjss2007.06.505.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

LI, Zhu, Kojiro TOMOTSUNE, Yoichi TOMIOKA e Hitoshi KITAZAWA. "Template Matching Method Based on Visual Feature Constraint and Structure Constraint". IEICE Transactions on Information and Systems E95.D, n.º 8 (2012): 2105–15. http://dx.doi.org/10.1587/transinf.e95.d.2105.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Duan, Jin, Xiao Ming Chen, Hu Qi e Yun Gui Li. "Boundary-Constraint Meshing Based on Paving Method". Applied Mechanics and Materials 627 (setembro de 2014): 262–67. http://dx.doi.org/10.4028/www.scientific.net/amm.627.262.

Texto completo da fonte

Resumo:

This paper would modify thepaving method of Blacker and Stephenson [1] to generate boundary-constraint quad-mesh for arbitrary plane geometry. The basic idea for the present method is to classify the initial boundaries into closed borders and open borders.The closed borders aredescribed in a manner just the same as the paving method while the open borders areheuristically modeled as cracks with zero-width.And then the two kinds of borders aredelicatelyconnected each other to generate a new kind of boundary, named generalized closed boundary. Based on the newboundaries, the paving methodin Ref. [1] is adopted and modified slightly to generate quadrilateral elements by layering the geometry from the boundary toward the interior. And finally some meshing examples would be presented to illustrate the availability and power of the modified paving method.

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

WEI Wei, GUO Chen e DUAN Xiaodong. "Tolerance Constraint-based Assembly Method in Virtual Assembly". INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences 4, n.º 22 (31 de dezembro de 2012): 649–57. http://dx.doi.org/10.4156/aiss.vol4.issue22.81.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

LI Wen, 李雯, 蔡宁 CAI Ning, 林斌 LIN Bin e 曹向群 CAO Xiang-qun. "Adaptive Phase Unwrapping Method Based on Geometric Constraint". ACTA PHOTONICA SINICA 48, n.º 8 (2019): 810001. http://dx.doi.org/10.3788/gzxb20194808.0810001.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Bale, Rahul, Neelesh A. Patankar, Niclas Jansson, Keiji Onishi e Makoto Tsubokura. "Stencil Penalty approach based constraint immersed boundary method". Computers & Fluids 200 (março de 2020): 104457. http://dx.doi.org/10.1016/j.compfluid.2020.104457.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Wang Xiaoleng, 王小冷, 杨凌辉 Yang Linghui, 林嘉睿 Lin Jiarui, 任永杰 Ren Yongjie e 尹. 彤. Yin Tong. "Calibration method of circumference receiver based on circumference constraint location method". Infrared and Laser Engineering 45, n.º 7 (2016): 0717004. http://dx.doi.org/10.3788/irla201645.0717004.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Lakmazaheri, Sivand. "Constraint-based reasoning via Grobner Bases". Artificial Intelligence for Engineering Design, Analysis and Manufacturing 11, n.º 1 (janeiro de 1997): 5–15. http://dx.doi.org/10.1017/s0890060400001803.

Texto completo da fonte

Resumo:

AbstractConstraint-based reasoning is a problem-solving approach based on deductive reasoning. In this approach, a problem is modeled in terms of hypotheses and conclusion constraints, and it is solved via constraint satisfaction. The ability to handle linear and nonlinear algebraic constraints is essential for successful application of constraint-based reasoning in engineering. Due to the scarcity of algebraic techniques for satisfying nonlinear constraints, little attention has been paid to the use of constraint-based reasoning for solving nonlinear problems. This paper examines the use of the Grobner Bases method for satisfying nonlinear constraints in the context of constraint-based reasoning. After a brief introduction to the Grobner Bases method and its role in constraint-based reasoning, two examples are presented. The first example illustrates the use of Grobner bases, in the context of constraint-based reasoning, for reasoning about the behavior of beams. The second example illustrates the geometry configuration of truss structures via constraint-based reasoning.

Estilos ABNT, Harvard, Vancouver, APA, etc.

11

Su, Peng-Fei, Hong-Ling Ye, Wei-Wei Wang e Yun-Kang Sui. "Fatigue Topology Optimization Based on Global Stress Constraint Method". IOP Conference Series: Materials Science and Engineering 531 (26 de setembro de 2019): 012048. http://dx.doi.org/10.1088/1757-899x/531/1/012048.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

12

Zhou, Shaobo, Delin Luo e Jinpeng Zhang. "Terminal Angle Constraint Guidance Law Based on SDRE Method". IOP Conference Series: Earth and Environmental Science 242 (30 de março de 2019): 032060. http://dx.doi.org/10.1088/1755-1315/242/3/032060.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

13

Tan, Hengliang, Ying Gao e Zhengming Ma. "Regularized constraint subspace based method for image set classification". Pattern Recognition 76 (abril de 2018): 434–48. http://dx.doi.org/10.1016/j.patcog.2017.11.020.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

14

Chen, Liang, Cheng Hui Gao e Guo Dong Jin. "Constraint-Based Multidisciplinary Collaborative Design Method of Gear Drive". Materials Science Forum 505-507 (janeiro de 2006): 937–42. http://dx.doi.org/10.4028/www.scientific.net/msf.505-507.937.

Texto completo da fonte

Resumo:

The essence of the multidisciplinary collaborative design problem (MCDP) is the coordination of the design variables among multiple disciplines on the basis of the all constraints of all disciplines. There exist some problems such as the early detection of design conflicts and the determination of the consistency domains of the design variables, etc. The resolving of these problems can help designers avoid bad decision-making, reduce the design iteration and improve the design efficiency. Aiming at the problems, this paper proposes a constraint-net model to describe and manage all the design variables and constrains of all disciplines, discusses the reformulating method of the MCDP to improve computation efficiency, and develops the interval propagation algorithm to determine the consistency domains of the design variables, etc. A gear drive is taken as an example to illustrate the effectiveness of the proposed method.

Estilos ABNT, Harvard, Vancouver, APA, etc.

15

Feng, Donghan, Chang Liu, Zeyu Liu, Liang Zhang, Yangzhi Ding e Clay Campaigne. "Constraint Qualification Based Detection Method for Nodal Price Multiplicity". IEEE Transactions on Power Systems 32, n.º 6 (novembro de 2017): 4968–69. http://dx.doi.org/10.1109/tpwrs.2017.2667229.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

16

Wang, Xin, Jing Zhao e Ziqiang Zhang. "Human–robot kinematic mapping method based on index constraint". Mechatronics 100 (junho de 2024): 103183. http://dx.doi.org/10.1016/j.mechatronics.2024.103183.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

17

Pu, Jiantao, e Karthik Ramani. "Priority-Based Geometric Constraint Satisfaction". Journal of Computing and Information Science in Engineering 7, n.º 4 (14 de junho de 2007): 322–29. http://dx.doi.org/10.1115/1.2795301.

Texto completo da fonte

Resumo:

A well-constrained geometric system seldom occurs in practice, especially at the sketch-based initial conceptual design stage. Usually, it is either under- or overconstrained because design is a progressive process and it is difficult for a designer to specify all involved constraints in a consistent way. This paper presents a priority-based graph-reduction solution, in which each constraint is assigned with a priority to guide the reduction of a geometric constraint graph. The advantage of this method lies in its ability to find the optimal solutions to a geometric constraint system automatically, without requiring interactive intervention from users.

Estilos ABNT, Harvard, Vancouver, APA, etc.

18

Shao, Wei Ping, Yong Ping Hao, Yang Wang e Yong Xian Liu. "Dimension Parameter Transfer Method Based on Constraint Satisfaction Priority in Variant Design". Applied Mechanics and Materials 16-19 (outubro de 2009): 203–7. http://dx.doi.org/10.4028/www.scientific.net/amm.16-19.203.

Texto completo da fonte

Resumo:

In order to accommodate the increasing variety of costumers’ demands, manufacturers tend to produce different models of the same product by introducing variant design concepts that improve the flexibility of design systems. In this paper, an approach based on constraint satisfaction priority is proposed to solve the dimension parameter transferring problem. Firstly, product variant parameters and variant relations are analyzed. Secondly, dimension constraint relation network model is conceived and parameters constraint forms is discussed. Finally, a parameters transfer method based on constraint satisfaction priority is established.

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

Fei, Xianfeng, Yasunobu Igarashi e Koichi Hashimoto. "2P2-B18 2D tracking of single micro-organism based on parallel level set method with intensity constraint". Proceedings of JSME annual Conference on Robotics and Mechatronics (Robomec) 2008 (2008): _2P2—B18_1—_2P2—B18_4. http://dx.doi.org/10.1299/jsmermd.2008._2p2-b18_1.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

20

Zhang, Daiyu, Bei Zhang, Zhidong Wang e Xinyao Zhu. "An Efficient Surrogate-Based Optimization Method for BWBUG Based on Multifidelity Model and Geometric Constraint Gradients". Mathematical Problems in Engineering 2021 (24 de agosto de 2021): 1–13. http://dx.doi.org/10.1155/2021/6939863.

Texto completo da fonte

Resumo:

Performing shape optimization of blended-wing-body underwater glider (BWBUG) can significantly improve its gliding performance. However, high-fidelity CFD analysis and geometric constraint calculation in traditional surrogate-based optimization methods are expensive. An efficient surrogate-based optimization method based on the multifidelity model and geometric constraint gradient information is proposed. By establishing a shape parameterized model, deriving analytical expression of geometric constraint gradient, constructing multifidelity surrogate model, the calculation times of high-fidelity CFD model and geometric constraints are reduced during the shape optimization process of BWBUG, which greatly improve the optimization efficiency. Finally, the effectiveness and efficiency of the proposed method are verified by performing the shape optimization of a BWBUG and comparing with traditional surrogate-based optimization methods.

Estilos ABNT, Harvard, Vancouver, APA, etc.

21

KORPIPÄÄ, PANU. "Visualizing constraint-based temporal association rules". Artificial Intelligence for Engineering Design, Analysis and Manufacturing 15, n.º 5 (novembro de 2001): 401–10. http://dx.doi.org/10.1017/s0890060401155034.

Texto completo da fonte

Resumo:

When dealing with time continuous processes, the discovered association rules may change significantly over time. This often reflects a change in the process as well. Therefore, two questions arise: What kind of deviation occurs in the association rules over time, and how could these temporal rules be presented efficiently? To address this problem of representation, we propose a method of visualizing temporal association rules in a virtual model with interactive exploration. The presentation form is a three-dimensional correlation matrix, and the visualization methods used are brushing and glyphs. Interactive functions used for displaying rule attributes and exploring temporal rules are implemented by utilizing Virtual Reality Modeling Language v2 mechanisms. Furthermore, to give a direction of rule potential for the user, the rule statistical interestingness is evaluated on the basis of combining weighted characteristics of rule and rule matrix. A constraint-based association rule mining tool which creates the virtual model as an output is presented, including the most relevant experiences from the development of the tool. The applicability of the overall approach has been verified by using the developed tool for data mining on a hot strip mill of a steel plant.

Estilos ABNT, Harvard, Vancouver, APA, etc.

22

ABDENNADHER, SLIM, e CHRISTOPHE RIGOTTI. "AUTOMATIC GENERATION OF RULE-BASED SOLVERS FOR INTENTIONALLY DEFINED CONSTRAINTS". International Journal on Artificial Intelligence Tools 11, n.º 02 (junho de 2002): 283–302. http://dx.doi.org/10.1142/s0218213002000903.

Texto completo da fonte

Resumo:

A general approach to implement propagation and simplification of constraints consists of applying rules over these constraints. However, a difficulty that arises frequently when writing a constraint solver is to determine the constraint propagation algorithm. In previous work, different methods for automatic generation of rule-based solvers for constraints defined over finite domains have been proposed1,2,3,4. In this paper, we present a method for generating rule-based solvers for constraint predicates defined by means of a constraint logic program, even when the constraint domain is infinite.

Estilos ABNT, Harvard, Vancouver, APA, etc.

23

Kingston, Zachary, Mark Moll e Lydia E. Kavraki. "Exploring implicit spaces for constrained sampling-based planning". International Journal of Robotics Research 38, n.º 10-11 (26 de agosto de 2019): 1151–78. http://dx.doi.org/10.1177/0278364919868530.

Texto completo da fonte

Resumo:

We present a review and reformulation of manifold constrained sampling-based motion planning within a unifying framework, IMACS (implicit manifold configuration space). IMACS enables a broad class of motion planners to plan in the presence of manifold constraints, decoupling the choice of motion planning algorithm and method for constraint adherence into orthogonal choices. We show that implicit configuration spaces defined by constraints can be presented to sampling-based planners by addressing two key fundamental primitives, sampling and local planning, and that IMACS preserves theoretical properties of probabilistic completeness and asymptotic optimality through these primitives. Within IMACS, we implement projection- and continuation-based methods for constraint adherence, and demonstrate the framework on a range of planners with both methods in simulated and realistic scenarios. Our results show that the choice of method for constraint adherence depends on many factors and that novel combinations of planners and methods of constraint adherence can be more effective than previous approaches. Our implementation of IMACS is open source within the Open Motion Planning Library and is easily extended for novel planners and constraint spaces.

Estilos ABNT, Harvard, Vancouver, APA, etc.

24

Luo, Guojun, Xiaohui Wang e Xianguo Yan. "DOF Calculation Method of Planar Mechanisms Based on Constraint Normal Line". Mathematical Problems in Engineering 2023 (10 de fevereiro de 2023): 1–12. http://dx.doi.org/10.1155/2023/3790060.

Texto completo da fonte

Resumo:

In the analysis and calculation of the degree of freedom (DOF) of mechanisms, it is generally a complicated problem to judge the virtual constraint correctly. Under what conditions do virtual constraints exist, and how many virtual constraints are there? Understanding these problems can contribute to effectively tackling the difficulty of calculating the DOF. With planar mechanisms as a research object, the constraints among various components are simplified into point constraints, and the common normal at a constraint point is referred to as normal. According to whether a constraint point can move relative to the frame in its normal direction, normals are divided into different categories. Based on the geometric theorem for judging the DOF of a workpiece, a set of geometric theorems for judging the DOF of components and their nature, over-constraint, and quantity are established. After the correlation between virtual constraints and over-constraints is clarified, the total number of virtual constraints in a mechanism is calculated. The analysis and calculation of the DOF of several typical planar mechanisms demonstrate that the new method is logically rigorous, simple, and intuitive, and the DOF of a mechanism can be accurately calculated.

Estilos ABNT, Harvard, Vancouver, APA, etc.

25

Xuan, DU, LIAO Tian-yi e LI Bao-wan. "Research on Piano Batch Scheduling Method Based on Constraint Model". Journal of Physics: Conference Series 1750 (janeiro de 2021): 012015. http://dx.doi.org/10.1088/1742-6596/1750/1/012015.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

26

Jin Yuting, 靳宇婷, 张益华 Zhang Yihua, 崔海华 Cui Haihua, 翟鹏 Zhai Peng e 胡广露 Hu Guanglu. "An Aircraft Skin Registration Method Based on Contour Feature Constraint". Acta Optica Sinica 41, n.º 3 (2021): 0312001. http://dx.doi.org/10.3788/aos202141.0312001.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

27

Wang, Jingxue, Ning Zhang, Xiangqian Wu e Weixi Wang. "Hierarchical Point Matching Method Based on Triangulation Constraint and Propagation". ISPRS International Journal of Geo-Information 9, n.º 6 (26 de maio de 2020): 347. http://dx.doi.org/10.3390/ijgi9060347.

Texto completo da fonte

Resumo:

Reliable image matching is the basis of image-based three-dimensional (3D) reconstruction. This study presents a quasi-dense matching method based on triangulation constraint and propagation as applied to different types of close-range image matching, such as illumination change, large viewpoint, and scale change. The method begins from a set of sparse matched points that are used to construct an initial Delaunay triangulation. Edge-to-edge matching propagation is then conducted for the point matching. Two types of matching primitives from the edges of triangles with areas larger than a given threshold in the reference image, that is, the midpoints of edges and the intersections between the edges and extracted line segments, are used for the matching. A hierarchical matching strategy is adopted for the above-mentioned primitive matching. The points that cannot be matched in the first stage, specifically those that failed in a gradient orientation descriptor similarity constraint, are further matched in the second stage. The second stage combines the descriptor and the Mahalanobis distance constraints, and the optimal matching subpixel is determined according to an overall similarity score defined for the multiple constraints with different weights. Subsequently, the triangulation is updated using the newly matched points, and the aforementioned matching is repeated iteratively until no new matching points are generated. Twelve sets of close-range images are considered for the experiment. Results reveal that the proposed method has high robustness for different images and can obtain reliable matching results.

Estilos ABNT, Harvard, Vancouver, APA, etc.

28

Irani, Behnam, Jingchuan Wang e Weidong Chen. "A Localizability Constraint-Based Path Planning Method for Autonomous Vehicles". IEEE Transactions on Intelligent Transportation Systems 20, n.º 7 (julho de 2019): 2593–604. http://dx.doi.org/10.1109/tits.2018.2868377.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

29

Wu, Xintao, e Yong Ye. "Exploring gene causal interactions using an enhanced constraint-based method". Pattern Recognition 39, n.º 12 (dezembro de 2006): 2439–49. http://dx.doi.org/10.1016/j.patcog.2006.05.003.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

30

Joo, Jae Hoon, Jea Soo Kim, Jung Hong Cho e Sang Taeck Moon. "Environmentally robust time reversal processing based on multiple constraint method". Journal of the Acoustical Society of America 131, n.º 4 (abril de 2012): 3393. http://dx.doi.org/10.1121/1.4708801.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

31

Mao, Yang, Liangcai Zeng, Jun Jiang e Chengyi Yu. "Plane-constraint-based calibration method for a galvanometric laser scanner". Advances in Mechanical Engineering 10, n.º 5 (maio de 2018): 168781401877367. http://dx.doi.org/10.1177/1687814018773670.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

32

Wei, Sun, Ma Tieqiang e Li Tao. "Constraint Conversion Method in Feature-Based Heterogeneous CAD Model Exchange". Information Technology Journal 7, n.º 5 (15 de junho de 2008): 783–89. http://dx.doi.org/10.3923/itj.2008.783.789.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

33

Abbasian, Reza, e Malek Mouhoub. "A New Parallel GA-Based Method for Constraint Satisfaction Problems". International Journal of Computational Intelligence and Applications 15, n.º 03 (setembro de 2016): 1650017. http://dx.doi.org/10.1142/s1469026816500176.

Texto completo da fonte

Resumo:

Despite some success of Genetic Algorithms (GAs) when tackling Constraint Satisfaction Problems (CSPs), they generally suffer from poor crossover operators. In order to overcome this limitation in practice, we propose a novel crossover specifically designed for solving CSPs including Temporal CSPs (TCSPs). Together with a variable ordering heuristic and an integration into a parallel architecture, this proposed crossover enables the solving of large and hard problem instances as demonstrated by the experimental tests conducted on randomly generated CSPs and TCSPs based on the model RB. We will indeed demonstrate, through these tests, that our proposed method is superior to the known GA-based techniques for CSPs. In addition, we will show that we are able to compete with the efficient MAC-based Abscon 109 solver for random problem instances as well as those instances taken from Lecoutre’s CSP library. Finally, we conducted additional tests on very large consistent and over constrained CSPs and TCSPs instances in order to show the ability of our method to deal with constraint problems in real time. This corresponds to solving the CSP or the TCSP by giving a solution with a quality (number of solved constraints) depending on the time allocated for computation.

Estilos ABNT, Harvard, Vancouver, APA, etc.

34

Tian, Ying, YingHong Jia e Jun Zhang. "New method for multibody dynamics based on unknown constraint force". Science China Technological Sciences 67, n.º 3 (20 de fevereiro de 2024): 791–808. http://dx.doi.org/10.1007/s11431-023-2462-9.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

35

Li, Guangxu, Hyoungseop Kim, Joo Kooi Tan e Seiji Ishikawa. "A Parameterization Based Correspondence Method for PDM Building". Journal of Advanced Computational Intelligence and Intelligent Informatics 17, n.º 1 (20 de janeiro de 2013): 18–26. http://dx.doi.org/10.20965/jaciii.2013.p0018.

Texto completo da fonte

Resumo:

Place-march of corresponding landmarks is one of the major factors influencing 3D Points Distribution Model (PDM) quality. In this study, we propose a semi-automatic correspondence method based on surface parameterization theory. All the training sets are mapped into a spherical domain previously. The rotation transformation of training samples is regarded as spherical rotation of their maps. We solve it by comparing the density distribution of surface map of training sample with respect to the reference model. Simultaneously, the corresponding landmarks across the whole training set are marketed depending on the spherical coordinates on parameter domain. In this paper, we also compared the corresponding results with two constraint conditions of spherical conformal mapping: 3 datum points constrain and zero-mass constrain. Experimental results are given for left lung training sets of 3D shapes. The mean result with the 3 datum points constraint and the zero mass-center constraint was 21.65 mm and 20.19 mm respectively.

Estilos ABNT, Harvard, Vancouver, APA, etc.

36

Nouhi, B., S. Talatahari, H. Kheiri e C. Cattani. "Chaotic Charged System Search with a Feasible-Based Method for Constraint Optimization Problems". Mathematical Problems in Engineering 2013 (2013): 1–8. http://dx.doi.org/10.1155/2013/391765.

Texto completo da fonte

Resumo:

Recently developed chaotic charged system search was combined to feasible-based method to solve constraint engineering optimization problems. Using chaotic maps into the CSS increases the global search mobility for a better global optimization. In the present method, an improved feasible-based method is utilized to handle the constraints. Some constraint design examples are tested using the new chaotic-based methods, and the results are compared to recognize the most efficient and powerful algorithm.

Estilos ABNT, Harvard, Vancouver, APA, etc.

37

Kang, Chuanli, Chongming Geng, Zitao Lin, Sai Zhang, Siyao Zhang e Shiwei Wang. "Point Cloud Registration Method Based on Geometric Constraint and Transformation Evaluation". Sensors 24, n.º 6 (14 de março de 2024): 1853. http://dx.doi.org/10.3390/s24061853.

Texto completo da fonte

Resumo:

Existing point-to-point registration methods often suffer from inaccuracies caused by erroneous matches and noisy correspondences, leading to significant decreases in registration accuracy and efficiency. To address these challenges, this paper presents a new coarse registration method based on a geometric constraint and a matrix evaluation. Compared to traditional registration methods that require a minimum of three correspondences to complete the registration, the proposed method only requires two correspondences to generate a transformation matrix. Additionally, by using geometric constraints to select out high-quality correspondences and evaluating the matrix, we greatly increase the likelihood of finding the optimal result. In the proposed method, we first employ a combination of descriptors and keypoint detection techniques to generate initial correspondences. Next, we utilize the nearest neighbor similarity ratio (NNSR) to select high-quality correspondences. Subsequently, we evaluate the quality of these correspondences using rigidity constraints and salient points’ distance constraints, favoring higher-scoring correspondences. For each selected correspondence pair, we compute the rotation and translation matrix based on their centroids and local reference frames. With the transformation matrices of the source and target point clouds known, we deduce the transformation matrix of the source point cloud in reverse. To identify the best-transformed point cloud, we propose an evaluation method based on the overlap ratio and inliers points. Through parameter experiments, we investigate the performance of the proposed method under various parameter settings. By conducting comparative experiments, we verified that the proposed method’s geometric constraints, evaluation methods, and transformation matrix computation consistently outperformed other methods in terms of root mean square error (RMSE) values. Additionally, we validated that our chosen combination for generating initial correspondences outperforms other descriptor and keypoint detection combinations in terms of the registration result accuracy. Furthermore, we compared our method with several feature-matching registration methods, and the results demonstrate the superior accuracy of our approach. Ultimately, by testing the proposed method on various types of point cloud datasets, we convincingly established its effectiveness. Based on the evaluation and selection of correspondences and the registration result’s quality, our proposed method offers a solution with fewer iterations and higher accuracy.

Estilos ABNT, Harvard, Vancouver, APA, etc.

38

Chang, Bo Yan, Guo Guang Jin, Jian Sheng Dai e Jin Tian Yun. "The Dynamics Analysis of Metamorphic Mechanisms Based on Fully Cartesian Coordinates Method". Advanced Materials Research 139-141 (outubro de 2010): 2391–96. http://dx.doi.org/10.4028/www.scientific.net/amr.139-141.2391.

Texto completo da fonte

Resumo:

Because of special structure and dynamic behavior, the dynamic equations of metamorphic mechanism are variable during the process of configuration change. In order to combine dynamics analysis and structure design of metamorphic mechanisms intimately, a new method of forming dynamic model of metamorphic mechanisms is proposed based on fully Cartesian coordinate’s method and the relation between origin mechanism and sub-configuration. A new concept named origin constraint equation is introduced which can be converted into constraint equations of each sub-configuration easily by adding corresponding constraint equations of configuration change. Constraint equations commonly used in configuration change and dynamic equations of each configuration are given in the form of natural coordinates. Finally, a four-bar spherical metamorphic mechanism is used as an example to validate this dynamic modeling method.

Estilos ABNT, Harvard, Vancouver, APA, etc.

39

Liu, Xun, Yan Xu, Jiabin Cao, Jinyu Liu e Yanzheng Zhao. "A High-Precision Planar NURBS Interpolation System Based on Segmentation Method for Industrial Robot". Applied Sciences 13, n.º 24 (13 de dezembro de 2023): 13210. http://dx.doi.org/10.3390/app132413210.

Texto completo da fonte

Resumo:

NURBS curve parameter interpolation is extensively employed in precision trajectory tasks for industrial robots due to its smoother performance compared to traditional linear or circular interpolation methods. The trajectory planning systems for industrial robots necessitate four essential functional modules: first, the spline curve discretization technique ensuring chord error compliance; second, the contour scanning technique for determining the maximum feasible feed rate for multi-constraint and multi-segment paths; third, the technique for achieving a smooth feed rate profile; and fourth, the continuous curve parameter interpolation technique. Therefore, this paper proposes a high-precision planar NURBS interpolation system for industrial robots. Firstly, a segmentation method for NURBS curves based on a closed-loop chord error constraint is proposed, which segments the original global NURBS curve into a collection of Bezier curves that strictly meet the chord error constraint. Secondly, a bidirectional scanning technique is presented to meet the joint space constraint, establishing an analytical mapping between the tool tip kinematic constraint and the joint kinematic constraint. Then, based on the traditional S-shaped feed rate profile, an adaptive algorithm with a displacement constraint is introduced, considering the real-time speed adjustment requirements of robots. Finally, a compensation interpolation strategy based on arc length parameterization is adopted to solve the accumulated error problem in parameter interpolation. The effectiveness of and potential for enhancing the quality of planar machining of the proposed planar NURBS interpolation system for industrial robots are validated through simulations and experiments. The results demonstrate the system’s applicability and accuracy, and its ability to improve planar machining quality.

Estilos ABNT, Harvard, Vancouver, APA, etc.

40

Peng, Chenyuan, Jin Zhang, Bing Yan e Yazhong Luo. "Multisatellite Flyby Inspection Trajectory Optimization Based on Constraint Repairing". Aerospace 8, n.º 9 (21 de setembro de 2021): 274. http://dx.doi.org/10.3390/aerospace8090274.

Texto completo da fonte

Resumo:

With the rapid development of on-orbit services and space situational awareness, there is an urgent demand for multisatellite flyby inspection (MSFI) that can obtain information about a large number of space targets with little fuel consumption in a short time. There are two kinds of constraints, namely inspection constraints (ICs) at each flyby point and transfer process constraints (TPCs) in the actual mission. Further considering the influence of discrete and continuous variables such as inspection sequence, time, and maneuver scheme, it is complex and difficult to solve MSFI. To optimize it efficiently, the task flow and the problem model are defined firstly. Then, the algorithm framework based on constraint repairing is given, which contains repair methods of the ICs and the TPCs. Finally, the proposed method is compared with the nonrepair optimization method in two numerical examples. The results indicate that when the constraints are hard to meet, it is better and more efficient than the nonrepair method.

Estilos ABNT, Harvard, Vancouver, APA, etc.

41

Takami, Hikaru, e Shigeru Obayashi. "A comparator-based constraint handling technique for evolutionary algorithms". AIP Advances 12, n.º 5 (1 de maio de 2022): 055229. http://dx.doi.org/10.1063/5.0090572.

Texto completo da fonte

Resumo:

Constraint handling is a key task for the successful optimization of design parameters in industrial design problems. This paper proposes a comparator-based constraint handling technique, called the More Less-Violations Method (MLVM), for solving real constrained optimization problems using evolutionary algorithms. The structure of the MLVM is simple and it can easily be integrated into conventional evolutionary algorithms. In the proposed method, constraint weights represent the level of importance of each constraint, enabling evolutionary compliance prioritization. Moreover, an acceptable region formed by the constraint tolerances allows trade-offs between objectives and constraints while preserving diverse solutions and improving optimization performance. These elements enable the appropriate design of industrial optimization problems. An application of this method to problems without constraint tolerances is also proposed. The JAXA/Mazda benchmark problem, developed on a real-world constrained design optimization dataset, is used to assess the performance of the MLVM. The results indicate that the MLVM realizes encouraging optimization performance.

Estilos ABNT, Harvard, Vancouver, APA, etc.

42

Gao, Xue Yao, Chun Xiang Zhang e Xiao Yang Yu. "Semantic Feature Modeling Based on Geometric Constraint Solving". Applied Mechanics and Materials 513-517 (fevereiro de 2014): 2264–67. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.2264.

Texto completo da fonte

Resumo:

Semantic feature modeling is a new trend of CAD technology. It is very important for modifying and editing models automatically and semi-automatically. In this paper, a semantic feature modeling method is proposed, in which geometric constraints of models are solved. The new method is history-independent. At the same time, the architecture of semantic feature modeling is given. According to the principles of 3 dimensional rigid bodies, basic geometric constraints can be expressed. Experiment results show an instance modeled by the proposed method.

Estilos ABNT, Harvard, Vancouver, APA, etc.

43

Wan, Fang, e R. Yang. "A Geometric Constraints Based Single-Image Reconstruction Method". Advanced Materials Research 846-847 (novembro de 2013): 1320–25. http://dx.doi.org/10.4028/www.scientific.net/amr.846-847.1320.

Texto completo da fonte

Resumo:

In the paper, we have a study on reconstruction technology from single image, particularly on geometric constraint based methods. We analyze several important geometry constraint relationships in the image and derive corresponding function expression. In this way, the depth of each image point can be gained relatively accurately. With the depth of object points, we fulfilled model reconstruction from a single image. We call the single image reconstruction method as sequential method which need calculate depth of object points one by one. In the experiment, the results prove the visual effect of the algorithm is satisfactory.

Estilos ABNT, Harvard, Vancouver, APA, etc.

44

Zheng, Xiao Qiang, Wei Li, Wei Liu e Na Na Li. "A Railway Alignment Optimization Method Based on Minimum Cost". Applied Mechanics and Materials 744-746 (março de 2015): 1217–21. http://dx.doi.org/10.4028/www.scientific.net/amm.744-746.1217.

Texto completo da fonte

Resumo:

In order to automatically generate the railway Alignment, an alignment optimization method based on minimum cost is proposed. Firstly, an optimization model based on the coupling constraints of line-structure-environment is established, in which the comprehensive cost of engineering, operations, and the environment is considered as the objective function. Then based on the regular grids, the Geographic Information Data can be obtained and the comprehensive cost of the connection between two grids can be calculated. At last, the optimal connection between the grids is analyzed under the angle constraint and elevation constraint, thus the optimal alignment can be generated by the connection of grids.

Estilos ABNT, Harvard, Vancouver, APA, etc.

45

Yi, Yang, Xiaojun Liu, Zhonghua Ni, Xia Tang e Xiaokang Xu. "Research Method of Assembly Sequence Planning Based on Assembly Constraint Relationship Analysis". MATEC Web of Conferences 237 (2018): 03005. http://dx.doi.org/10.1051/matecconf/201823703005.

Texto completo da fonte

Resumo:

In order to effectively reduce the human-computer interaction (HCI) workload before the assembly process simulation in the digital assembly environment, and to enhance the intelligence of assembly sequence planning, we introduce the assembly constraint relationship into the automatic generation of assembly sequences and propose a practical assembly sequence planning method for intelligent assembly. Firstly, starting from the assembly geometry model, an assembly model liaison graph is constructed by combining the analysis of assembly constraint relationship and the definition of disassembly direction rules. Then, according to the liaison graph, disassembly priority constraint matrix based on constraint relationship is constructed, and the automatic generation and dynamic update of the disassembly priority diagram can be realized by the definition of disassembly doubly linked list. According to the diagram, the rationality of the disassembly sequence is determined through the interference check analysis, and then the assembly sequence is automatically generated from the reversed disassembly sequence. Finally, the method in the text is verified by an example case study.

Estilos ABNT, Harvard, Vancouver, APA, etc.

46

Mansouri, Seyed Fazlolah, e Mahmoud R. Maheri. "Performance-based seismic design of steel frames using constraint control method". Advances in Structural Engineering 22, n.º 12 (22 de maio de 2019): 2648–61. http://dx.doi.org/10.1177/1369433219849820.

Texto completo da fonte

Resumo:

In this article, the optimum performance-based seismic design of steel frames is performed using the novel constraint control method. This method is based on a simple concept generally used by the engineers in structural design. In this method, the most conservative member sections are initially selected and by gradually reducing the size of the sections through controlling the problem constraints, the solution tends to an optimum design. The capacity curve of the structure is evaluated through static nonlinear analysis and used for the seismic assessment, and the structural weight is optimized by controlling relative displacement constraints at performance levels of operational, immediate occupancy, life safety and collapse prevention. The performance and efficiency of the proposed algorithm in solving for optimum performance-based seismic design are assessed through solving three benchmark problems. The results show that using constraint control method drastically reduces the number of structural analyses required to reach a solution, compared to the more commonly used metaheuristic optimization methods, while producing comparable optimum solutions. For this reason, the constraint control method is found to be particularly suitable as an optimizer for solving solution-extensive problems, such as performance-based optimum design of structures.

Estilos ABNT, Harvard, Vancouver, APA, etc.

47

Wang, Zhen, Shaojun Li e Zhixiang Sang. "A new constraint handling method based on the modified Alopex-based evolutionary algorithm". Computers & Industrial Engineering 73 (julho de 2014): 41–50. http://dx.doi.org/10.1016/j.cie.2014.04.011.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

48

Yan, Gao, e Jian Zhong Xu. "Motion Path Editing Based on Constraint Detection". Advanced Materials Research 433-440 (janeiro de 2012): 3780–86. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.3780.

Texto completo da fonte

Resumo:

This paper introduces a method for interactive direct manipulation of motion capture animation, which allows a user to alter positional properties of a motion and preserves the motions’ quality. The algorithm contains three stages: motion analysis, motion path editing, and constraint reconstruction. Our experiments show that by using the algorithm human motion can be transformed successfully from the old path to the new path.

Estilos ABNT, Harvard, Vancouver, APA, etc.

49

Xu, Fuyuan, Guohua Gu, Kan Ren e Weixian Qian. "Motion Segmentation by New Three-View Constraint from a Moving Camera". Mathematical Problems in Engineering 2015 (2015): 1–14. http://dx.doi.org/10.1155/2015/546580.

Texto completo da fonte

Resumo:

We propose a new method for the motion segmentation using a moving camera. The proposed method classifies each image pixel in the image sequence as the background or the motion regions by applying a novel three-view constraint called the “parallax-based multiplanar constraint.” This new three-view constraint, being the main contribution of this paper, is derived from the relative projective structure of two points in three different views and implemented within the “Plane + Parallax” framework. The parallax-based multiplanar constraint overcomes the problem of the previous geometry constraint and does not require the reference plane to be constant across multiple views. Unlike the epipolar constraint, the parallax-based multiplanar constraint modifies the surface degradation to the line degradation to detect the motion objects followed by a moving camera in the same direction. We evaluate the proposed method with several video sequences to demonstrate the effectiveness and robustness of the parallax-based multiplanar constraint.

Estilos ABNT, Harvard, Vancouver, APA, etc.

50

Youn, Byeng D., Kyung K. Choi e Young H. Park. "Hybrid Analysis Method for Reliability-Based Design Optimization". Journal of Mechanical Design 125, n.º 2 (1 de junho de 2003): 221–32. http://dx.doi.org/10.1115/1.1561042.

Texto completo da fonte

Resumo:

Reliability-based design optimization (RBDO) involves evaluation of probabilistic constraints, which can be done in two different ways, the reliability index approach (RIA) and the performance measure approach (PMA). It has been reported in the literature that RIA yields instability for some problems but PMA is robust and efficient in identifying a probabilistic failure mode in the optimization process. However, several examples of numerical tests of PMA have also shown instability and inefficiency in the RBDO process if the advanced mean value (AMV) method, which is a numerical tool for probabilistic constraint evaluation in PMA, is used, since it behaves poorly for a concave performance function, even though it is effective for a convex performance function. To overcome difficulties of the AMV method, the conjugate mean value (CMV) method is proposed in this paper for the concave performance function in PMA. However, since the CMV method exhibits the slow rate of convergence for the convex function, it is selectively used for concave-type constraints. That is, once the type of the performance function is identified, either the AMV method or the CMV method can be adaptively used for PMA during the RBDO iteration to evaluate probabilistic constraints effectively. This is referred to as the hybrid mean value (HMV) method. The enhanced PMA with the HMV method is compared to RIA for effective evaluation of probabilistic constraints in the RBDO process. It is shown that PMA with a spherical equality constraint is easier to solve than RIA with a complicated equality constraint in estimating the probabilistic constraint in the RBDO process.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!