algorithm

boids simulation

Boids Algorithm for Simulating Crowd Movement in Urban Planning and Disaster Management

By • • Jurnal, Knowledge, Project, Public, Research, Teaching • , , , , , • 14 minutes of reading

By Shahabuddin Amerudin Abstract The ability to accurately simulate crowd movement during emergencies is critical in urban planning and disaster management, as it helps design effective evacuation strategies and minimizes the potential for casualties. The Boids algorithm, initially developed to replicate the flocking behavior of birds, provides a versatile framework for modeling the dynamics of crowd movement. This paper explores the application of the Boids algorithm in simulating crowd movement during emergency situations such as floods, analyzing its strengths and limitations. Supported by a comprehensive literature review, this discussion examines the algorithm’s effectiveness in various scenarios, its potential for integration […]

Boids Algorithm for Simulating Crowd Movement in Urban Planning and Disaster Management Read More »

boids

Algoritma Boids: Pemodelan Tingkah Laku Kolektif dalam Sistem Multi-Agen

By • • Uncategorized • , , , • 5 minutes of reading

Oleh Shahabuddin Amerudin 1. Pengenalan Algoritma Boids, yang diperkenalkan oleh Craig Reynolds pada tahun 1986, adalah model simulasi yang direka untuk meniru tingkah laku kawanan burung, ikan, atau entiti lain yang bergerak secara koheren dalam kumpulan besar. Algoritma ini menjadi salah satu contoh utama bagaimana tingkah laku kompleks dapat muncul dari peraturan yang mudah, dengan setiap individu dalam kumpulan mengikuti peraturan tempatan tertentu tanpa keperluan untuk koordinasi pusat. 2. Prinsip Asas Algoritma Boids Pada asasnya, algoritma Boids beroperasi berdasarkan tiga peraturan utama yang mengawal tingkah laku setiap individu (atau “boid”) dalam kumpulan. Peraturan-peraturan ini bertujuan untuk memastikan bahawa setiap boid

Algoritma Boids: Pemodelan Tingkah Laku Kolektif dalam Sistem Multi-Agen Read More »

Student-Supervisor Matching Application

Development of a Web-Based Application for Matching Students with Supervisors Using a Weighted Scoring Algorithm

By • • Knowledge, Project, Research, Teaching • , , , , • 4 minutes of reading

By Shahabuddin Amerudin Abstract This paper presents the development of a web-based application designed to automate the matching process between students and supervisors. The application leverages a weighted scoring algorithm to evaluate compatibility based on various academic and professional criteria. The system aims to improve the efficiency and fairness of assigning supervisors by using a data-driven approach. The implementation involves PHP for server-side logic, JavaScript for client-side interaction, and JSON for data storage. This paper provides an overview of the development process, details of the algorithm, and examples demonstrating the application’s functionality. Introduction The process of assigning students to supervisors

Development of a Web-Based Application for Matching Students with Supervisors Using a Weighted Scoring Algorithm Read More »

Line Simplification Algorihtms in Python

By • • Knowledge, Project, Public, Research, Teaching • , , , • 2 minutes of reading

Here is an example of how the Douglas-Peucker, Visvalingam-Whyatt, and Reumann-Witkam line simplification algorithms can be implemented in Python: Douglas-Peucker algorithm: Visvalingam-Whyatt algorithm: Reumann-Witkam algorithm: In these implementations, the input is a list of points, and the tolerance value is a real number used to define the level of simplification. The output is a simplified version of the input line, represented as a list of points. It’s important to note that these implementations make use of numpy library and they expect the input points to be in the form of numpy array. Also, these codes are just examples and they

Line Simplification Algorihtms in Python Read More »

Line Simplification Pseudocodes

By • • Knowledge, Project, Research, Teaching • , , , • 2 minutes of reading

Line simplification is a process used to reduce the complexity and number of vertices in a polyline or polygon while preserving its overall shape and general characteristics. This can be useful for a variety of applications, including cartography, GIS, and computer graphics. There are several algorithms that can be used for line simplification, including the Douglas-Peucker algorithm, the Visvalingam-Whyatt algorithm, and the Reumann-Witkam algorithm. Pseudocode is a way to describe an algorithm using a combination of natural language and programming constructs. It is often used to describe algorithms in a way that is easy to understand for both programmers and

Line Simplification Pseudocodes Read More »

Scroll to Top