[Feature]: adding abstraction of optimal agent movement
Open
Nobody has claimed this yet.
feature
- Dominant language
- Python
- Stars
- 42
- Forks
- 18
- Avg merge
- 1m
- Merged PRs (30d)
- 1
Description
It would be beneficial to have a function in the DiscreteSpaceDF (and AgentContainer) for moving agents based on attributes:
move_to(agents: AgentLike, attr_names: str | list[str], rank_order: ['max' | 'min'] | list['max' | 'min'])
For example: move_to('sugar', 'max'). This would abstract the code for handling sequential conflicts, making it easier than handling them from scratch each time.
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reading the existing movement and conflict-handling code in DiscreteSpaceDF and AgentContainer. Clarify how sequential conflicts should be resolved for one or multiple attributes and rank orders. Done means both classes provide the specified move_to interface and cover the requested optimal movement behavior.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 25/100