Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    New user? Click here to register.Have you forgotten your password?
Repository logo

Dspace KHENCHELA

  • Communities & Collections
  • All of DSpace
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Ferial, Laassami"

Now showing 1 - 1 of 1
Results Per Page
Sort Options
  • No Thumbnail Available
    Item
    IB-PSO: an inversed Butterworth particle swarm optimisation algorithm for multi-agent path planning
    (2024) Ferial, Laassami
    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.

DSpace software copyright © 2002-2026 LYRASIS

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback