-
Notifications
You must be signed in to change notification settings - Fork 0
/
carla.py
1158 lines (669 loc) · 32.8 KB
/
carla.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
import os
import sys
# sys.path.append(".")
import glob
import math
from enum import Enum
from collections import deque
import random
import networkx as nx
import numpy as np
from agents.navigation.controller import VehiclePIDController
try:
sys.path.append(glob.glob('../carla/dist/carla-*%d.%d-%s.egg' % (
sys.version_info.major,
sys.version_info.minor,
'win-amd64' if os.name == 'nt' else 'linux-x86_64'))[0])
except IndexError:
pass
import carla
def positive(num):
"""
Return the given number if positive, else 0
:param num: value to check
"""
return num if num > 0.0 else 0.0
def get_speed(vehicle):
vel = vehicle.get_velocity()
return 3.6*math.sqrt(vel.x**2 + vel.y**2 + vel.z**2)
def distance_vehicle(waypoint , vehicle_transfrom):
loc = vehicle_transfrom.location
x = waypoint.transform.location.x - loc.x
y = waypoint.transform.location.y - loc.y
return math.sqrt(x*x + y*y)
def vector(location_1 , location_2):
x = location_2.x - location_1.x
y = location_2.y - location_1.y
z = location_2.z - location_1.z
norm = np.linalg.norm([x , y , z ]) + np.finfo(float).eps
return [x/norm , y/norm , z/norm ]
def is_within_distance(target_location , current_location , orientation , max_distance , d_angle_th_up , d_angle_th_low = 0):
target_vector = np.array([target_location.x - current_location.x , target_location.y- current_location.y])
norm_target = np.linalg.norm(target_vector)
if norm_target < 0.001:
return True
if norm_target > max_distance:
return False
forward_vector = np.array([math.cos(math.radians(orientation)) , math.sin(math.radians(orientation))])
d_angle = math.degrees(math.acos(np.clip(np.dot(forward_vector , target_vector)/norm_target,-1.,1.)))
return d_angle_th_low<d_angle <d_angle_th_up
def compute_distance(location_1 ,location_2):
x = location_2.x - location_1.x
y = location_2.y - location_1.y
z = location_2.z - location_1.z
norm = np.linalg.norm([x,y,z])+ np.finfo(float).eps
return norm
class Normal(object):
max_speed = 50
speed_lim_dist = 3
speed_decrease = 10
safety_time = 3
min_proximity_threshold = 10
braking_distance = 6
overtake_counter = -1
tailgate_counter = 0
class RoadOption(Enum):
VOID = -1
LEFT = 1
RIGHT = 2
STRAIGHT = 3
LANEFOLLOW = 4
CHANGELANELEFT = 5
CHANGELANERIGHT = 6
class LocalPlanner(object):
FPS = 20
def __init__(self,agent):
self._vehicle = agent.vehicle
self._map = agent.vehicle.get_world().get_map()
self._target_speed = None
self.sampling_radius = None
self._min_distance = 3
self._current_distance = None
self.target_road_option = None
self._vehicle_controller = None
self._global_plan = None
self._pid_controller = None
self.waypoints_queue = deque(maxlen = 20000)
self._buffer_size = 5
self._waypoint_buffer = deque(maxlen=self._buffer_size)
self.args_lat_hw_dict = {
'K_P': 0.75,
'K_D': 0.02,
'K_I': 0.4,
'dt': 1.0 / self.FPS}
self.args_lat_city_dict = {
'K_P': 0.58,
'K_D': 0.02,
'K_I': 0.5,
'dt': 1.0 / self.FPS}
self.args_long_hw_dict = {
'K_P': 0.37,
'K_D': 0.024,
'K_I': 0.032,
'dt': 1.0 / self.FPS}
self.args_long_city_dict = {
'K_P': 0.15,
'K_D': 0.05,
'K_I': 0.07,
'dt': 1.0 / self.FPS}
def get_incoming_waypoint_and_direction(self,steps=3):
if len(self.waypoints_queue)>steps:
return self.waypoints_queue[steps]
else:
try:
wpt , direction = self.waypoints_queue[-1]
return wpt,direction
except IndexError as i:
return None ,RoadOption.VOID
return None , RoadOption.VOID
def set_speed(self,speed):
self._target_speed = speed
def set_global_plan(self , current_plan , clean = True):
print('set_global_plan called')
for elem in current_plan :
self.waypoints_queue.append(elem)
if clean :
self._waypoint_buffer.clear()
for _ in range(self._buffer_size):
if self.waypoints_queue:
self._waypoint_buffer.append(self.waypoints_queue.popleft())
else :
break
self._global_plan = True
def run_step(self, target_speed = None , debug= False):
print('run_step _local_planner called')
if target_speed is not None :
self._target_speed = target_speed
else :
self.target_speed = self.vehicle.get_speed_limit()
if (len(self.waypoints_queue) == 0):
control = carla.VehicleControl()
control.steer = 0.0
control.throttle = 0.0
control.brake = 0.0
control.hand_brake = False
control.manual_gear_shift = False
return control
if not self._waypoint_buffer:
for i in range(self._buffer_size):
if self.waypoints_queue:
self._waypoint_buffer.append(self.waypoints_queue.popleft())
else :
break
self._current_waypoint = self._map.get_waypoint(self._vehicle.get_location())
self.target_waypoint , self.target_road_option = self._waypoint_buffer[0]
if target_speed > 50:
args_lat = self.args_lat_hw_dict
args_long = self.args_long_hw_dict
else :
args_lat = self.args_lat_city_dict
args_long = self.args_long_city_dict
self._pid_controller = VehiclePIDController(self._vehicle , args_lateral = args_lat , args_longitudinal = args_long)
control = self._pid_controller.run_step(self._target_speed , self.target_waypoint)
vehicle_transfrom = self._vehicle.get_transform()
max_index = -1
for i , (waypoint , _) in enumerate(self._waypoint_buffer):
if distance_vehicle(waypoint , vehicle_transfrom) < self._min_distance:
max_index = i
if max_index >=0:
for i in range(max_index+1):
self._waypoint_buffer.popleft()
return control
class GlobalRoutePlannerDAO(object):
def __init__(self , wmap , sampling_resolution):
self._sampling_resolution = sampling_resolution
self._wmap = wmap
def get_topology(self):
"""
Accessor for topology.
This function retrieves topology from the server as a list of
road segments as pairs of waypoint objects, and processes the
topology into a list of dictionary objects.
:return topology: list of dictionary objects with the following attributes
entry - waypoint of entry point of road segment
entryxyz- (x,y,z) of entry point of road segment
exit - waypoint of exit point of road segment
exitxyz - (x,y,z) of exit point of road segment
path - list of waypoints separated by 1m from entry
to exit
"""
topology = []
# Retrieving waypoints to construct a detailed topology
for segment in self._wmap.get_topology():
wp1, wp2 = segment[0], segment[1]
l1, l2 = wp1.transform.location, wp2.transform.location
# Rounding off to avoid floating point imprecision
x1, y1, z1, x2, y2, z2 = np.round([l1.x, l1.y, l1.z, l2.x, l2.y, l2.z], 0)
wp1.transform.location, wp2.transform.location = l1, l2
seg_dict = dict()
seg_dict['entry'], seg_dict['exit'] = wp1, wp2
seg_dict['entryxyz'], seg_dict['exitxyz'] = (x1, y1, z1), (x2, y2, z2)
seg_dict['path'] = []
endloc = wp2.transform.location
if wp1.transform.location.distance(endloc) > self._sampling_resolution:
w = wp1.next(self._sampling_resolution)[0]
while w.transform.location.distance(endloc) > self._sampling_resolution:
seg_dict['path'].append(w)
w = w.next(self._sampling_resolution)[0]
else:
seg_dict['path'].append(wp1.next(self._sampling_resolution)[0])
topology.append(seg_dict)
return topology
def get_resolution(self):
return self._sampling_resolution
def get_waypoint(self,location):
waypoint = self._wmap.get_waypoint(location)
return waypoint
class GlobalRoutePlanner(object):
def __init__(self,dao):
self._dao = dao
self._topology = None
self._graph = None
self._id_map = None
self._road_id_to_edge = None
self._intersection_end_node = -1
self._previous_decision = RoadOption.VOID
def setup(self):
print('setup called ')
self._topology = self._dao.get_topology()
self._graph , self._id_map , self._road_id_to_edge = self._build_graph()
self._find_loose_ends()
self._lane_change_link()
def _build_graph(self):
print('_build_graph called')
graph = nx.DiGraph()
id_map = dict()
road_id_to_edge = dict()
for segment in self._topology:
entry_xyz , exit_xyz = segment['entryxyz'] , segment['exitxyz']
path = segment['path']
entry_wp , exit_wp = segment['entry'] , segment['exit']
intersection = entry_wp.is_junction
road_id , section_id , lane_id = entry_wp.road_id , entry_wp.section_id , entry_wp.lane_id
for vertex in entry_xyz , exit_xyz:
if vertex not in id_map:
new_id = len(id_map)
id_map[vertex] = new_id
graph.add_node(new_id , vertex = vertex)
n1 = id_map[entry_xyz]
n2 = id_map[exit_xyz]
if road_id not in road_id_to_edge:
road_id_to_edge[road_id] = dict()
if section_id not in road_id_to_edge[road_id]:
road_id_to_edge[road_id][section_id] = dict()
road_id_to_edge[road_id][section_id][lane_id] = (n1 , n2)
entry_carla_vector = entry_wp.transform.rotation.get_forward_vector()
exit_carla_vector = exit_wp.transform.rotation.get_forward_vector()
graph.add_edge(n1 , n2 , length = len(path)+1 , path = path , entry_waypoint = entry_wp , exit_waypoint = exit_wp , entry_vector = np.array([entry_carla_vector.x, entry_carla_vector.y , entry_carla_vector.z ]), exit_vector = np.array([exit_carla_vector.x , exit_carla_vector.y , exit_carla_vector.z ]), net_vector = vector(entry_wp.transform.location , exit_wp.transform.location),intersection= intersection , type = RoadOption.LANEFOLLOW)
return graph , id_map , road_id_to_edge
def _find_loose_ends(self):
print('_find_loose_ends called')
count_loose_ends = 0
hop_resolution = self._dao.get_resolution()
for segment in self._topology:
end_wp = segment['exit']
exit_xyz = segment['exitxyz']
road_id , section_id , lane_id = end_wp.road_id , end_wp.section_id , end_wp.lane_id
if road_id in self._road_id_to_edge and section_id in self._road_id_to_edge[road_id] and lane_id in self._road_id_to_edge[road_id][section_id]:
pass
else :
count_loose_ends+=1
if road_id not in self._road_id_to_edge:
self._road_id_to_edge[road_id] = dict()
if section_id not in self._road_id_to_edge[road_id]:
self._road_id_to_edge[road_id][section_id] = dict()
n1 = self._id_map[exit_xyz]
n2 = -1*count_loose_ends
self._road_id_to_edge[road_id][section_id][lane_id] = (n1 , n2)
next_wp = end_wp.next(hop_resolution)
path=[]
while next_wp is not None and next_wp[0].road_id == road_id and next_wpt[0].section_id==section_id and end_wp[0].lane_id == lane_id:
path.append(next_wp[0])
next_wp = next_wp[0].next(hop_resolution)
if path :
n2_xyz = (path[-1].transform.location.x,path[-1].transform.location.y , path[-1].location.z)
self._graph.add_node(n2 , vertex = n2_xyz)
self._graph.add_edge(n1 , n2 , length= len(path)+1 , path = path , entry_waypoint = end_wp , exit_waypoint = path[-1], entry_vector=None , exit_vector = None , net_vector=None , intersection = end_wp.is_junction , type = RoadOption.LANEFOLLOW )
def _localize(self , location):
print('_localize called')
waypoint = self._dao.get_waypoint(location)
edge = None
try:
edge = self._road_id_to_edge[waypoint.road_id][waypoint.section_id][waypoint.lane_id]
except KeyError:
print('failed to localize')
return edge
def _lane_change_link(self):
print('_lane_change_link called ')
for segment in self._topology:
left_found , right_found = False , False
for waypoint in segment['path']:
if not segment['entry'].is_junction:
next_waypoint , next_road_option , next_segment = None , None , None
if waypoint.right_lane_marking.lane_change & carla.LaneChange.Right and not right_found:
next_waypoint = waypoint.get_right_lane()
if next_waypoint is not None and next_waypoint.lane_type == carla.LaneType.Driving and waypoint.road_id == next_waypoint.road_id:
next_road_option = RoadOption.CHANGELANERIGHT
next_segment = self._localize(next_waypoint.transform.location)
if next_segment is not None:
self._graph.add_edge(self._id_map[segment['entryxyz']] , next_segment[0] , entry_waypoint = waypoint , exit_waypoint = next_waypoint ,intersection = False , exit_vector = None , path = [] , length=0 ,type = next_road_option , change_waypoint = next_waypoint )
right_found = True
if waypoint.left_lane_marking.lane_change & carla.LaneChange.Left and not left_found:
next_waypoint = waypoint.get_left_lane()
if next_waypoint is not None and next_waypoint.lane_type == carla.LaneType.Driving and waypoint.road_id == next_waypoint.road_id:
next_road_option = RoadOption.CHANGELANELEFT
next_segment = self._localize(next_waypoint.transform.location)
if next_segment is not None:
self._graph.add_edge(self._id_map[segment['entryxyz']] , next_segment[0] , entry_waypoint = waypoint , exit_waypoint = next_waypoint , intersection = False , exit_vector = None, path =[] , length = 0 , type = next_road_option , change_waypoint = next_waypoint)
left_found = True
if left_found and right_found :
break
def _distance_heuristic(self , n1 ,n2 ):
l1 = np.array(self._graph.nodes[n1]['vertex'])
l2 = np.array(self._graph.nodes[n2]['vertex'])
return np.linalg.norm(l1 - l2)
def _path_search(self, origin , destination):
print('_path_search called')
start , end = self._localize(origin) , self._localize(destination)
route = nx.astar_path(self._graph , source = start[0] , target = end[0] , heuristic = self._distance_heuristic , weight = 'length')
route.append(end[1])
return route
def _successive_last_intersection_edge(self,index , route):
print('_successive_last_intersection_edge called')
last_intersection_edge = None
last_node = None
for node1 , node2 in [(route[i] , route[i+1]) for i in range(index , len(route)-1)]:
candidate_edge = self._graph.edges[node1 , node2]
if node1 == route[index]:
last_intersection_edge = candidate_edge
if candidate_edge['type'] == RoadOption.LANEFOLLOW and candidate_edge['intersection']:
last_intersection_edge = candidate_edge
last_node = node2
else :
break
return last_node , last_intersection_edge
def _turn_decision(self , index , route , threshold = math.radians(35)):
print('_turn_decision called')
decision = None
previous_node = route[index-1]
current_node = route[index]
next_node = route[index+1]
next_edge = self._graph.edges[current_node , next_node]
if index > 0:
if self._previous_decision != RoadOption.VOID and self._intersection_end_node > 0 and self._intersection_end_node != previous_node and next_edge['type'] == RoadOption.LANEFOLLOW and next_edge['intersection']:
decision = self._previous_decision
else :
self._intersection_end_node = -1
current_edge = self._graph.edges[previous_node , current_node]
calculate_turn = current_edge['type'] == RoadOption.LANEFOLLOW and not current_edge['intersection'] and next_edge['type'] == RoadOption.LANEFOLLOW and next_edge['intersection']
if calculate_turn :
last_node , tail_edge = self._successive_last_intersection_edge(index , route)
self._intersection_end_node = last_node
if tail_edge is not None :
next_edge = tail_edge
cv , nv = current_edge['exit_vector'] , next_edge['exit_vector']
if cv is None or nv is None :
return next_edge['type']
cross_list = []
for neighbor in self._graph.successors(current_node):
select_edge = self._graph.edges[current_node , neighbor]
if select_edge['type'] == RoadOption.LANEFOLLOW:
if neighbor != route[index+1]:
sv = select_edge['net_vector']
cross_list.append(np.cross(cv ,sv)[2])
next_cross = np.cross(cv , nv)[2]
deviation = math.acos(np.clip(np.dot(cv , nv )/(np.linalg.norm(nv)) , -1.0 , 1.0))
if not cross_list :
cross_list.append(0)
if deviation < threshold:
decision = RoadOption.STRAIGHT
elif cross_list and next_cross < min(cross_list):
decision = RoadOption.LEFT
elif cross_list and next_cross > max(cross_list):
decision = RoadOption.RIGHT
elif next_cross < 0:
decision = RoadOption.LEFT
elif next_cross > 0 :
decision = RoadOption.RIGHT
else :
decision = next_edge['type']
self._previous_decision = decision
return decision
def _find_closest_in_list(self , current_waypoint , waypoint_list):
print('_find_closest_in_list called')
min_distance = float('inf')
closest_index = -1
for i , waypoint in enumerate(waypoint_list):
distance = waypoint.transform.location.distance(current_waypoint.transform.location)
if distance < min_distance :
min_distance = distance
closest_index = i
return closest_index
def trace_route(self , origin , destination):
print('trace_route of GlobalRoutePlanner called')
route_trace = []
route = self._path_search(origin , destination)
current_waypoint = self._dao.get_waypoint(origin)
destination_waypoint = self._dao.get_waypoint(destination)
resolution = self._dao.get_resolution()
for i in range(len(route)-1):
road_option = self._turn_decision(i , route)
edge = self._graph.edges[route[i] , route[i+1]]
path = []
if edge['type'] != RoadOption.LANEFOLLOW and edge['type'] != RoadOption.VOID:
route_trace.append((current_waypoint , road_option))
exit_wp = edge['exit_waypoint']
n1 , n2 = self._road_id_to_edge[exit_wp.road_id][exit_wp.section_id][exit_wp.lane_id]
next_edge = self._graph.edges[n1,n2]
if next_edge['path']:
closest_index = self._find_closest_in_list(current_waypoint , next_edge['path'])
closest_index = min(len(next_edge['path'])-1 , closest_index+5)
current_waypoint = next_edge['path'][closest_index]
else :
current_waypoint = next_edge['exit_waypoint']
route_trace.append((current_waypoint , road_option))
else :
path = path + [edge['entry_waypoint']] + edge['path'] + [edge['exit_waypoint']]
closest_index = self._find_closest_in_list(current_waypoint , path)
for waypoint in path[closest_index:]:
current_waypoint = waypoint
route_trace.append((current_waypoint , road_option ))
if len(route)-i <= 2 and waypoint.transform.location.distance(destination) < 2*resolution:
break
elif len(route) - i <=2 and current_waypoint.road_id == destination_waypoint.road_id and current_waypoint.section_id == destination_waypoint.section_id and current_waypoint.lane_id == destination_waypoint.lane_id:
destination_index = self._find_closest_in_list(destination_waypoint , path)
if closest_index > destination_index:
break
return route_trace
class Agent(object):
def __init__(self , vehicle):
self._vehicle = vehicle
self._proximity_tlight_threshold = 5.0
self._proximity_vehicle_threshold = 10.0
self._local_planner = None
self._world = self._vehicle.get_world()
try :
self._map = self._world.get_map()
except RuntimeError as error:
print('RuntimeError : {}' .format(error))
self._last_traffic_light = None
def _bh_is_vehicle_hazard(self , ego_wpt , ego_loc , vehicle_list , proximity_th , up_angle_th , low_angle_th = 0 , lane_offset =0):
print('_bh_is_vehicle_hazard called')
if ego_wpt.lane_id < 0 and lane_offset !=0:
lane_offset*=-1
for target_vehicle in vehicle_list:
target_vehicle_loc = target_vehicle.get_location()
target_wpt = self._map.get_waypoint(target_vehicle_loc)
if target_wpt.road_id != ego_wpt.road_id or target_wpt.lane_id !=ego_wpt.lane_id +lane_offset:
next_wpt = self._local_planner.get_incoming_waypoint_and_direction(steps=5)[0]
if target_wpt.road_id != next_wpt.road_id or target_wpt.lane_id != next_wpt.lane_id + lane_offset:
continue
if is_within_distance(target_vehicle_loc , ego_loc , self._vehicle.get_transform().rotation.yaw,proximity_th , up_angle_th , low_angle_th):
return (True , target_vehicle , compute_distance(target_vehicle_loc , ego_loc))
return (False , None , -1)
@staticmethod
def emergency_stop():
print('emergency_stop called ')
control = carla.VehicleControl()
control.steer = 0.0
control.throttle = 0.0
control.brake = 1.0
control.hand_brake = False
return control
class BehavoirAgent(Agent):
def __init__(self,vehicle , ignore_traffic_light = False , behavior = 'normal'):
super(BehavoirAgent,self).__init__(vehicle)
self.vehicle = vehicle
self.ignore_traffic_light = ignore_traffic_light
self._local_planner = LocalPlanner(self)
self._grp = None
self.look_ahead_steps = 0
#vehicle information
self.speed = 0
self.speed_limit = 0
self.direction = None
self.incoming_direction = None
self.incoming_waypoint = None
self.start_waypoint = None
self.end_waypoint = None
self.is_at_traffic_light = 0
self.light_state = "Green"
self.light_id_to_ignore = -1
self.min_speed = 5
self.behavior = None
self._sampling_resolution = 4.5
if behavior == 'normal':
self.behavior = Normal()
def update_information(self):
print('update_information called')
self.speed = get_speed(self.vehicle)
self.speed_limit = self.vehicle.get_speed_limit()
self._local_planner.set_speed(self.speed_limit)
self.direction = self._local_planner.target_road_option
if self.direction is None:
self.direction = RoadOption.LANEFOLLOW
self.look_ahead_steps = int((self.speed_limit)/10)
self.incoming_waypoint , self.incoming_direction = self._local_planner.get_incoming_waypoint_and_direction(steps =self.look_ahead_steps)
if self.incoming_direction is None:
self.direction = RoadOption.LANEFOLLOW
self.is_at_traffic_light = self.vehicle.is_at_traffic_light()
if self.ignore_traffic_light:
self.light_state = "Green"
else:
self.light_state = str(self.vehicle.get_traffic_light_state())
def set_destination(self,start_location ,end_location , clean = False):
print('set_destination called')
if clean :
self._local_planner.waypoints_queue.clear()
self.start_waypoint = self._map.get_waypoint(start_location)
self.end_waypoint = self._map.get_waypoint(end_location)
route_trace = self._trace_route(self.start_waypoint , self.end_waypoint)
self._local_planner.set_global_plan(route_trace , clean)
def _trace_route(self,start_waypoint , end_waypoint):
print('_trace_route BehavoirAgent called')
if self._grp is None:
wld = self.vehicle.get_world()
dao = GlobalRoutePlannerDAO(wld.get_map() , sampling_resolution = self._sampling_resolution)
grp = GlobalRoutePlanner(dao)
grp.setup()
self._grp = grp
route = self._grp.trace_route(start_waypoint.transform.location , end_waypoint.transform.location)
return route
def reroute(self, spawn_points):
print('reroute called ')
random.shuffle(spawn_points)
new_start = self._local_planner.waypoints_queue[-1][0].transform.location
destination = spawn_points[0].location if spawn_points[0].location != new_start else spawn_points[1].location
self.set_destination(new_start , destination)
def traffic_light_manager(self, waypoint ):
print('traffic_light_manager called')
light_id = self.vehicle.get_traffic_light().id if self.vehicle.get_traffic_light() is not None else -1
if self.light_state == "Red":
if not waypoint.is_junction and (self.light_id_to_ignore!= light_id or light_id == -1 ):
return 1
elif waypoint.is_junction and light_id != -1:
self.light_id_to_ignore = light_id
if self.light_id_to_ignore != light_id:
light_id_to_ignore = -1
return 0
def _overtake(self, location , waypoint , vehicle_list):
print('overtake called 000000000000000000000000000000000000000000000000000000000000000000000000000000000000000')
left_turn = None
right_turn = None
left_wpt = waypoint.get_left_lane()
right_wpt = waypoint.get_right_lane()
if (left_turn == carla.LaneChange.Left or left_turn == carla.LaneChange.Both ) and waypoint.lane_id * left_wpt.lane_id > 0 and left_wpt.lane_type == carla.LaneType.Driving:
new_vehicle_state , _ ,_ = self._bh_is_vehicle_hazard(waypoint , location , vehicle_list , max(self.behavior.min_proximity_threshold , self.speed_limit / 3 ) , up_angle_th = 180 , lane_offset =-1)
if not new_vehicle_state :
self.behavior.overtake_counter = 200
self.set_destination(left_wpt.transform.location , self.end_waypoint , clean = True)
elif right_turn == carla.LaneChange.Right and waypoint.lane_id * right_wpt.lane_id > 0 and right_wpt.lane_type == carla.LaneType.Driving :
new_vehicle_state , _ , _ = self._bh_is_vehicle_hazard(waypoint , location , vehicle_list , max(self.behavior.min_proximity_threshold , self.speed_limit / 3) , up_angle_th = 180 , lane_offset = 1)
if not new_vehicle_state :
self.behavior.overtake_counter = 200
self.set_destination(right_wpt.transform.location , self.end_waypoint.transform.location , clean = True)
def _tailgating(self , location , waypoint , vehicle_list):
print('tailgating called ttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttt')
left_turn = waypoint.left_lane_marking.lane_change
right_turn = waypoint.right_lane_marking.lane_change
left_wpt = waypoint.get_left_lane()
right_wpt = waypoint.get_right_lane()
behind_vehicle_state , behind_vehicle , _ = self._bh_is_vehicle_hazard(waypoint , location , vehicle_list , max(self.behavior.min_proximity_threshold , self.speed_limit/2) , up_angle_th = 180 , low_angle_th = 160)
if behind_vehicle_state and self.speed < get_speed(behind_vehicle) :
if (right_turn == carla.LaneChange.Right or right_turn == carla.LaneChange.Both) and waypoint.lane_id * right_wpt.lane_id > 0 and right_wpt.lane_type == carla.LaneType.Driving :
new_vehicle , _ ,_ = self._bh_is_vehicle_hazard(waypoint , location , vehicle_list , max(self.behavior.min_proximity_threshold , self.speed_limit/2) , up_angle_th = 180 , lane_offset = 1)
if not new_vehicle :
print('tailgating moving towards right')
self.behavior.tailgate_counter = 200
self.set_destination(right_wpt.transform.location , end_waypoint.transform.location , clean = True)
elif left_turn == carla.LaneChange.Left and waypoint.lane_id * left_wpt.lane_id > 0 and right_wpt.lane_type == carla.LaneType.Driving :
new_vehicle , _ , _ = self._bh_is_vehicle_hazard(waypoint , location , vehicle_list , max(self.behavior.min_proximity_threshold , self.speed_limit/2) , up_angle_th = 180 , lane_offset = -1)
if not new_vehicle_state :
print('tailgating , moving to the left !')
self.behavior.tailgate_counter = 200
self.set_destination(left_wpt.transform.location , self.end_waypoint.transform.location , clean = True)
def collision_and_car_avoid_manager(self , location , waypoint):
print('collision_and_car_avoid_manager called')