Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
Flatland
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
pranjal_dhole
Flatland
Commits
5f8a5de1
Commit
5f8a5de1
authored
3 years ago
by
Dipam Chakraborty
Browse files
Options
Downloads
Patches
Plain Diff
update calculation of speed normalized path lengths
parent
2bf8a326
No related branches found
No related tags found
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
flatland/envs/rail_env_utils.py
+1
-1
1 addition, 1 deletion
flatland/envs/rail_env_utils.py
flatland/envs/schedule_generators.py
+7
-13
7 additions, 13 deletions
flatland/envs/schedule_generators.py
with
8 additions
and
14 deletions
flatland/envs/rail_env_utils.py
+
1
−
1
View file @
5f8a5de1
...
@@ -33,7 +33,7 @@ def load_flatland_environment_from_file(file_name: str,
...
@@ -33,7 +33,7 @@ def load_flatland_environment_from_file(file_name: str,
max_depth
=
2
,
max_depth
=
2
,
predictor
=
ShortestPathPredictorForRailEnv
(
max_depth
=
10
))
predictor
=
ShortestPathPredictorForRailEnv
(
max_depth
=
10
))
environment
=
RailEnv
(
width
=
1
,
height
=
1
,
rail_generator
=
rail_from_file
(
file_name
,
load_from_package
),
environment
=
RailEnv
(
width
=
1
,
height
=
1
,
rail_generator
=
rail_from_file
(
file_name
,
load_from_package
),
schedul
e_generator
=
line_from_file
(
file_name
,
load_from_package
),
lin
e_generator
=
line_from_file
(
file_name
,
load_from_package
),
number_of_agents
=
1
,
number_of_agents
=
1
,
obs_builder_object
=
obs_builder_object
,
obs_builder_object
=
obs_builder_object
,
record_steps
=
record_steps
,
record_steps
=
record_steps
,
...
...
This diff is collapsed.
Click to expand it.
flatland/envs/schedule_generators.py
+
7
−
13
View file @
5f8a5de1
...
@@ -32,6 +32,7 @@ def schedule_generator(agents: List[EnvAgent], config_speeds: List[float], dist
...
@@ -32,6 +32,7 @@ def schedule_generator(agents: List[EnvAgent], config_speeds: List[float], dist
old_max_episode_steps_multiplier
=
3.0
old_max_episode_steps_multiplier
=
3.0
new_max_episode_steps_multiplier
=
1.5
new_max_episode_steps_multiplier
=
1.5
travel_buffer_multiplier
=
1.3
# must be strictly lesser than new_max_episode_steps_multiplier
travel_buffer_multiplier
=
1.3
# must be strictly lesser than new_max_episode_steps_multiplier
assert
new_max_episode_steps_multiplier
>
travel_buffer_multiplier
end_buffer_multiplier
=
0.05
end_buffer_multiplier
=
0.05
mean_shortest_path_multiplier
=
0.2
mean_shortest_path_multiplier
=
0.2
...
@@ -39,20 +40,14 @@ def schedule_generator(agents: List[EnvAgent], config_speeds: List[float], dist
...
@@ -39,20 +40,14 @@ def schedule_generator(agents: List[EnvAgent], config_speeds: List[float], dist
shortest_paths_lengths
=
[
len
(
v
)
for
k
,
v
in
shortest_paths
.
items
()]
shortest_paths_lengths
=
[
len
(
v
)
for
k
,
v
in
shortest_paths
.
items
()]
# Find mean_shortest_path_time
# Find mean_shortest_path_time
agent_shortest_path_times
=
[]
agent_speeds
=
[
agent
.
speed_data
[
'
speed
'
]
for
agent
in
agents
]
for
agent
in
agents
:
agent_shortest_path_times
=
np
.
array
(
shortest_paths_lengths
)
/
np
.
array
(
agent_speeds
)
speed
=
agent
.
speed_data
[
'
speed
'
]
distance
=
shortest_paths_lengths
[
agent
.
handle
]
agent_shortest_path_times
.
append
(
int
(
np
.
ceil
(
distance
/
speed
)))
mean_shortest_path_time
=
np
.
mean
(
agent_shortest_path_times
)
mean_shortest_path_time
=
np
.
mean
(
agent_shortest_path_times
)
# Deciding on a suitable max_episode_steps
# Deciding on a suitable max_episode_steps
max_sp_len
=
max
(
shortest_paths_lengths
)
# longest path
longest_speed_normalized_time
=
np
.
max
(
agent_shortest_path_times
)
min_speed
=
min
(
config_speeds
)
# slowest possible speed in config
mean_path_delay
=
mean_shortest_path_time
*
mean_shortest_path_multiplier
max_episode_steps_new
=
int
(
np
.
ceil
(
longest_speed_normalized_time
*
new_max_episode_steps_multiplier
)
+
mean_path_delay
)
longest_sp_time
=
max_sp_len
/
min_speed
max_episode_steps_new
=
int
(
np
.
ceil
(
longest_sp_time
*
new_max_episode_steps_multiplier
))
max_episode_steps_old
=
int
(
max_episode_steps
*
old_max_episode_steps_multiplier
)
max_episode_steps_old
=
int
(
max_episode_steps
*
old_max_episode_steps_multiplier
)
...
@@ -67,8 +62,7 @@ def schedule_generator(agents: List[EnvAgent], config_speeds: List[float], dist
...
@@ -67,8 +62,7 @@ def schedule_generator(agents: List[EnvAgent], config_speeds: List[float], dist
for
agent
in
agents
:
for
agent
in
agents
:
agent_shortest_path_time
=
agent_shortest_path_times
[
agent
.
handle
]
agent_shortest_path_time
=
agent_shortest_path_times
[
agent
.
handle
]
agent_travel_time_max
=
int
(
np
.
ceil
((
agent_shortest_path_time
*
travel_buffer_multiplier
)
\
agent_travel_time_max
=
int
(
np
.
ceil
((
agent_shortest_path_time
*
travel_buffer_multiplier
)
+
mean_path_delay
))
+
(
mean_shortest_path_time
*
mean_shortest_path_multiplier
)))
departure_window_max
=
max
(
latest_arrival_max
-
agent_travel_time_max
,
1
)
departure_window_max
=
max
(
latest_arrival_max
-
agent_travel_time_max
,
1
)
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment