An efficient algorithm to find \(k\)-nearest neighbors in flocking behavior (Q765482): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2010.04.024 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033254644 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Coordination of groups of mobile autonomous agents using nearest neighbor rules / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Prominence convergence in the collective synchronization of situated multi-agents / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:54, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm to find \(k\)-nearest neighbors in flocking behavior |
scientific article |
Statements
An efficient algorithm to find \(k\)-nearest neighbors in flocking behavior (English)
0 references
19 March 2012
0 references
spatial subdivision
0 references
agents
0 references
