IB-PSO: an inversed Butterworth particle swarm optimisation algorithm for multi-agent path planning
| dc.contributor.author | Ferial, Laassami | |
| dc.date.accessioned | 2026-09-29T12:11:51Z | |
| dc.date.available | 2026-09-29T12:11:51Z | |
| dc.date.issued | 2024 | |
| dc.description.abstract | Abstract: Path planning has an immense impact on the agents’ coordination. This problem becomes more challenging to solve due to the various constraints. Recently, many optimisation techniques were proposed to solve the multi-agent path planning. However, among the most reliable techniques are those based on metaheuristic principles. In this paper, we propose a novel multi-agent path planning based on an enhanced version of the particle swarm optimisation (PSO). The inertia weight is a PSO parameter allowing the control of the exploration and the exploitation of the search space. Therefore, we propose a new inertia weight calculation method known as the inversed Butterworth particle swarm optimisation (IBPSO). The main objective of this approach is to provide an adequate transition between the exploitation and the exploration of the search space. To reflect the feasibility of this extension, we compared it with different PSO versions. The showcased results prove the efficiency of the proposed approach. | |
| dc.identifier.uri | http://dspace.univ-khenchela.dz:4000/handle/123456789/11565 | |
| dc.language.iso | en | |
| dc.title | IB-PSO: an inversed Butterworth particle swarm optimisation algorithm for multi-agent path planning | |
| dc.type | Article |