A Bending Sequence Planning Algorithm Based on Multiple-Constraint Model

Zhao, Zu Ye; Zhang, Li Chao; Shi, Yu

doi:10.4028/www.scientific.net/amr.1042.26

Cited by 2 publications

(3 citation statements)

References 5 publications

(5 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The population can be updated using the concentration operator (including the distance operator and the fitness value operator). Assume that the value of the first individual is the value of the fitness of the first individual; the value of the first individual is the value of the fitness of the first individual; the distance between individuals, if the center of the first individual, can be used to indicate the distance between the first individual and the first individual [8], defined as follows.…”

Section: Algorithm Execution Stepsmentioning

confidence: 99%

Thrust distribution algorithm based on supervision and switching and swarm intelligence

Yang¹

2023

HSET

View full text Add to dashboard Cite

The ship power positioning control system is the key to maintain the normal operation of the ship, and it is also the basic premise and foundation for the accurate positioning and stable forward movement of the ship, so many ship management and production enterprises attach great importance to the design and construction of the ship power positioning control system. "Thrust distribution" has always been the key technology for designing and constructing ship power positioning control system. When constructing ship power positioning control system by using thrust distribution technology, it is not only necessary to consider the constraint optimization of thrust limit and thrust rate of change limit of propeller, but also the constraint optimization of azimuth rate of change limit, mechanical wear optimization, restricted area limit optimization, etc. It is also necessary to consider the constraint optimization of azimuth rate of change limit, mechanical wear and tear, restricted area limit, etc. The thrust distribution algorithm based on supervision and switching and group intelligence can comprehensively deal with these constraints, which can improve the functions of the ship power positioning control system and solve the convergence problem in the system operation, and improve the operation efficiency, safety and stability of the ship power positioning control system. In this paper, the author discusses the thrust distribution algorithm based on supervision and switching and group intelligence in depth, combining relevant literature and the actual problem of thrust distribution.

show abstract

Section: Algorithm Execution Stepsmentioning

confidence: 99%

Thrust distribution algorithm based on supervision and switching and swarm intelligence

Yang¹

2023

HSET

View full text Add to dashboard Cite

show abstract

“…The problem of automatic computation of feasible or optimal bending sequences has been already considered in the literature, in particular with reference to the sheet metal bending problem (Hoffmann, Geiler, and Geiger 1992;Shpitalni and Saddan 1994;De Vin et al 1994). In this context, different approaches based on a tree representation of the bending sequence and on the application of A , or the travelling salesman problem algorithm, have been proposed (Faraz et al 2017;Zhao, Zhang, and Shi 2014;Gupta et al 1998). In particular, (Gupta et al 1998) introduces a distributed planning architecture, composed of a central operation planner and three domain-specific planners; the operational planner is based on A and leverages on domain-specific knowledges that are strictly related to the sheet metal bending problem.…”

Section: Introductionmentioning

confidence: 99%

“…In particular, (Gupta et al 1998) introduces a distributed planning architecture, composed of a central operation planner and three domain-specific planners; the operational planner is based on A and leverages on domain-specific knowledges that are strictly related to the sheet metal bending problem. In (Zhao, Zhang, and Shi 2014), instead, the sequence planning is converted to a generalised shortest path problem, and an A search is performed, whose distinguished element is a heuristic based on bending feasibility, dimensional accuracy and processing efficiency. Following a similar philosophy, in ) and (Faraz et al 2017) bending sequences are represented as a tree, consequently the best sequence computation is formulated as a travelling salesman problem and solved using a branch-and-bound technique based on manufacturing knowledge that is specific to sheet metal bending.…”

Section: Introductionmentioning

confidence: 99%

Automatic computation of bending sequences for wire bending machines

Baraldo¹,

Bascetta

Caprotti³

et al. 2022

International Journal of Computer Integrated Manufacturing

View full text Add to dashboard Cite

Determining a feasible bending sequence, i.e., ensuring absence of wire self-collisions and wire-machine collisions, or even an optimal bending sequence, i.e., minimising time or energy required to perform it, can be a difficult and time consuming task for complex workpieces, even for an expert operator. The introduction of algorithms for the computation of wire bending sequences is thus crucial to increase productivity and production flexibility, and to decrease production costs. To this aim, this work proposes an algorithm to automatically determine an appropriate bending sequence for a given workpiece, bending tool, and machine 3D CAD model, that leverages on a representation of the wire as a robotic manipulator and of a bending sequence as a tree, and on the adoption of A as graph search algorithm. A cost and a heuristic function, suitable for the wire bending problem, and an approach to parallelise the execution of A are introduced, as well. In this way, a computationally simple and efficient wire bending sequence computation algorithm can be devised, able to determine a solution in an amount of time less or equal to the time used by an expert operator, without the need of high computational power. Finally, the effectiveness of this algorithm is assessed on two different test cases, relevant to industrial workpieces.

show abstract

A Bending Sequence Planning Algorithm Based on Multiple-Constraint Model

Cited by 2 publications

References 5 publications

Thrust distribution algorithm based on supervision and switching and swarm intelligence

Thrust distribution algorithm based on supervision and switching and swarm intelligence

Automatic computation of bending sequences for wire bending machines

Contact Info

Product

Resources

About