Showing 1-25 of 14,268 resultsfor "Index Terms":Optimal Curve
"Index Terms":Optimal Curve
- Sort
Get notified when new research is published matching your search criteria.
Sort By
Results
Selecting Optimal Threshold Value of Douglas-Peucker Algorithm Based on Curve Fit
2010 First International Conference on Networking and Distributed Computing
Year: 2010 | Conference Paper |
Sample data of Douglas-Peucker algorithm parameter and certain attributes related to simplification quality is obtained by iteration method of simplification algorithm, Functions between threshold with line length, point number, and running time are get by curve fit, Through analyzing curvature of function between threshold with point number, function maximum curvature is confirmed and acts as opt...Show More
On Curve Negotiation: From Driver Support to Automation
This paper describes a curve negotiation “behavior” that can be used-within subsumption architectures - to produce artificial agents with the ability to negotiate curves in a humanlike way. This may be used to implement functions spanning different levels of automation, from assistance (curve warning) to automated (curve speed control). This paper gives the following: (1) a summary of related work...Show More
The application of evolutionary algorithm in B-spline curve fitting
2012 9th International Conference on Fuzzy Systems and Knowledge Discovery
Year: 2012 | Conference Paper |
Cited by: Papers (1)
In this paper, evolutionary algorithm is applied to the process of B-Spline curve fitting, and the algorithm mechanism of fitting process is constructed according to the fundamental principle of evolutionary algorithm. The control points obtained by the known points of the curve are divided into several gene populations. Every control point is used as the gene of the gene population, and the value...Show More
NURBS Curve Fitting Based on ACO Algorithm for Solving Optimal Control Vertices
Liqin Miao;Chaoneng Liao;Dashun Zhang;Huaidan Liang;Jing Wang
2024 International Conference on Artificial Intelligence and Power Systems (AIPS)
Year: 2024 | Conference Paper |
A NURBS curve fitting algorithm based on ACO algorithm is proposed for tool path generation, which takes the sum of the squares of the deviations between the tool points and the fitted curve as the objective function. Firstly, discretizes the data points by using the isoparametric method. Secondly, the curvature extrema and inverse curvature points are found out through the adaptive feature point ...Show More
Time Optimal Control and Switching Curve Analysis for Caputo Fractional Systems
Zeinab Zolfaghari;Mahdi Baradarannia;Farzad Hashemzadeh;Sehraneh Ghaemi
2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)
Year: 2016 | Conference Paper |
Cited by: Papers (1)
In this paper we present a method for fractional time optimal control problems in terms of Caputo fractional derivatives. The studies up to now are about systems in terms of Riemann-Liouville fractional derivatives. But in this paper we investigated Caputo fractional systems. Firstly, by utilizing matrix approach method to discrete fractional derivatives, fractional Caputo derivative is solved. Th...Show More
On the Final Exponentiation in Tate Pairing Computations
The Tate pairing computation consists of two parts: Miller step and final exponentiation step. In this paper, we investigate the structure of the final exponentiation step. Consider an order r subgroup of an elliptic curve defined over Fq with embedding degree k. The final exponentiation in the Tate pairing is an exponentiation of an element in Fqk by (qk-1)/r . The hardest part of this computatio...Show More
Parallelizing optimal ate pairing on BLS-48 curve
2020 7th International Conference on Advance Informatics: Concepts, Theory and Applications (ICAICTA)
Year: 2020 | Conference Paper |
A pairing is a bilinear map from two rational points on an elliptic curve to an element on a finite field. Pairing is necessary to construct the next generation cryptography including ID-based encryption, functional encryption etc. Many researchers have studied efficiency improvement for pairing computations to make it practical. Several pairing computation methods have been proposed and an optima...Show More
Improved Miller’s Algorithm for Computing Pairings on Edwards Curves
IEEE Transactions on Computers
Cited by: Papers (5)
Since Edwards curves were introduced to elliptic curve cryptography by Bernstein and Lange in 2007, they have received a lot of attention due to their very fast group law operation. Pairing computation on such curves is slightly slower than on Weierstrass curves. However, in some pairing-based cryptosystems, they might require a number of scalar multiplications which is time-consuming operation an...Show More
Some New Optimal Pairings
2010 International Conference on Computational Intelligence and Security
Year: 2010 | Conference Paper |
The Ate pairing can be computed efficiently on ordinary elliptic curves with small value of the trace of Frobenius t. The Ate pairing generalizes the Ate pairing, and can possibly shorten the Miller loop to be as small as r 1/φ(k) on some special pairing-friendly curves with large value of Frobenius t. However, not all pairing-friendly curves have this property. In this paper, we generalize the At...Show More
Path-constrained Timen-ioptimal Robot Control
2006 IEEE International Conference on Robotics and Biomimetics
Year: 2006 | Conference Paper |
Cited by: Papers (5)
Fast movement along a predefined path is important for many robot applications, especially in cluster tool robots, requires utilization of the maximum allowable torque range. Robot running along the time-optimal path brings many benefits such as higher productivity. In this paper, moving a delicate object from an initial point to a specified location along a predefined path within the minimum time...Show More
Analytical Model for Secure Pairing in ad hoc Network
2018 IEEE 3rd International Conference on Computing, Communication and Security (ICCCS)
Year: 2018 | Conference Paper |
Cited by: Papers (1)
Key pairing and enciphering heuristics must be free from complexity whereas amount of confidentiality directs the adaptability of encryption and decryption scheme because an extensive ciphertext requires extra space complexity and more communication time. Fast and secure authenticators are present in the literature. As compared to RSA, an elliptic curve in secure paring using smallest size of key ...Show More
Optimal pulsewidth modulation (PWM) online control of a modular structured multilevel inverter (MSMI)
4th IEEE International Conference on Power Electronics and Drive Systems. IEEE PEDS 2001 - Indonesia. Proceedings (Cat. No.01TH8594)
Year: 2001 | Conference Paper |
Cited by: Papers (5)
An inverter topology for high power applications that seems to be gaining interest lately is the modular structured multilevel inverter. (MSMI). The switching frequency constraint in a MSMI with high isolated DC voltages calls for a low switching frequency modulator such as the optimal PWM switching strategies. This paper presents a different approach in controlling a MSMI output voltage based on ...Show More
CFT-Based On-Line Calculation for Optimal PWM Switching Angles
2009 Asia-Pacific Power and Energy Engineering Conference
Year: 2009 | Conference Paper |
Cited by: Papers (1)
Because of the difficulty of calculating switching angles, the values of the angles were achieved by using the CFT and Matlab . Cascaded multilevel inverter was adopted in the structure of the main circuit in order to implement the multiple-phase shifting and meet the need of using the high voltage and large power equipments. In this paper a method to selected harmonic elimination(SHE) choosing in...Show More
The theory of optimal control is introduced as a new approach for handling curve fitting and design problems. Optimal control provides a uniform formal framework for stating and solving multiple problems in computer-aided geometric design (CAGD). As a result, new classes of curves are defined and known problems are analyzed from a new viewpoint. Often, families of curves which are defined by a min...Show More
Short-Memory Scalar Multiplication for Koblitz Curves
IEEE Transactions on Computers
Cited by: Papers (4)
This paper presents a scalar multiplication method for Koblitz curves. Koblitz curves are elliptic curves where the scalar multiplication can be computed in a much faster way than with other curves, allowing designs and implementations without arithmetic coprocessor. The new method is as fast as the fastest known techniques on Koblitz curves but requires much less memory; therefore, it is of parti...Show More
Heuristic Production and Sale Policy for a Two-Product-Type Manufacturing System With Downward Substitution
In this paper, we study a manufacturing system with downward substitution in sales, i.e., selling superior products as inferior ones when the demand for the latter cannot be met immediately, in order to reduce the backlog cost. However, downward substitution in sales also causes profit loss. Therefore, controlling a manufacturing system with downward substitution in sales in order to minimize tota...Show More
Curve Query Processing in Wireless Sensor Networks
Most existing query processing algorithms for wireless sensor networks (WSNs) can only deal with discrete values. However, since the monitored environment always changes continuously with time, discrete values cannot describe the environment accurately and, hence, may not satisfy a variety of query requirements, such as the queries of the maximal, minimal, and inflection points. It is, therefore, ...Show More
A Model Algorithm for Smart Power Supply and Distribution in Residential Building
2019 IEEE PES/IAS PowerAfrica
Year: 2019 | Conference Paper |
Composition of algorithms in view of providing residential customers with a smart means of optimal power source and distribution management is considered in this paper. By data survey and statistical algorithm, load profiles of conventional apartments in a Nigerian setting are modelled. Thereafter, an algorithm for optimal selection of a source, out of three specified for a residential apartment, ...Show More
An Optimal Model-Following Problem for Linear Systems with Variable Disturbances
2019 23rd International Conference on System Theory, Control and Computing (ICSTCC)
Year: 2019 | Conference Paper |
A model following problem referring to a linear time invariant system with time variant disturbances is studied. An adequate behaviour of the system is achieved by imposing its dynamics to be near to a chosen model. The proposed algorithm uses results from linear quadratic optimal control theory. Simulation tests referring to the discussed problem are presented.Show More
Optimal torque control constraint rigid spacecraft attitude maneuver with constraints
2013 25th Chinese Control and Decision Conference (CCDC)
Year: 2013 | Conference Paper |
Cited by: Papers (3)
In this paper, the existed problems about optimal torque control of rigid spacecraft attitude maneuver with constraints are discussed. The pseudospectral method is adopted to solve the problem which has torque constraint or state constraints, and the simulation analysis on the problem in the case of unconstrained or the torque constraint or state constraints is made. The simulation results show th...Show More
A study of optimal control strategy of networked control systems with stochastic delay and packet losses
2013 International Conference on Control, Automation, Robotics and Embedded Systems (CARE)
Year: 2013 | Conference Paper |
Based on the structure of networked control systems, this paper employs a linear mathematic model with random delay and packet losses. The stochastic optimal control strategy of this NCS model is analyzed to guarantee the stability of system under the influence of random delay and packet losses. The effectiveness of this algorithm is verified by a numerical simulation of a position servo system. T...Show More
Shape Modification of B-Spline Curves via Constrained Optimization for Multi-target Points
2009 WRI World Congress on Computer Science and Information Engineering
Year: 2009 | Conference Paper |
Cited by: Papers (2)
The B-spline curve is one of the most famous curves in computer graphics, computational geometry and CAGD. Developing more convenient techniques for designing and modifying B-spline curves is an important problem, and is also an important research issue. In this study, the shape modification of B-spline curves by geometric constraints is presented. A new method based on changing the control points...Show More
The Constructing UAV Trajectories Method Using Bezier Curves and Pythagorean Hodograph
2022 International Russian Automation Conference (RusAutoCon)
Year: 2022 | Conference Paper |
In the proposed work, an algorithm for constructing the smooth trajectory of one UAV in a three-dimensional space is developed. To construct and approximate the trajectory, the extended Bernstein polynomials with the Pythagorean hodograph are used. The provided method uses an RRT* algorithm for path generation, and spatial Bezier curves for further trajectory smoothing. The proposed method makes U...Show More
Fitting curve to planar digital data
Proceedings Sixth International Conference on Information Visualisation
Year: 2002 | Conference Paper |
Cited by: Papers (8)
An optimal curve fitting technique has been developed which is meant to automatically provide a fit to any ordered digital data in a plane. A more flexible class of rational cubic functions is the basis of this technique. This class of functions involves two control parameters, which help to produce an optimal curve fit. The curve technique has used various ideas for curve design. These ideas incl...Show More
Omnidirectional Touch Probe With Adaptive Maneuvering for 3-D Object Machining and Measurement Verification Applications
In this paper, automated omnidirectional touch probe (ODTP) including adaptive tuning of the complex contour curve with optimal interpolation and motion planning based on a hybrid multiaxis robot (HMAR) with dual drive gantry-type machine (DDGM) are presented. It is called an “omnidirectional” because the 6-degrees of freedom ODTP in tool center point mode can always maintain normal direction towa...Show More
IEEE Account
Purchase Details
Profile Information
Need Help?
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Contact Us
- Help
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Sitemap
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.