Search

This paper proposes a method for solving the path planning problem for a collaborative robot. The time-optimal, smooth, collision-free B-spline path is obtained by the application of a nature-inspired optimization algorithm. The proposed approach can be especially useful when moving items that are delicate or contain a liquid in an open container using a robotic arm. The goal of the optimization is to obtain the shortest execution time of the production cycle, taking into account the velocity, velocity and jerk limits, and the derivative continuity of the final trajectory. For this purpose, the velocity profiling algorithm for B-spline paths is proposed. The methodology has been applied to the production cycle optimization of the pick-and-place process using a collaborative robot. In comparison with point-to-point movement and the solution provided by the RRT* algorithm with the same velocity profiling to ensure the same motion limitations, the proposed path planning algorithm decreased the entire production cycle time by 11.28% and 57.5%, respectively. The obtained results have been examined in a simulation with the entire production cycle visualization. Moreover, the smoothness of the movement of the robotic arm has been validated experimentally using a robotic arm. [ABSTRACT FROM AUTHOR]

Operational amplifiers (Op-Amps) are critical to sensor systems because they enable precise, reliable, and flexible signal processing. Current automated Op-Amp generation methods suffer from extremely low efficiency because the time-consuming SPICE-in-the-loop sizing is normally involved as its inner loop. In this paper, we propose an efficiently automated Op-Amp generation tool using a hybrid sizing method, which combines the merits together from a deterministic optimization algorithm and differential evolution algorithm. Thus, it can not only quickly find a decent local optimum, but also eventually converge to a global optimum. This feature is well fit to be serving as an acute filter in the circuit structure evaluation flow to efficiently eliminate any undesirable circuit structures in advance of detailed sizing. Our experimental results demonstrate its superiority over traditional sizing approaches and show its efficacy in highly boosting the efficiency of automated Op-Amp structure generation. [ABSTRACT FROM AUTHOR]

Sub-Nyquist synthetic aperture radar (SAR) based on pseudo-random time–space modulation has been proposed to increase the swath width while preserving the azimuthal resolution. Due to the sub-Nyquist sampling, the scene can be recovered by an optimization-based algorithm. However, these methods suffer from some issues, e.g., manually tuning difficulty and the pre-definition of optimization parameters, and a low signal–noise ratio (SNR) resistance. To address these issues, a reweighted optimization algorithm, named pseudo-ℒ0-norm optimization algorithm, is proposed for the sub-Nyquist SAR system in this paper. A modified regularization model is first built by applying the scene prior information to nearly acquire the number of nonzero elements based on Bayesian estimation, and then this model is solved by the Cauchy–Newton method. Additionally, an error correction method combined with our proposed pseudo-ℒ0-norm optimization algorithm is also present to eliminate defocusing in the motion-induced model. Finally, experiments with simulated signals and strip-map TerraSAR-X images are carried out to demonstrate the effectiveness and superiority of our proposed algorithm. [ABSTRACT FROM AUTHOR]

Currently, magnetic gradient tensor-based localization methods face challenges such as significant errors in geomagnetic field estimation, susceptibility to local optima in optimization algorithms, and inefficient performance. In addressing these issues, this article propose a two-point localization method under the constraint of overlaying geometric invariants. This method initially establishes the relationship between the target position and the magnetic gradient tensor by substituting an intermediate variable for the magnetic moment. Exploiting the property of the eigenvector corresponding to the minimum absolute eigenvalue being perpendicular to the target position vector, this constraint is superimposed to formulate a nonlinear system of equations of the target's position. In the process of determining the target position, the Nara method is employed for obtaining the initial values, followed by the utilization of the Levenberg–Marquardt algorithm to derive a precise solution. Experimental validation through both simulations and experiments confirms the effectiveness of the proposed method. The results demonstrate its capability to overcome the challenges faced by a single-point localization method in the presence of some errors in geomagnetic field estimation. In comparison to traditional two-point localization methods, the proposed method exhibits the highest precision. The localization outcomes under different noise conditions underscore the robust noise resistance and resilience of the proposed method. [ABSTRACT FROM AUTHOR]

Intelligent workshop UAV inspection path planning is a typical indoor UAV path planning technology. The UAV can conduct intelligent inspection on each work area of the workshop to solve or provide timely feedback on problems in the work area. The sparrow search algorithm (SSA), as a novel swarm intelligence optimization algorithm, has been proven to have good optimization performance. However, the reduction in the SSA's search capability in the middle or late stage of iterations reduces population diversity, leading to shortcomings of the algorithm, including low convergence speed, low solution accuracy and an increased risk of falling into local optima. To overcome these difficulties, an improved sparrow search algorithm (namely the chaotic mapping–firefly sparrow search algorithm (CFSSA)) is proposed by integrating chaotic cube mapping initialization, firefly algorithm disturbance search and tent chaos mapping perturbation search. First, chaotic cube mapping was used to initialize the population to improve the distribution quality and diversity of the population. Then, after the sparrow search, the firefly algorithm disturbance and tent chaos mapping perturbation were employed to update the positions of all individuals in the population to enable a full search of the algorithm in the solution space. This technique can effectively avoid falling into local optima and improve the convergence speed and solution accuracy. The simulation results showed that, compared with the traditional intelligent bionic algorithms, the optimized algorithm provided a greatly improved convergence capability. The feasibility of the proposed algorithm was validated with a final simulation test. Compared with other SSA optimization algorithms, the results show that the CFSSA has the best efficiency. In an inspection path planning problem, the CFSSA has its advantages and applicability and is an applicable algorithm compared to SSA optimization algorithms. [ABSTRACT FROM AUTHOR]